Computing robust basestock levels
From MaRDI portal
Publication:951115
DOI10.1016/j.disopt.2006.12.002zbMath1151.90498OpenAlexW2152575352MaRDI QIDQ951115
Publication date: 29 October 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.12.002
Related Items (35)
Dynamic lot sizing with stochastic demand timing ⋮ A robust optimization approach to wine grape harvesting scheduling ⋮ Robust inventory theory with perishable products ⋮ Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty ⋮ Robust Investment Management with Uncertainty in Fund Managers’ Asset Allocation ⋮ Stochastic optimization in supply chain networks: averaging robust solutions ⋮ Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: a robust optimization approach ⋮ Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow ⋮ Convex Maximization via Adjustable Robust Optimization ⋮ Robust multi‐echelon inventory management with multiple suppliers ⋮ Operational Research in the Wine Supply Chain ⋮ Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty ⋮ A robust model for the lot-sizing problem with uncertain demands ⋮ Robust inventory control under demand and lead time uncertainty ⋮ Robust Optimization of Dose-Volume Metrics for Prostate HDR-Brachytherapy Incorporating Target and OAR Volume Delineation Uncertainties ⋮ A perfect information lower bound for robust lot-sizing problems ⋮ A robust optimization approach to assess the effect of delays in the connection-to-the-grid time of new generation power plants over transmission expansion planning ⋮ A survey of adjustable robust optimization ⋮ Distribution-dependent robust linear optimization with applications to inventory control ⋮ Robust inventory management with multiple supply sources ⋮ An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times ⋮ Optimizing (\(s, S\)) policies for multi-period inventory models with demand distribution uncertainty: robust dynamic programing approaches ⋮ Recent advances in robust optimization: an overview ⋮ Production planning in furniture settings via robust optimization ⋮ Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems ⋮ Robust formulations for economic lot-sizing problem with remanufacturing ⋮ Robust multi-product newsvendor model with uncertain demand and substitution ⋮ Decomposition for adjustable robust linear optimization subject to uncertainty polytope ⋮ New product launch decisions with robust optimization ⋮ Two-stage network constrained robust unit commitment problem ⋮ Robust Inventory Management: An Optimal Control Approach ⋮ A Dynamic Programming Approach for a Class of Robust Optimization Problems ⋮ Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem ⋮ Robust inventory problem with budgeted cumulative demand uncertainty ⋮ Robust optimization for lot-sizing problems under yield uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- Robust solutions of uncertain linear programs
- Geometric algorithms and combinatorial optimization.
- Adjustable robust solutions of uncertain linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- Inventory management under highly uncertain demand
- Robust Convex Optimization
- Universal-stability results and performance bounds for greedy contention-resolution protocols
- A calculus for network delay. I. Network elements in isolation
- An Efficient Algorithm for Computing Optimal (s, S) Policies
- (s, S) Policies for a Dynamic Inventory Model with Stochastic Lead Times
- A Robust Optimization Approach to Inventory Theory
- A Single-Unit Decomposition Approach to Multiechelon Inventory Systems
- The Price of Robustness
- The Distribution Free Newsboy Problem: Review and Extensions
- Distribution Free Procedures for Some Inventory Models
- On the Opimality of $( {s,S} )$ Inventory Policies: New Conditions and a New Proof
This page was built for publication: Computing robust basestock levels
