A simplex approach for finding local solutions of a linear bilevel program by equilibrium points

DOI10.1007/s10479-005-2450-5zbMath1091.90038OpenAlexW2032476260MaRDI QIDQ817135

Susana Scheimberg, Manoel B. Campêlo

Publication date: 7 March 2006

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

Full work available at URL: https://doi.org/10.1007/s10479-005-2450-5

zbMATH Keywords

simplex methodlocal optimizationbilevel linear programming

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs, Optimal storage and transmission investments in a bilevel electricity market model, Stochastic dynamic lot-sizing problem using bi-level programming base on artificial intelligence techniques, A bi-level programming framework for stochastic replenishment policy in a supply chain: approach and computational test, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• A computational study of global algorithms for linear bilevel programming
• On the structure and properties of a linear multilevel programming problem
• A sequential LCP method for bilevel linear programming
• A penalty function approach for solving bi-level linear programs
• Bilevel and multilevel programming: A bibliography review
• Multilevel optimization: algorithms and applications
• A symmetrical linear maxmin approach to disjoint bilinear programming
• A study of local solutions in linear bilevel programming
• Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
• Generating Linear and Linear-Quadratic Bilevel Programming Problems
• An investigation of the linear three level programming problem
• New Branch-and-Bound Rules for Linear Bilevel Programming
• A cutting plane algorithm for solving bilinear programs
• Two-Level Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item