On formulations of the stochastic uncapacitated lot-sizing problem

DOI10.1016/J.ORL.2005.05.004MaRDI QIDQ2494816zbMATH OpenOpenAlexFDO

Authors Yongpei Guan, S. Ahmed, Andrew J. Miller, G. L. Nemhauser

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 hulllot-sizingmixed integer programmingreformulationseparation

Mathematics Subject Classification ID

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

Recommendations

• Extended formulations for stochastic lot-sizing problems
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs
• Uncapacitated lot-sizing: The convex hull of solutions
• The uncapacitated lot-sizing problem with sales and safety stocks

Cites work

• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
• scientific article; zbMATH DE number 3568353 (Why is no real title available?)
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Mixing mixed-integer inequalities
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Sequential Pairing of Mixed Integer Inequalities
• The mixed vertex packing problem.
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• Uncapacitated lot-sizing: The convex hull of solutions

Cited in

(22)

• A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand
• Stochastic lot sizing problem with nervousness considerations
• Single-item dynamic lot-sizing problems: an updated survey
• A polyhedral study of the static probabilistic lot-sizing problem
• Extended formulations for stochastic lot-sizing problems
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
• A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging
• Two-stage stochastic lot-sizing problem under cost uncertainty
• A multistage stochastic lot-sizing problem with cancellation and postponement under uncertain demands
• Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds
• Modeling industrial lot sizing problems: a review
• New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem
• Comparison of different approaches to multistage lot sizing with uncertain demand
• Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs
• Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
• On a Multi-stage Stochastic Programming Model for Inventory Planning
• An \(O(N^2)\)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times
• Uncapacitated flow-based extended formulations
• On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
• Lot-sizing on a tree
• Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution

This page was built for publication: On formulations of the stochastic uncapacitated lot-sizing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494816)