Location of Repository

Uncapacitated lot sizing with backlogging: The convex hull



An explicit description of the convex hull of solutions to the uncapacitated lot sizing problem with backlogging, in its natural space of production, setup, inventory and backlogging variables, has been an open question for many years. In this paper, we identify valid inequalities that subsume all previously known valid inequalities for this problem. We show that these inequalities are enough to describe the convex hull of solutions. We give polynomial separation algorithms for some special cases. Finally, we report a summary of computational experiments with our inequalities that illustrates their effectiveness.lot sizing backlogging convex hull separation algorithms computation

OAI identifier:

Suggested articles



  1. (1969). A backlogging model and a multi-echelon model of a dynamic economic lot size production system { A network approach.
  2. (1966). A deterministic multi-period production scheduling model with backlogging.
  3. (2000). A polyhedral approach to a production planning problem.
  4. (2006). Approximate extended formulations.
  5. (1988). Integer and Combinatorial Optimization.
  6. (1998). Integer Programming.
  7. (1993). J.B.: Network Flows: Theory, Algorithms, and Applications.
  8. (2003). L.A.: A branch-and-cut algorithm for the singlecommodity, uncapacitated, ¯xed-charge network °ow problem.
  9. (2006). Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity.
  10. (1988). Lot-size models with backlogging: Strong reformulations and cutting planes.
  11. (1999). Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs.
  12. (1994). Polyhedra for lot-sizing with Wagner-Whitin costs.
  13. (1991). Solving multi-item lot-sizing problems using strong cutting planes.
  14. (2002). Solving multi-item lot-sizing problems with an MIP solver using classi¯cation and reformulation.
  15. (1993). The dynamic lot-sizing model with backlogging: A simple O(nlogn) algorithm and minimal forecast horizon procedure.
  16. (1985). Valid inequalities and separation for uncapacitated ¯xed charge networks.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.