The NEOS Server offers PATH for the solution of mixed complementarity
problems (MCP) in GAMS format.
The PATH solver is a Newton-based solver that combines a number of the most
effective variations, extensions, and enhancements of this powerful technique.
It is available as a GAMS subsystem, providing the complementarity and
equilibrium modeler with a powerful tool to solve large and difficult models.
The documentation for GAMS/PATH is available on the GAMS Solvers webpage.
Algorithmic details can also be found in papers and technical
reports by the original developers of PATH: Steven Dirkse, Michael Ferris, and Todd Munson.
Using the NEOS Server with PATH
The user must submit a model in GAMS
format to solve a mixed complementarity problem.
For security purposes, the model
submitted must adhere to the following conventions:
If you are unfamiliar with GAMS, the
GAMS Documentation Center
includes a GAMS Tutorial and User's Guide. Examples of models in GAMS
format can be found in the
GAMS Model Libraries.
- 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.
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.