Pessimistic linear bilevel optimization problems with coupling constraints are equivalent to pessimistic and optimistic versions without them.
A survey on bilevel optimization under uncertainty
3 Pith papers cite this work, alongside 102 external citations. Polarity classification is still indexing.
3
Pith papers citing it
102
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
math.OC 3roles
background 1polarities
background 1representative citing papers
Develops an exact finite-convergence algorithm for Σ₂^p-hard mixed-integer bilevel stochastic programs via extended single-level reformulation and stochastic cutting planes.
Workshop notes explain models, subproblems, globalization, and convergence assumptions for PIPA, monotone-LCP PIPA, implicit-programming, and PSQP algorithms applied to MPECs.
citing papers explorer
-
On Coupling Constraints in Pessimistic Linear Bilevel Optimization
Pessimistic linear bilevel optimization problems with coupling constraints are equivalent to pessimistic and optimistic versions without them.
-
An Exact Algorithm for Mixed-Integer Bilevel Stochastic Problem
Develops an exact finite-convergence algorithm for Σ₂^p-hard mixed-integer bilevel stochastic programs via extended single-level reformulation and stochastic cutting planes.
-
Optimization Workshop Notes for Mathematical Programming with Equilibrium Constraints Algorithms: Penalty Interior-Point, Implicit-Programming, and Piecewise SQP
Workshop notes explain models, subproblems, globalization, and convergence assumptions for PIPA, monotone-LCP PIPA, implicit-programming, and PSQP algorithms applied to MPECs.