On formulations of the stochastic uncapacitated lot-sizing problem

DOI10.1016/j.orl.2005.05.004zbMath1113.90085OpenAlexW2083726572MaRDI QIDQ2494816

Shabbir Ahmed, Yongpei Guan, Andrew J. Miller, Nemhauser, George I.

Publication date: 30 June 2006

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

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

zbMATH Keywords

convex hullmixed integer programmingseparationlot-sizingreformulation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15) Discrete location and assignment (90B80)

Related Items

A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand, Stochastic lot sizing problem with nervousness considerations, Two-stage stochastic lot-sizing problem under cost uncertainty, Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs, Stochastic lot-sizing problem with inventory-bounds and constant order-capacities, Comparison of different approaches to multistage lot sizing with uncertain demand, Single-item dynamic lot-sizing problems: an updated survey, On a Multi-stage Stochastic Programming Model for Inventory Planning, A polyhedral study of the static probabilistic lot-sizing problem, Lot-sizing on a tree, Modeling industrial lot sizing problems: a review, Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution, A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem

Cites Work

• Unnamed Item
• A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• Polyhedra for lot-sizing with Wagner-Whitin costs
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• Uncapacitated lot-sizing: The convex hull of solutions
• Sequential Pairing of Mixed Integer Inequalities
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• The mixed vertex packing problem.
• Mixing mixed-integer inequalities