Theoretical and numerical comparison of seven single-level reformulations for bilevel programs
Yu-Wei Li, Gui-Hua Lin, Xide Zhu

TL;DR
This study compares seven single-level reformulations of bilevel programs, demonstrating that duality-based reformulations generally outperform the MPCC approach, with new tighter reformulations showing promising results.
Contribution
The paper introduces three new duality-based reformulations with tighter feasible regions and provides a comprehensive numerical comparison of seven reformulations.
Findings
WDP/MDP/TWDP/TMDP outperform MPCC in numerical tests
eMDP/eTMDP are consistently the worst reformulations
Duality-based reformulations perform 3-5 times better than MPCC
Abstract
This paper considers a bilevel program. To solve this bilevel program, it is generally necessary to transform it into some single-level optimization problem. One approach is to replace the lower-level program by its KKT conditions to transform the bilevel program as a mathematical program with complementarity constraints (MPCC). Another approach is to apply the lower-level Wolfe/Mond-Weir/extended Mond-Weir duality to transform the bilevel program into some duality-based single-level reformulations, called WDP, MDP, and eMDP respectively in the literature. In this paper, inspired by a conjecture from a recent publication that the tighter feasible region of a reformulation, the better its numerical performance, we present three new duality-based single-level reformulations, called TWDP/TMDP/eTMDP, with tighter feasible regions. Our main goal is to compare all above-mentioned…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Advanced Optimization Algorithms Research · Risk and Portfolio Optimization
