Bilevel Integer Programs with Stochastic Right-Hand Sides

DOI10.1287/ijoc.2020.1055OpenAlexW3135806572MaRDI QIDQ5084620

Osman Y. Özaltın, Junlong Zhang

Publication date: 28 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2020.1055

zbMATH Keywords

stochastic programminginteger programmingbranch-and-boundvalue functionbilevel programming

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

A survey on bilevel optimization under uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• A class of algorithms for mixed-integer bilevel min-max optimization
• An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
• Two-stage quadratic integer programs with stochastic right-hand sides
• Optimizing system resilience: a facility protection model with recovery time
• Enhanced exact algorithms for discrete bilevel linear problems
• A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
• A dynamic programming algorithm for the bilevel Knapsack problem
• Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization
• The bilevel knapsack problem with stochastic right-hand sides
• An exact algorithm for the capacitated facility location problems with single sourcing
• Practical bilevel optimization. Algorithms and applications
• Links between linear bilevel and mixed 0-1 programming problems
• A bilevel programming approach to determining tax credits for biofuel production
• Foundations of bilevel programming
• Solving discrete linear bilevel optimization problems using the optimal value reformulation
• On a class of bilevel linear mixed-integer programs in adversarial settings
• Weak linear bilevel programming problems: existence of solutions via a penalty method
• On the use of intersection cuts for bilevel optimization
• Deterministic network interdiction
• Discrete linear bilevel programming problem
• Stochastic mathematical programs with equilibrium constraints
• Resolution method for mixed integer bi-level linear problems based on decomposition technique
• Bilevel optimization applied to strategic pricing in competitive electricity markets
• An overview of bilevel optimization
• Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
• Extending the stochastic programming framework for the modeling of several decision makers: pricing and competition in the telecommunication sector
• A new method for strong-weak linear bilevel programming problem
• A solution approach to the weak linear bilevel programming problems
• On a stochastic bilevel programming problem
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Some Basis Theorems for Integral Monoids
• A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
• Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs
• A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
• Shortest-path network interdiction
• The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
• Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function
• A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem
• Bilevel Programming Problems
• Two-Level Linear Programming
• The Mixed Integer Linear Bilevel Programming Problem
• Pessimistic Bilevel Optimization
• On a Level-Set Characterization of the Value Function of an Integer Program and Its Application to Stochastic Programming
• Bilevel programming with knapsack constraints

This page was built for publication: Bilevel Integer Programs with Stochastic Right-Hand Sides