Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty

DOI10.1016/j.orl.2011.06.013zbMath1235.90104OpenAlexW1965056266MaRDI QIDQ408396

Mu-Hong Zhang

Publication date: 5 April 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2011.06.013

zbMATH Keywords

minimax regretmixed integer programmingrobust optimizationlot-sizing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems ⋮ An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives ⋮ Comparison of different approaches to multistage lot sizing with uncertain demand ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Robust inventory control under demand and lead time uncertainty ⋮ Recent advances in robust optimization: an overview ⋮ Robust Postdonation Blood Screening Under Prevalence Rate Uncertainty ⋮ Robust optimization for lot-sizing problems under yield uncertainty

Cites Work

• Unnamed Item
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Adjustable robust solutions of uncertain linear programs
• Robust solutions of linear programming problems contaminated with uncertain data
• Minmax regret solutions for minimax optimization problems with uncertainty
• Interval data minmax regret network optimization problems
• The minmax regret permutation flow-shop problem with two jobs
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• Dynamic Version of the Economic Lot Size Model
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
• The Price of Robustness
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• On the complexity of a class of combinatorial optimization problems with uncertainty