Expressing complementarity problems in an algebraic modeling language and communicating them to solvers

被引:16
作者
Ferris, MC [1 ]
Fourer, R
Gay, DM
机构
[1] Univ Wisconsin, Dept Comp Sci, Madison, WI 53706 USA
[2] Northwestern Univ, Dept Ind Engn & Management Sci, Evanston, IL 60208 USA
[3] Lucent Technol, Bell Labs, Murray Hill, NJ 07974 USA
关键词
complementarity; algebraic modeling languages; optimization;
D O I
10.1137/S105262349833338X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Diverse problems in optimization, engineering, and economics have natural formulations in terms of complementarity conditions, which state (in their simplest form) that either a certain nonnegative variable must be zero or a corresponding inequality must hold with equality, or both. A variety of algorithms has been devised for solving problems expressed in terms of complementarity conditions. It is thus attractive to consider extending algebraic modeling languages, which are widely used for sending ordinary equations and inequality constraints to solvers, so that they can express complementarity problems directly. We describe an extension to the AMPL modeling language that can express the most common complementarity conditions in a concise and flexible way, through the introduction of a single new "complements" operator. We present details of an efficient implementation that incorporates an augmented presolve phase to simplify complementarity problems, and that converts complementarity conditions to a canonical form convenient for solvers.
引用
收藏
页码:991 / 1009
页数:19
相关论文
共 33 条
[1]  
[Anonymous], 1998, OPTIMIZATION MODELIN
[2]   OPTIMALITY CONDITIONS FOR THE BILEVEL PROGRAMMING PROBLEM [J].
BARD, JF .
NAVAL RESEARCH LOGISTICS, 1984, 31 (01) :13-26
[3]   AN ALGORITHM FOR SOLVING THE GENERAL BILEVEL PROGRAMMING PROBLEM [J].
BARD, JF .
MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (02) :260-272
[4]   CONVEX 2-LEVEL OPTIMIZATION [J].
BARD, JF .
MATHEMATICAL PROGRAMMING, 1988, 40 (01) :15-27
[5]   A comparison of large scale mixed complementarity problem solvers [J].
Billups, SC ;
Dirkse, SP ;
Ferris, MC .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1997, 7 (01) :3-25
[6]  
BISSCHOP J, 1982, MATH PROGRAM STUD, V20, P1, DOI 10.1007/BFb0121223
[7]  
Bisschop J., 1993, AIMMS: The Modeling System
[8]   ANALYSIS OF MATHEMATICAL PROGRAMMING PROBLEMS PRIOR TO APPLYING SIMPLEX ALGORITHM [J].
BREARLEY, AL ;
MITRA, G ;
WILLIAMS, HP .
MATHEMATICAL PROGRAMMING, 1975, 8 (01) :54-83
[9]  
Brooke A, 1992, GAMS: a user's guide
[10]  
CHINNECK JW, ANN OPER RES