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.

About PATH

PATH is developed and maintained by Steven Dirkse, Michael C. Ferris and Todd Munson.

Supported Versions

AIMMS supports PATH 4.7.

Last Updated: July, 2020