PATH Solver for Mixed Complementarity Programming
The PATH solver is a Newton-based solver for solving Mixed Complementarity Programming (MCP) problems. The PATH solver is extensively used by economists for solving general equilibrium problems. PATH is a robust and efficient solver for most MCP problems.
PATH is developed and maintained by Steven Dirkse, Michael C. Ferris and Todd Munson.
AIMMS supports PATH 4.7.