Skip to main content
SpringerLink
Log in

Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity

  • Published:
Mathematical Programming Submit manuscript

Abstract

Recently, several authors [8, 10] have argued for the use of extended formulations to tighten production planning models. In this work we present two linear-programming extended formulations of the constant-capacity lot-sizing problem with backlogging. The first one applies to the problem with a general cost function and has O(n 3) variables and constraints. This improves on the more straightforward O(n 4) Florian and Klein [2] type formulation. The second one applies when the costs satisfy the Wagner-Whitin property but it has O(n 2) variables and O(n 3) constraints. As a by-product, we positively answer an open question of Miller and Wolsey [4] about the tightness of an extended formulation for the continuous mixing set.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Eppen, G.D., Martin, R.K.: Solving multi-item lot-sizing problems using variable definition. Operations Research 35, 832–848 (1985)

    Google Scholar 

  2. Florian, M., Klein, M.: Deterministic production planning with concave costs and capacity constraints. Management Science 18, 12–20 (1971)

    MathSciNet  Google Scholar 

  3. Günlük, O., Pochet, Y.: Mixing mixed-integer inequalities. Mathematical Programming A 90, 429–457 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Miller, A.J., Wolsey, L.: Tight MIP formulations for multi-item discrete lot-sizing problems. To appear in Operations Research.

  5. Pochet, Y., Wolsey, L. A.: Lot-size models with backlogging: Strong formulations and cutting planes. Mathematical Programming A 40, 317–335 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  6. Pochet, Y., Wolsey, L.A.: Lot-sizing with constant batches: Formulations and valid inequalities. Mathematics of Operations Research 18, 767–785 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  7. Pochet, Y., Wolsey, L.A.: Polyhedra for lot-sizing with Wagner-Whitin costs. Mathematical Programming A 67, 297–323 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  8. Van Vyve, M.: A Solution Approach of Production Planning Problems based on Compact Formulations for Single-Item Lot-Sizing Problems. PhD thesis, Faculté des Sciences, Université catholique de Louvain, June 2003.

  9. Wagner, H.M., Whitin, T.M.: Dynamic version of the economic lot size model. Management Science 5, 89–96 (1958)

    MATH  MathSciNet  Google Scholar 

  10. Wolsey, L. A.: Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Management Science 48, 1587–1602 (2002)

    Article  Google Scholar 

  11. Wolsey, L. A.: Strong formulations for mixed integer programs: valid inequalities and extended formulations. Mathematical Programming B 97, 423–447 (2003)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center of Operations Research and Econometrics (CORE), Université catholique de Louvain. 34, voie du Roman Pays, 1348, Louvain-la-Neuve, Belgium

    Mathieu Van Vyve

Authors
  1. Mathieu Van Vyve
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mathieu Van Vyve.

Additional information

This text presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Minister's Office, Science Policy Programming. The research was carried out with financial support of the Growth Project G1RD-1999-00034 (LISCOS) of the European Community. The scientific responsibility is assumed by the author.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vyve, M. Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity. Math. Program. 108, 53–77 (2006). https://doi.org/10.1007/s10107-004-0521-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-004-0521-z

Keywords

Search

Navigation