A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints
From MaRDI portal
Publication:4929860
DOI10.1057/jors.2009.84zbMath1206.90175OpenAlexW1977665573MaRDI QIDQ4929860
S. de la Torre, Antonio J. Conejo, Yohan Shim, Raquel García-Bertrand, Steven A. Gabriel
Publication date: 24 September 2010
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.2009.84
Integer programming (90C10) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (11)
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 ⋮ A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints ⋮ Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints ⋮ AAR-based decomposition algorithm for non-linear convex optimisation ⋮ Optimizing system resilience: a facility protection model with recovery time ⋮ A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints ⋮ Measuring the effects of price controls using mixed complementarity models ⋮ An analytical approach to the protection planning of a rail intermodal terminal network ⋮ Bilevel programming for price-based electricity auctions: a revenue-constrained case ⋮ Dual market facility network design under bounded rationality
This page was built for publication: A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints
