Add BARONMP

ampl · Dec 2, 2024 · 3f3dc7a · 3f3dc7a
1 parent cbb34ac
commit 3f3dc7a
Show file tree

Hide file tree

Showing 2 changed files with 51 additions and 9 deletions.
diff --git a/docs/source/solvers/baron/index.md b/docs/source/solvers/baron/index.md
@@ -4,10 +4,14 @@
 
 BARON is a general nonlinear optimizer capable of solving nonconvex optimization problems to global optimality. Decision variables may be continuous, integer, or a mixture of the two. BARON has been used for applications in the chemical process industries, pharmaceuticals, energy production, engineering design, and asset management.
 
+An experimental version of the driver, BARONMP, supports the extended modeling capabilities of the [MP library](https://mp.ampl.com/).
+
 [[Read More](https://ampl.com/products/solvers/solvers-we-sell/baron/)]
 [[Options](options.md)]
+[[BARONMP Options](baronmp.md)]
 [[Changes](changes.md)]
-[[Download BARON](https://portal.ampl.com/user/ampl/download/baron)]
+[[BARONMP Changes](changesmp.md)]
+[[Download BARON and BARONMP](https://portal.ampl.com/user/ampl/download/baron)]
 
 ## How to use it
 
@@ -61,16 +65,54 @@ BARON is a general nonlinear optimizer capable of solving nonconvex optimization
         - `MATLAB <https://ampl.com/api/latest/matlab>`_
 ```
 
-## Options
+## Resources
 
-Full list of solver options:
-```{toctree}
-options.md
+* [BARONMP modeling guide](https://mp.ampl.com/model-guide.html)
+* [Solver options](options.md)
+* [BARONMP solver options](baronmp.md)
+* [BARONMP solve result codes](#retrieving-solutions)
+* [BARONMP sources](https://github.com/ampl/mp/tree/develop/solvers/baronmp)
+
+
+## Retrieving solutions
+
+The outcome of the last optimization is stored in the AMPL parameter `solve_result_num` and the relative message in
+`solve_result`.
+
+```ampl
+display solve_result_num, solve_result;
 ```
-```{toctree}
-:hidden:
-baronmp.md
+
+BARONMP solve result codes can be obtained by running `baronmp -!` or `ampl: shell "baronmp -!";`:
 ```
+          0- 99 solved: optimal for an optimization problem, feasible for a satisfaction problem
+        100-199 solved? solution candidate returned but error likely
+            150 solved? MP solution check failed (option sol:chk:fail)
+        200-299 infeasible
+            201     infeasible, IIS found
+            202     infeasible, IS found, possibly not irreducible
+            203     infeasible, IIS sought but not found
+        300-349 unbounded, feasible solution returned
+        350-399 unbounded, no feasible solution returned
+        400-449 limit, feasible: stopped, e.g., on iterations or Ctrl-C
+            400     node limit reached
+            401     iteration limit reached
+            402     CPU time limit reached
+        450-469 limit, problem is either infeasible or unbounded
+        470-499 limit, no solution returned
+        500-999 failure, no solution returned
+            500     licensing error
+            501     numerical difficulties
+            502     interrupted (Control-C)
+            503     too little memory
+            504     terminated by BARON
+            505     BARON syntax error (should not happen)
+            506     operation not supported by BARON
+            507     Interrupted by Control-C
+```
+
+For general information, see [MP result codes guide](https://mp.ampl.com/features-guide.html#solve-result-codes).
+
 
 ## Changelog
 

diff --git a/docs/source/solvers/gurobi/index.md b/docs/source/solvers/gurobi/index.md
@@ -5,7 +5,7 @@
 Gurobi is a powerful commercial suite of optimization products, which includes simplex
 and parallel barrier solvers to handle linear programming (LP) and quadratic programming (QP),
 also quadratically constrained (QCP, SOCP) and the mixed-integer variations thereof (MIP, MIQP, MIQCP, MISOCP).
-It also supports some types of nonlinear expressions, this addressing MINLP.
+It also supports some types of nonlinear expressions, thus addressing MINLP.
 The MP framework used by the driver supports automatic reformulation for many expression types; the modeling guide can be
 found [here](https://mp.ampl.com/model-guide.html).