Nl (format)

Short description: File format for presenting and archiving mathematical programming problems

Nl (format)Filename extension| `.nl`

|

Developed by| Robert Fourer
David Gay
Brian Kernighan
Bell Labs
Type of format| Mathematical programming

nl is a file format for presenting and archiving mathematical programming problems.[1] Initially, this format has been invented for connecting solvers to AMPL.[2] It has also been adopted by other systems such as COIN-OR (as one of the input formats), FortSP (for interacting with external solvers), and Coopr (as one of its output formats).

The nl format supports a wide range of problem types, among them:

* Linear programming
* Quadratic programming
* Nonlinear programming
* Mixed-integer programming
* Mixed-integer quadratic programming with or without convex quadratic constraints
* Mixed-integer nonlinear programming
* Second-order cone programming
* Global optimization
* Semidefinite programming problems with bilinear matrix inequalities
* Complementarity problems (MPECs) in discrete or continuous variables
* Constraint programming[3]

The nl format is low-level and is designed for compactness, not for readability. It has both binary and textual representation. Most commercial and academic solvers accept this format either directly or through special driver programs.

The open-source AMPL Solver Library distributed via Netlib[4] and AMPL/MP library[5] provide nl parsers that are used in many solvers.

AMPL/MP library[5] contains an NL writer and SOL reader.

## See also

* sol (format) \- a file format for presenting solutions of mathematical programming problems

## References

1. ↑ David Gay (2005). Writing .nl Files (PDF) (Technical report). Albuquerque, NM: Sandia National Laboratories. CiteSeerX 10.1.1.60.9659. Archived from the original (PDF) on Dec 28, 2016.
2. ↑ David Gay (1993). Hooking Your Solver to AMPL (PDF) (Technical report). Murray Hill, NJ: Bell Laboratories. 97-4-06.
3. ↑ Robert Fourer; David M. Gay (2002). "Extending an Algebraic Modeling Language to Support Constraint Programming". INFORMS Journal on Computing 14 (4): 322–344. doi:10.1287/ijoc.14.4.322.2825. http://joc.journal.informs.org/content/14/4/322.
4. ↑ "Netlib/Ampl". http://www.netlib.org/ampl/.
5. ↑ 5.0 5.1 "Ampl/Mp". 10 April 2022. https://github.com/ampl/mp.

* v
* t
* e

Mathematical optimization software

Data formats|

* Mathematica
* MPS
* nl
* sol

Modeling tools|

* AIMMS
* AMPL
* APMonitor
* ECLiPSe-CLP
* GEKKO
* GAMS
* GNU MathProg
* JuMP
* LINDO
* OPL
* Mathematica
* OptimJ
* PuLP
* Pyomo
* TOMLAB
* Xpress-Mosel
* ZIMPL

LP, MILP∗ solvers|

* APOPT∗
* Artelys Knitro∗
* BCP∗
* CLP
* CBC∗
* CPLEX∗
* FortMP∗
* GCG∗
* GLPK/GLPSOL∗
* Gurobi∗
* LINDO∗
* Lp_solve
* LOQO
* Mathematica
* MINOS
* MINTO∗
* MOSEK∗
* SCIP∗
* SoPlex
* SYMPHONY∗
* Xpress-Optimizer∗

QP, MIQP∗ solvers|

* APOPT∗
* Artelys Knitro∗
* CBC∗
* CLP
* CPLEX∗
* FortMP∗
* Gurobi∗
* IPOPT
* LINDO∗
* Mathematica
* MINOS
* MOSEK∗
* SCIP∗
* Xpress-Optimizer∗

QCP, MIQCP∗ solvers|

* APOPT∗
* Artelys Knitro∗
* CPLEX∗
* Gurobi∗
* IPOPT
* LINDO∗
* Mathematica
* MINOS
* MOSEK∗
* SCIP∗
* Xpress-Optimizer∗
* Xpress-SLP∗

SOCP, MISOCP∗ solvers|

* Artelys Knitro∗
* CPLEX∗
* Gurobi∗
* LINDO∗
* LOQO
* Mathematica
* MOSEK∗
* SCIP∗
* Xpress-Optimizer∗

SDP, MISDP∗ solvers|

* Mathematica
* MOSEK

NLP, MINLP∗ solvers|

* AOA∗
* APOPT∗
* Artelys Knitro∗
* BARON∗
* Couenne∗
* Galahad library
* IPOPT
* LINDO∗
* LOQO
* MIDACO∗
* MINOS
* NLPQLP
* NPSOL
* SCIP∗
* SNOPT∗
* WORHP
* Xpress-SLP∗

GO solvers|

* BARON
* Couenne∗
* Mathematica
* LINDO
* SCIP

CP solvers|

* Comet
* CPLEX CP Optimizer
* Gecode
* Mathematica
* JaCoP

Metaheuristic solvers|

* OptaPlanner

* List of optimization software
* Comparison of optimization software

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Nl (format). Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Nl_(format)&oldid=187995"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template