A perfect information lower bound for robust lot-sizing problems
From MaRDI portal
Publication:1730584
DOI10.1007/s10479-018-2908-xzbMath1411.90020OpenAlexW2608962134WikidataQ129736728 ScholiaQ129736728MaRDI QIDQ1730584
Michael Poss, Dritan Nace, Marcio Costa Santos
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-018-2908-x
Linear programming (90C05) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (5)
Robust inventory theory with perishable products ⋮ Decision rule-based method in solving adjustable robust capacity expansion problem ⋮ Comparison of different approaches to multistage lot sizing with uncertain demand ⋮ A survey of adjustable robust optimization ⋮ A survey of decision making and optimization under uncertainty
Uses Software
Cites Work
- The robust vehicle routing problem with time windows
- Primal and dual linear decision rules in stochastic and robust optimization
- Computing robust basestock levels
- Robust discrete optimization and network flows
- Adjustable robust solutions of uncertain linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- Robust optimization of uncertain multistage inventory systems with inexact data in decision rules
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Robust combinatorial optimization with variable budgeted uncertainty
- Robust counterparts of inequalities containing sums of maxima of linear functions
- Robust scheduling with budgeted uncertainty
- 2-stage robust MILP with continuous recourse variables
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Robust Convex Optimization
- A Dynamic Programming Approach for a Class of Robust Optimization Problems
- Multistage Robust Mixed-Integer Optimization with Adaptive Partitions
- Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
- Introduction to Stochastic Programming
- Distributionally Robust Optimization and Its Tractable Approximations
- Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
- Lagrangean Decomposition for Mean-Variance Combinatorial Optimization
- A Robust Optimization Approach to Inventory Theory
- Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization
- The Price of Robustness
- Sharp Bounds on the Value of Perfect Information
- The Value of Information and Stochastic Programming
This page was built for publication: A perfect information lower bound for robust lot-sizing problems
