A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints

DOI10.1007/s10479-012-1191-5zbMath1288.90111OpenAlexW2066875648MaRDI QIDQ2442073

Yohan Shim, Steven A. Gabriel, Asgeir Tomasgard, Marte Fodstad

Publication date: 31 March 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11250/2463982

zbMATH Keywords

optimizationglobal optimizationbilevel programmingmathematical program with equilibrium constraintsbranch-and-bound methoddiscrete planning and decision making

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators ⋮ A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs ⋮ A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs ⋮ A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive facility location on decentralized supply chains
• Partitioning procedures for solving mixed-variables programming problems
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• Dual decomposition in stochastic integer programming
• Foundations of bilevel programming
• Algorithms for solving the mixed integer two-level linear programming problem
• Global solution of nonlinear mixed-integer bilevel programs
• Resolution method for mixed integer bi-level linear problems based on decomposition technique
• Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
• New branch-and-Cut algorithm for bilevel linear programming
• An overview of bilevel optimization
• A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• On the Global Solution of Linear Programs with Linear Complementarity Constraints
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A Representation and Economic Interpretation of a Two-Level Programming Problem
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Cross decomposition for mixed integer programming
• A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints
• The Mixed Integer Linear Bilevel Programming Problem
• Lagrange Multipliers and Nonconvex Programs

This page was built for publication: A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints