Release Baron and CPLEX

docs/source/releases/index.md

@@ -5,11 +5,11 @@
 
 - [**AMPL** Changelog (latest: **20241203**)](../releases/ampl.md)
 - [**BARON** Changelog (latest: **20240508**)](../solvers/baron/changes.md)
-- [**BARONMP** Changelog (latest: **20241119**)](../solvers/baron/changesmp.md)
+- [**BARONMP** Changelog (latest: **20241206**)](../solvers/baron/changesmp.md)
 - [**CBC** Changelog (latest: **20241128**)](../solvers/cbc/changes.md)
 - [**CONOPT** Changelog (latest: **20240201**)](../solvers/conopt/changes.md)
 - [**COPT** Changelog (latest: **20240724**)](../solvers/copt/changes.md)
-- [**CPLEX** Changelog (latest: **20240828**)](../solvers/cplex/changes.md)
+- [**CPLEX** Changelog (latest: **20241206**)](../solvers/cplex/changes.md)
 - [**CPLEXASL** Changelog (latest: **20230228**)](../solvers/cplex/changesasl.md)
 - [**GCG** Changelog (latest: **20240115**)](../solvers/gcg/changes.md)
 - [**GUROBI** Changelog (latest: **20241119**)](../solvers/gurobi/changes.md)
@@ -32,6 +32,10 @@
 ampl.md
 ```
 
+
+## 20241206
+- [BARONMP](../solvers/baron/changesmp.md#20241206)
+- [CPLEX](../solvers/cplex/changes.md#20241206)
 ## 20241203
 - [AMPL](../releases/ampl.md#20241203)
 ## 20241128

docs/source/solvers/baron/changesmp.md

@@ -1,5 +1,10 @@
 # BARONMP Changelog
 
+## 20241206
+- Fixed issue with variable and constraint names containing invalid
+  characters
+- Added solve results information
+
 
 ## 20241119
 - Beta release of MP driver for Baron, use with option `option solver baronmp;`,

docs/source/solvers/cplex/changes.md

@@ -1,5 +1,9 @@
 # CPLEX Changelog
 
+## 20241206
+- Added support for sensitivity analysis (keyword `sensitivity`)
+- Added keywords `mip:nodefile`, `tech:workdir`, `tech:workfilelim`
+
 
 ## 20240828
 - Options `primalopt`, `dualopt`, `baropt`, `siftopt`, `netopt`, `bendersopt` are now

docs/source/solvers/cplex/options.md

@@ -72,13 +72,6 @@ acc:linle
       1 - Accepted but automatic redefinition will be used where possible
       2 - Accepted natively and preferred
 
-acc:linrange (acc:linrng)
-      Solver acceptance level for 'LinConRange' as flat constraint, default 2:
-
-      0 - Not accepted natively, automatic redefinition will be attempted
-      1 - Accepted but automatic redefinition will be used where possible
-      2 - Accepted natively and preferred
-
 acc:pl (acc:pwl, acc:piecewise)
       Solver acceptance level for 'PLConstraint' as flat constraint, default
       2:
@@ -255,8 +248,9 @@ alg:primal (primalopt)
       Solve (MIP root) LPs by primal simplex method.
 
 alg:rays (rays)
-      Whether to return suffix .unbdd if the objective is unbounded or suffix
-      .dunbdd if the constraints are infeasible:
+      Whether to return suffix .unbdd (unbounded ray) if the objective is
+      unbounded or suffix .dunbdd (Farkas dual) if the constraints are
+      infeasible:
 
       0 - Neither
       1 - Just .unbdd
@@ -269,6 +263,32 @@ alg:relax (relax)
 alg:rhspen (rhspen)
       See alg:feasrelax.
 
+alg:sens (sens, solnsens, sensitivity)
+      Whether to return suffixes for solution sensitivities, i.e., ranges of
+      values for which the optimal basis remains optimal (note that the
+      variable and objective values can change):
+
+      0 - No (default)
+      1 - Yes: suffixes returned on variables are
+      .sensobjlo = smallest objective coefficient
+      .sensobjhi = greatest objective coefficient
+      .senslblo = smallest variable lower bound
+      .senslbhi = greatest variable lower bound
+      .sensublo = smallest variable upper bound
+      .sensubhi = greatest variable upper bound;
+
+      suffixes for all constraints are
+
+      .senslblo = smallest constraint lower bound
+      .senslbhi = greatest constraint lower bound
+      .sensublo = smallest constraint upper bound
+      .sensubhi = greatest constraint upper bound;
+
+      suffixes for one-sided constraints only:
+
+      .sensrhslo = smallest right-hand side value
+      .sensrhshi = greatest right-hand side value.
+
 alg:sifting (sifting, siftopt, siftingopt)
       Solve (MIP root) LPs by sifting method.
 
@@ -698,6 +718,14 @@ mip:inttol (inttol, intfeastol, integrality)
       Feasibility tolerance for integer variables (default 1e-05, must be in
       [0.0, 0.5])
 
+mip:nodefile (nodefile)
+      Whether to save node information in a temporary file:
+
+      0 - no
+      1 - compressed node file in memory (default)
+      2 - node file on disk
+      3 - compressed node file on disk
+
 mip:nodemethod (nodemethod, mipalg, mipalgorithm)
       Algorithm used to solve relaxed MIP node problems; for MIQP problems
       (quadratic objective, linear constraints), settings other than 3 and 5
@@ -750,6 +778,13 @@ mip:round_reptol (round_reptol)
       Tolerance for reporting rounding of integer variables to integer values;
       see "mip:round". Default = 1e-9.
 
+mip:search (mipsearch)
+      Search strategy for mixed-integer problems:
+
+      0 - Automatic (default)
+      1 - Traditional branch and cut
+      2 - Dynamic search
+
 mip:submipalg (submipalg)
       Choice of algorithm used to solve the subproblems of a subMIP: not a
       subproblem, but an auxiliary MIP that CPLEX sometimes forms and solves,
@@ -1160,6 +1195,13 @@ tech:wantsol (wantsol)
       4 - Dual variables to stdout
       8 - Suppress solution message.
 
+tech:workdir (nodefiledir, workfiledir, workdir)
+      Directory where CPLEX creates a temporary subdirectory for temporary
+      files, e.g., for node information and Cholesky factors.
+
+tech:workfilelim (workfilelim)
+      Maximum size in megabytes for in-core work "files". Default 2048.
+
 tech:writegraph (cvt:writegraph, writegraph, exportgraph)
       File to export conversion graph. Format: JSON Lines.