Pessimistic linear bilevel optimization problems with coupling constraints are equivalent to pessimistic and optimistic versions without them.
Bilevel Programming: A Combinatorial Per- spective
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
Derives an explicit stability criterion for parquet fixed-point iterations showing convergence issues arise independently of vertex divergences and demonstrates a controlled stabilization method that reaches the physical solution across multiple divergence lines.
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.