Robust inventory problem with budgeted cumulative demand uncertainty

DOI10.1007/s11590-022-01875-9zbMath1505.90090OpenAlexW4226042806MaRDI QIDQ2091209

Romain Guillaume, Adam Kasperski, Paweł Zieliński

Publication date: 1 November 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-022-01875-9

zbMATH Keywords

production planningrobust optimizationdemand uncertainty

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Robustness in mathematical programming (90C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A robust lot sizing problem with ill-known demands
• Computing robust basestock levels
• Geometric algorithms and combinatorial optimization.
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Single-item dynamic lot-sizing problems: an updated survey
• Production planning in furniture settings via robust optimization
• A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
• Production planning under demand uncertainty: a budgeted uncertainty approach
• Robust inventory theory with perishable products
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• A Dynamic Programming Approach for a Class of Robust Optimization Problems
• A Robust Optimization Approach to Inventory Theory
• The Price of Robustness
• Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
• Production Planning by Mixed Integer Programming
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Robust inventory problem with budgeted cumulative demand uncertainty