NEOS Server Home

NEOS Interfaces to CONOPT

WWW Form & Sample Submissions


The NEOS Server offers CONOPT for the solution of nonlinearly constrained optimization problems in AMPL format.

CONOPT is a feasible path method based on the GRG algorithm. CONOPT is well suited for models with very non-linear constraints. It is a fast method for finding a first feasible solution that is particularly well suited for models with few degrees of freedom. Also, if you have a model where many equations can be solved one by one, CONOPT will take advantage of this property. Similarly, intermediate variables only used to define objective function terms are eliminated from the model and the constraints are moved into the objective function.

CONOPT was developed by
ARKI Consulting and Development
Bagsvaerdvej 246 A
DK-2880 Bagsvaerd, Denmark

Using the NEOS Server for CONOPT

The user must submit a model in AMPL format to solve a nonlinearly constrained optimization problem. Examples of models in AMPL format can be found in the netlib collection. Enter the location of the ampl model (local file)
Model File:

Enter the location of the ampl data file (local file)
Data File:

Enter the location of the ampl commands file (local file)
Commands File:


Dry run: generate job XML instead of submitting it to NEOS
Short Priority: submit to higher priority queue with maximum CPU time of 5 minutes
e-mail address:

By submitting a job, you have accepted the Terms of Use
Please do not click the 'Submit to NEOS' button more than once.

Submit comments and questions Terms of Use