Advertisement

Mathematical Programming

, Volume 154, Issue 1–2, pp 113–144 | Cite as

\(n\)-Step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem

  • Manish Bansal
  • Kiavash Kianfar
Full Length Paper Series B

Abstract

In this paper, we introduce a generalization of the continuous mixing set, which we refer to as the continuous multi-mixing set. This set is closely related to the feasible set of the multi-module capacitated lot-sizing (MML) problem with(out) backlogging. We present a family of valid inequalities for the continuous multi-mixing set and identify conditions under which they are facet-defining. The cycle inequalities, \(n\)-step MIR inequalities, and mixed \(n\)-step MIR inequalities are special cases of these inequalities. We also present an exact separation algorithm for our inequalities. We then use these inequalities to generate valid inequalities for MML with(out) backlogging. Our computational results show that our cuts are very effective in solving the MML instances, resulting in substantial reduction in the integrality gap, number of nodes, and total solution time.

Keywords

\(n\)-Step cycle inequalities \(n\)-Step MIR Continuous multi-mixing Multi-module capacitated lot-sizing with/without backlogging Mixed integer programming Cutting planes 

Mathematics Subject Classification

90C10 90C11 90C57 90C90 

Notes

Acknowledgments

This work was supported by the National Science Foundation Grants CMMI-1100343 and CMMI-1435526, which are gratefully acknowledged.

References

  1. 1.
    Atamtürk, A., Günlük, O.: Mingling: mixed-integer rounding with bounds. Math. Program. 123(2), 315–338 (2010)zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Atamtürk, A., Kianfar, K.: \(n\)-Step mingling inequalities: new facets for the mixed-integer knapsack set. Math. Program. 132(1), 79–98 (2012)zbMATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Bansal, M., Kianfar, K.: Facets for continuous multi-mixing set with general coefficients and bounded integer variables. (2014, under review). Available at http://www.optimization-online.org/DB_HTML/2014/10/4610.html
  4. 4.
    Cherkassky, B.V., Goldberg, A.V.: Negative-cycle detection algorithms. Math. Program. 85(2), 277–311 (1999)zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 3rd edn. McGraw-Hill Higher Education, New York (2009)zbMATHGoogle Scholar
  6. 6.
    Dash, S., Goycoolea, M., Günlük, O.: Two-step MIR inequalities for mixed integer programs. INFORMS J. Comput. 22(2), 236–249 (2010)zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Dash, S., Günlük, O.: Valid inequalities based on simple mixed-integer sets. Math. Program. 105(1), 29–53 (2006)zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra, I. Math. Program. 3(1), 23–85 (1972)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra, II. Math. Program. 3(1), 359–389 (1972)zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Günlük, O., Pochet, Y.: Mixing mixed-integer inequalities. Math. Program. 90(3), 429–457 (2001)zbMATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Kianfar, K., Fathi, Y.: Generalized mixed integer rounding inequalities: facets for infinite group polyhedra. Math. Program. 120(2), 313–346 (2009)zbMATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Kianfar, K., Fathi, Y.: Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions. Eur. J. Oper. Res. 207, 105–109 (2010)zbMATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    Miller, A.J., Wolsey, L.A.: Tight formulations for some simple mixed integer programs and convex objective integer programs. Math. Program. 98(1–3), 73–88 (2003)zbMATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    Nemhauser, G.L., Wolsey, L.A.: A recursive procedure to generate all cuts for 0–1 mixed integer programs. Math. Program. 46(1–3), 379–390 (1990)zbMATHMathSciNetCrossRefGoogle Scholar
  15. 15.
    Pochet, Y., Wolsey, L.A.: Lot-sizing with constant batches: formulation and valid inequalities. Math. Oper. Res. 18, 767–785 (1993)zbMATHMathSciNetCrossRefGoogle Scholar
  16. 16.
    Gomory, R.E.: An algorithm for the mixed integer problem. Tech. Rep. RM-2597, RAND Corporation (1960)Google Scholar
  17. 17.
    Sanjeevi, S., Kianfar, K.: Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set. Discrete Optim. 9(4), 216–235 (2012)zbMATHMathSciNetCrossRefGoogle Scholar
  18. 18.
    Shigeno, M., Iwata, S., McCormick, S.T.: Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow. Math. Oper. Res. 25(1), 76–104 (2000)zbMATHMathSciNetCrossRefGoogle Scholar
  19. 19.
    Tarjan, R.E.: Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia (1983)CrossRefGoogle Scholar
  20. 20.
    Vyve, M.V.: The continuous mixing polyhedron. Math. Oper. Res. 30(2), 441–452 (2005)zbMATHMathSciNetCrossRefGoogle Scholar
  21. 21.
    Wolsey, L.A.: Integer Programming. Wiley, New York (1998)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society 2015

Authors and Affiliations

  1. 1.Department of Industrial and Systems EngineeringTexas A&M UniversityCollege StationUSA

Personalised recommendations