A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
JJ Júdice, HD Sherali, IM Ribeiro… - Journal of Global …, 2006 - Springer
JJ Júdice, HD Sherali, IM Ribeiro, AM Faustino
Journal of Global Optimization, 2006•SpringerIn this paper a branch-and-bound algorithm is proposed for finding a global minimum to a
Mathematical Programming Problem with Complementarity (or Equilibrium) Constraints
(MPECs), which incorporates disjunctive cuts for computing lower bounds and employs a
Complementarity Active-Set Algorithm for computing upper bounds. Computational results
for solving MPECs associated with Bilivel Problems, NP-hard Linear Complementarity
Problems, and Hinge Fitting Problems are presented to highlight the efficacy of the …
Mathematical Programming Problem with Complementarity (or Equilibrium) Constraints
(MPECs), which incorporates disjunctive cuts for computing lower bounds and employs a
Complementarity Active-Set Algorithm for computing upper bounds. Computational results
for solving MPECs associated with Bilivel Problems, NP-hard Linear Complementarity
Problems, and Hinge Fitting Problems are presented to highlight the efficacy of the …
Abstract
In this paper a branch-and-bound algorithm is proposed for finding a global minimum to a Mathematical Programming Problem with Complementarity (or Equilibrium) Constraints (MPECs), which incorporates disjunctive cuts for computing lower bounds and employs a Complementarity Active-Set Algorithm for computing upper bounds. Computational results for solving MPECs associated with Bilivel Problems, NP-hard Linear Complementarity Problems, and Hinge Fitting Problems are presented to highlight the efficacy of the procedure in determining a global minimum for different classes of MPECs.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果