A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem
From MaRDI portal
Publication:5148196
DOI10.1287/ijoc.2019.0927OpenAlexW3025942161MaRDI QIDQ5148196
Publication date: 1 February 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2019.0927
Related Items (2)
Bilevel Integer Programs with Stochastic Right-Hand Sides ⋮ A survey on bilevel optimization under uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A method to bypass the lack of solutions in minsup problems under quasi-equilibrium constraints
- Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting
- Parametric integer programming algorithm for bilevel mixed integer programs
- Practical bilevel optimization. Algorithms and applications
- Links between linear bilevel and mixed 0-1 programming problems
- On a new class of bilevel programming problems and its use for reformulating mixed integer problems
- A bilevel programming approach to determining tax credits for biofuel production
- A partial cooperation model for non-unique linear two-level decision problems
- Foundations of bilevel programming
- On a class of bilevel linear mixed-integer programs in adversarial settings
- Weak linear bilevel programming problems: existence of solutions via a penalty method
- Weak via strong Stackelberg problem: New results
- Equilibrium network design of shared-vehicle systems
- Linear bilevel multi-follower programming with independent followers
- An overview of bilevel optimization
- A new method for strong-weak linear bilevel programming problem
- A solution approach to the weak linear bilevel programming problems
- Using EPECs to Model Bilevel Games in Restructured Electricity Markets with Locational Prices
- Joint Design and Pricing on a Network
- A regularization method for ill-posed bilevel optimization problems
- Network design problem with congestion effects: A case of bilevel programming
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
- On the computation of relaxed pessimistic solutions to MPECs
- Necessary optimality conditions in pessimistic bilevel programming
- Two-Level Linear Programming
- Pessimistic Bilevel Optimization
- Mathematical Programs with Optimization Problems in the Constraints
This page was built for publication: A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem
