Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization
Top Cited Papers
- 1 November 2020
- journal article
- research article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 68 (6) , 1716-1721
Abstract
There's No Free Lunch in Bilevel OptimizationKeywords
This publication has 22 references indexed in Scilit:
- Bilevel programming and price setting problems4OR, 2012
- Using EPECs to Model Bilevel Games in Restructured Electricity Markets with Locational PricesOperations Research, 2007
- The EU regulation on cross-border trade of electricity: A two-stage equilibrium modelEuropean Journal of Operational Research, 2007
- A Bilevel Model of Taxation and Its Application to Optimal Highway PricingManagement Science, 1998
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedronComputational Geometry, 1997
- Descent approaches for quadratic bilevel programmingJournal of Optimization Theory and Applications, 1994
- New Branch-and-Bound Rules for Linear Bilevel ProgrammingSIAM Journal on Scientific and Statistical Computing, 1992
- Some properties of the bilevel programming problemJournal of Optimization Theory and Applications, 1991
- A Branch and Bound Algorithm for the Bilevel Programming ProblemSIAM Journal on Scientific and Statistical Computing, 1990
- Boundedness relations for linear constraint setsLinear Algebra and its Applications, 1970