fixed variable use in benchmarks

Author: alonsoC1s

benchmarks/OptimizationCUTEst/CUTEst.jmd

@@ -26,6 +26,8 @@ using OptimizationMOI: MOI as MOI
 using DataFrames
 using Plots
 using StatsPlots
+
+plotlyjs() # Facilitating interaction with the resulting plots
 ```
 
 # Benchmarks
@@ -124,7 +126,7 @@ optimizer.
 eq_unb_problems = CUTEst.select(min_con=1, only_equ_con=true, only_free_var=true)
 
 # Analysis
-eq_unb_results =  run_benchmarks(unc_problems, optimizers)
+eq_unb_results =  run_benchmarks(eq_unb_problems, optimizers)
 
 @df eq_unb_results scatter(:n_vars, :secs,
         group = :solver,
@@ -140,12 +142,70 @@ Next, we examine the same relationship for problems with inequality-constrained
 neq_unb_problems = CUTEst.select(min_con=1, only_ineq_con=true, only_free_var=true)
 
 # Analysis
-neq_unb_results =  run_benchmarks(unc_problems, optimizers)
+neq_unb_results =  run_benchmarks(neq_unb_problems, optimizers)
 
 @df neq_unb_results scatter(:n_vars, :secs,
         group = :solver,
         xlabel = "n. variables",
         ylabel = "secs.",
         title = "Time to solution by optimizer and number of vars",
     )
+```
+
+## Equality/Inequality constrained problems with bounded variables
+
+Now we analyze the subset of problems with equality/inequality constraints and whose
+variables are bounded. There are 666 such problems.
+
+The following figure shows the results of the same benchmarks previously described for the
+problems on this section.
+
+```julia
+eq_bou_problems = CUTEst.select(min_con=1, only_equ_con=true, only_free_var=false)
+
+# Analysis
+eq_bou_results =  run_benchmarks(eq_bou_problems, optimizers)
+
+@df eq_bou_results scatter(:n_vars, :secs,
+        group = :solver,
+        xlabel = "n. variables",
+        ylabel = "secs.",
+        title = "Time to solution by optimizer and number of vars",
+    )
+```
+
+Next, we examine the same relationship for problems with inequality-constrained problems,
+of which there are 244.
+
+```julia
+neq_bou_problems = CUTEst.select(min_con=1, only_ineq_con=true, only_free_var=false)
+
+# Analysis
+neq_bou_results =  run_benchmarks(neq_bou_problems, optimizers)
+
+@df neq_bou_results scatter(:n_vars, :secs,
+        group = :solver,
+        xlabel = "n. variables",
+        ylabel = "secs.",
+        title = "Time to solution by optimizer and number of vars",
+    )
+```
+
+# Quadratic programs with linear constraints
+
+Lastly, we examine the problems with a quadratic objective function and only linear
+constraints. There are 252 such problems in the suite.
+
+```julia
+quad_problems = CUTEst.select(objtype="quadratic", contype="linear")
+
+# Analysis
+quad_results =  run_benchmarks(quad_problems, optimizers)
+
+@df neq_bou_results scatter(:n_vars, :secs,
+        group = :solver,
+        xlabel = "n. variables",
+        ylabel = "secs.",
+        title = "Time to solution by optimizer and number of vars",
+    )
 ```