Interfaces to PATH 3.0: Design, implementation and usage

被引：83

作者：

Ferris, MC ^{[1
]}

Munson, TS ^{[1
]}

机构：

[1] Univ Wisconsin, Dept Comp Sci, Madison, WI 53706 USA

来源：

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS | 1999年 / 12卷 / 1-3期

关键词：

complementarity problems; variational inequalities; algorithms;

D O I：

10.1023/A:1008636318275

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：207 / 227

页数：21

共 37 条

[1]

[Anonymous], P 8 INT C DISTR COMP

[2]

[Anonymous], THESIS U WISCONSIN M

[3]

[Anonymous], 1983, 8320 SOL STANF U

[4] A comparison of large scale mixed complementarity problem solvers [J].