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.

UW_tiny_logo.gifAbout PATH

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

Supported Versions

AIMMS supports PATH 4.7.

Download a free license to use PATH as a mixed complementarity programming solver in AIMMS.