A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints

DOI10.1057/JORS.2009.84MaRDI QIDQ4929860zbMATH OpenOpenAlexFDO

Authors Yohan Shim, Antonio J. Conejo, S. de la Torre, Steven A. Gabriel, R. García-Bertrand

Publication date 24 September 2010

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.2009.84

zbMATH Keywords

game theoryinteger programmingplanning

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
• Benders' decomposition for the constrained \(\ell_ 1\)-problem
• A class of Benders decomposition methods for variational inequalities
• Benders decomposition for multiobjective programs with cone inclusions
• The application of generalized Benders decomposition to certain nonconcave programs
• Benders decomposition approach to robust mixed integer programming
• Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
• A new decomposition algorithm for globally solving mathematical programs with affine equilibrium constraints
• A differential equation method for solving equilibrium programming with constraints
• A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints

Cited in

(14)

• Measuring the effects of price controls using mixed complementarity models
• An analytical approach to the protection planning of a rail intermodal terminal network
• Dual market facility network design under bounded rationality
• A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
• A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
• An SOS1-based approach for solving MPECs with a natural gas market application
• Solving discretely-constrained Nash-Cournot games with an application to power markets
• Solving a location problem of a Stackelberg firm competing with Cournot-Nash firms
• Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints
• Optimizing system resilience: a facility protection model with recovery time
• A new decomposition algorithm for globally solving mathematical programs with affine equilibrium constraints
• An exact algorithmic framework for a class of mixed-integer programs with equilibrium constraints
• Bilevel programming for price-based electricity auctions: a revenue-constrained case
• AAR-based decomposition algorithm for non-linear convex optimisation

This page was built for publication: A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4929860)