A survey on bilevel optimization under uncertainty
From MaRDI portal
Publication:6096565
DOI10.1016/j.ejor.2023.01.008OpenAlexW4318942333MaRDI QIDQ6096565
Ivana Ljubić, Martin Schmidt, Yasmine Beck
Publication date: 15 September 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.01.008
Related Items (5)
A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities ⋮ Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem ⋮ Exploiting the polyhedral geometry of stochastic linear bilevel programming ⋮ On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level ⋮ Rejection-proof mechanisms for multi-agent kidney exchange
Cites Work
- Sequential Shortest Path Interdiction with Incomplete Information
- Shortest-path network interdiction
- Sequential Interdiction with Incomplete Information and Learning
- A Bilevel Stochastic Programming Problem with Random Parameters in the Follower’s Objective Function
- Methods for Pessimistic Bilevel Optimization
- Bilevel Linear Optimization Under Uncertainty
- A Unified Framework for Multistage Mixed Integer Linear Optimization
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Fortification Against Cascade Propagation Under Uncertainty
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- On Bilevel Optimization with Inexact Follower
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem
- Bilevel Programming Problems
- Risk-Averse Models in Bilevel Stochastic Linear Programming
- Pricing Toll Roads under Uncertainty
- Pessimistic Bilevel Optimization
- MULTI-LEADER-FOLLOWER GAMES: MODELS, METHODS AND APPLICATIONS
- Robust bi-level optimization models in transportation science
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Mathematical Programs with Optimization Problems in the Constraints
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
- Bilevel programming and price setting problems
- Bilevel programming with knapsack constraints
- Existence of Solutions for Deterministic Bilevel Games under a General Bayesian Approach
- A survey on mixed-integer programming techniques in bilevel optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust facility location problem for hazardous waste transportation
- On the value of exposure and secrecy of defense system: first-mover advantage vs. robustness
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Bilevel stochastic linear programming problems with quantile criterion
- Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting
- Maximizing a class of submodular utility functions
- Robust solutions to Stackelberg games: addressing bounded rationality and limited observations in human cognition
- Computing technical capacities in the European entry-exit gas market is NP-hard
- Prioritized interdiction of nuclear smuggling via tabu search
- Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice
- The bilevel knapsack problem with stochastic right-hand sides
- Games with imperfectly observable commitment
- Scenario reduction in stochastic programming
- Robust discrete optimization and network flows
- Adjustable robust solutions of uncertain linear programs
- A partial cooperation model for non-unique linear two-level decision problems
- Foundations of bilevel programming
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences
- Risk-averse stochastic path detection
- On a class of bilevel linear mixed-integer programs in adversarial settings
- Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
- Weak linear bilevel programming problems: existence of solutions via a penalty method
- Commitment and observability in games
- Applying the minimum risk criterion in stochastic recourse programs
- Stochastic mathematical programs with equilibrium constraints
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Robust strategic bidding in auction-based markets
- A second-order sufficient optimality condition for risk-neutral bi-level stochastic linear programs
- On the complexity of robust bilevel optimization with uncertain follower's objective
- A robust approach for modeling limited observability in bilevel optimization
- The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling
- On continuity in risk-averse bilevel stochastic linear programming with random lower level objective function
- On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints
- Deciding the feasibility of a booking in the European gas market is coNP-hard
- Global optimization for the multilevel European gas market system with nonlinear flow models on trees
- On Nash-Stackelberg-Nash games under decision-dependent uncertainties: model and equilibrium
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
- A bilevel optimization approach to decide the feasibility of bookings in the European gas market
- The stochastic bilevel continuous knapsack problem with uncertain follower's objective
- Uncertain bidding zone configurations: the role of expectations for transmission and generation capacity expansion
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- Complexity of near-optimal robust versions of multilevel optimization problems
- Network interdiction with asymmetric cost uncertainty
- Convex hull representation of the deterministic bipartite network interdiction problem
- A survey of network interdiction models and algorithms
- Bookings in the European gas market: characterisation of feasibility and computational complexity results
- Robust optimization for the hazardous materials transportation network design problem
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints
- A probabilistic bi-level linear multi-objective programming problem to supply chain planning
- A multilevel model of the European entry-exit gas market
- Is pessimistic bilevel programming a special case of a mathematical program with complementarity constraints?
- Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Bilevel optimization applied to strategic pricing in competitive electricity markets
- SPAR: Stochastic Programming with Adversarial Recourse
- Extending the stochastic programming framework for the modeling of several decision makers: pricing and competition in the telecommunication sector
- An exact penalty method for weak linear bilevel programming problem
- A new method for strong-weak linear bilevel programming problem
- Electricity swing option pricing by stochastic bilevel optimization: a survey and new approaches
- A pessimistic bilevel stochastic problem for elastic shape optimization
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Robust Convex Optimization
- Stochastic Network Interdiction
- A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Risk-Averse Shortest Path Interdiction
- On a stochastic bilevel programming problem
- Introduction to Stochastic Programming
- Distributionally Robust Optimization and Its Tractable Approximations
- A Stochastic Multiple-Leader Stackelberg Model: Analysis, Computation, and Application
- Theory and Applications of Robust Optimization
- Minimizing a stochastic maximum-reliability path
- Reformulation and sampling to solve a stochastic network interdiction problem
- Shortest path network interdiction with asymmetric information
- Bilevel Knapsack with Interdiction Constraints
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction
- Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation
- The Price of Robustness
- Light Robustness
- The polynomial hierarchy and a simple model for competitive analysis
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- An analysis of approximations for maximizing submodular set functions—I
- Variational Analysis
- Optimization under Decision-Dependent Uncertainty
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs
- Reduction of the bilevel stochastic optimization problem with quantile objective function to a mixed‐integer problem
- Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems
- A decomposition algorithm applied to planning the interdiction of stochastic networks
This page was built for publication: A survey on bilevel optimization under uncertainty
