The NEOS Server offers PATHNLP for the solution of nonlinearly constrained
optimization problems in GAMS format.
PATHNLP finds stationary points for the nonlinear problem by solving
the Karush-Kuhn-Tucker conditions, written as a mixed complementarity problem,
PATH Solver. Documentation for GAMS/PATHNLP is available
in the GAMS Documentation. Algorithmic details also can be
found in reports by the original developers of PATH: Steven Dirkse, Michael Ferris, and Todd Munson.
Using the NEOS Server for PATHNLP
The user must submit a model in GAMS
format to solve a nonlinear optimization problem. For security purposes,
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
also is available.
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.