On the Wagner-Whitin Lot-Sizing Polyhedron

@article{Pereira2001OnTW,
  title={On the Wagner-Whitin Lot-Sizing Polyhedron},
  author={Olivier Pereira and Laurence A. Wolsey},
  journal={Math. Oper. Res.},
  year={2001},
  volume={26},
  pages={591-600}
}
We study a family of unbounded polyhedra arising in the study of uncapacitated lot-sizing problems with Wagner-Whitin costs. We present a new proof of integrality based on completely characterizing the bounded faces of maximal dimension, and in particular showing that they are integral. Withn the number of periods, we derive an O( n2) algorithm to express any point within the polyhedron as a convex combination of extreme points and extreme rays. We also study adjacency on the polyhedra, and… 

Figures from this paper

Tight formulations for some simple mixed integer programs and convex objective integer programs
TLDR
The polyhedral structure of simple mixed integer sets that generalize the two variable set {(s,z)R1+×ℤ1:s≥z−b} is studied and a complete description by valid inequalities and/or an integral extended formulation is given.
Single-item dynamic lot-sizing problems: An updated survey
Erim Report Series Research in Management Meta-heuristics for Dynamic Lot Sizing: a Review and Comparison of Solution Approaches Bibliographic Data and Classifications
Proofs from complexity theory as well as computational experiments indicate that most lot sizing problems are hard to solve. Because these problems are so difficult, various solution techniques have

References

SHOWING 1-10 OF 10 REFERENCES
Polyhedra for lot-sizing with Wagner—Whitin costs
We examine the single-item lot-sizing problem with Wagner—Whitin costs over ann period horizon, i.e.pt+ht⩾pt+1 fort = 1, ⋯,n−1, wherept, ht are the unit production and storage costs in periodt
Lot-sizing polyhedra with a cardinality constraint
Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
TLDR
An algorithm to solve the economic lot sizing problem in O(n log n) time is presented and it is shown how the Wagner-Whitin case can even be solved in linear time.
Uncapacitated lot-sizing: The convex hull of solutions
TLDR
The convex hull of the solutions of the economic lot-sizing model is given, and an alternative formulation as a simple plant location problem is examined, and here too the convex Hull of solutions is obtained.
A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0n log n or 0n Time
This paper is concerned with the general dynamic lot size model, or generalized Wagner-Whitin model. Let n denote the number of periods into which the planning horizon is divided. We describe a
Improved Algorithms for Economic Lot Size Problems
TLDR
This paper shows that for many of these concave cost economic lot size problems, the dynamic programming formulation of the problem gives rise to a special kind of array, called a Monge array, and shows how the structure of Monge arrays can be exploited to obtain significantly faster algorithms for these economic lots size problems.
Models and algorithms for single-item lot sizing problems
• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of
Whitin, Dynamic Version of the Economic Lot
  • Size Model, Management Science
  • 1958
Wagelmans, A dual algorithm for the economic lot-sizing problem
  • European Journal of Operational Research
  • 1991