Interfaces to PATH 3.0: Design, Implementation and Usage (1998)
| Venue: | Computational Optimization and Applications |
| Citations: | 35 - 14 self |
BibTeX
@ARTICLE{Ferris98interfacesto,
author = {Michael C. Ferris and Todd S. Munson},
title = {Interfaces to PATH 3.0: Design, Implementation and Usage},
journal = {Computational Optimization and Applications},
year = {1998},
volume = {12},
pages = {207--227}
}
Years of Citing Articles
OpenURL
Abstract
Several new interfaces have recently been developed requiring PATH to solve a mixed complementarity problem. To overcome the necessity of maintaining a different version of PATH for each interface, the code was reorganized using object-oriented design techniques. At the same time, robustness issues were considered and enhancements made to the algorithm. In this paper, we document the external interfaces to the PATH code and describe some of the new utilities using PATH. We then discuss the enhancements made and compare the results obtained from PATH 2.9 to the new version. 1 Introduction The PATH solver [12] for mixed complementarity problems (MCPs) was introduced in 1995 and has since become the standard against which new MCP solvers are compared. However, the main user group for PATH continues to be economists using the MPSGE preprocessor [36]. While developing the new PATH implementation, we had two goals: to make the solver accessible to a broad audience and to improve the effecti...







