The NEOS Server offers CONOPT for the solution of nonlinearly constrained
optimization problems in GAMS format.
CONOPT is a feasible path method based on the GRG algorithm. CONOPT is
well-suited to models with very nonlinear constraints. It is a fast method for
finding a first feasible solution that is particularly well-suited to models
with few degrees of freedom. Also, for models where many equations
can be solved one by one, CONOPT will take advantage of this property.
Similarly, CONOPT eliminates from the model intermediate variables only used to define objective function terms and moves the constraints into the objective
CONOPT is developed and maintained by ARKI Consulting and Development A/S
in Bagsvaerdvej, Denmark. For more information, visit the
Using the NEOS Server with CONOPT
The user must submit a model in GAMS
format to solve a nonlinear programming problem. For security purposes,
the model submitted must adhere to the following conventions:
- It must be self contained, i.e., no $include or $batinclude statements.
- It may not execute external programs, i.e., no $call or execute statements.
- It may not create files, i.e., no put files or $echo statements.
If you are unfamiliar with GAMS, the GAMS Documentation includes a GAMS Tutorial and User's Guide.
Examples of models in GAMS
format can be found in the
GAMS model library and an
The NEOS Server initially limits the amount of output generated in the
listing file by turning off the symbol and unique element list, symbol
cross references, and restricting the rows and columns listed to zero.
This behavior can be changed by specifying the appropriate options
in the model file. See the
documentation on the
modeling language for further information.