Abstract
In this paper, we introduce a generalization of the well-known continuous mixing set (which we refer to as the continuous n-mixing set) \(Q^{m,n}:=\{ (y, v,s) \in ( {\mathbb{Z}} \times{\mathbb{Z}}_{+}^{n-1})^{m} \times{\mathbb R}^{m+1}_{+}: \sum_{t=1}^n{\alpha_t y_t^i} + v_i + s\geq{\beta}_i, i=1,\ldots,m\}\). This set is closely related to the feasible set of the multi-module capacitated lot-sizing (MML) problem with(out) backlogging. For each n′ ∈ {1,…,n }, we develop a class of valid inequalities for this set, referred to as the n′-step cycle inequalities, and show that they are facet-defining for conv(Q m,n) in many cases. We also present a compact extended formulation for Q m,n and an exact separation algorithm for the n′-step cycle inequalities. We then use these inequalities to generate valid inequalities for the MML problem with(out) backlogging. Our computational results show that our cuts are very effective in solving the MML instances with backlogging, resulting in substantial reduction in the integrality gap, number of nodes, and total solution time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Atamtürk, A., Günlük, O.: Mingling: mixed-integer rounding with bounds. Mathematical Programming 123(2), 315–338 (2010)
Atamtürk, A., Kianfar, K.: n-step mingling inequalities: new facets for the mixed-integer knapsack set. Mathematical Programming 132(1), 79–98 (2012)
Cherkassky, B.V., Goldberg, A.V.: Negative-cycle detection algorithms. Mathematical Programming 85(2), 277–311 (1999)
Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 3rd edn. McGraw-Hill Higher Education (2009)
Dash, S., Günlük, O.: Valid inequalities based on simple mixed-integer sets. Mathematical Programming 105(1), 29–53 (2006)
Günlük, O., Pochet, Y.: Mixing mixed-integer inequalities. Mathematical Programming 90(3), 429–457 (2001)
Kianfar, K., Fathi, Y.: Generalized mixed integer rounding inequalities: facets for infinite group polyhedra. Mathematical Programming 120(2), 313–346 (2009)
Nemhauser, G.L., Wolsey, L.A.: A recursive procedure to generate all cuts for 0–1 mixed integer programs. Mathematical Programming 46(1-3), 379–390 (1990)
Pochet, Y., Wolsey, L.A.: Lot-Sizing with constant batches: Formulation and valid inequalities. Mathematics of Operations Research 18, 767–785 (1993)
Ralph, E.: Gomory: An algorithm for the mixed integer problem. Tech. Rep. RM-2597, RAND Corporation (1960)
Sanjeevi, S., Kianfar, K.: Mixed n-step MIR inequalities: Facets for the n-mixing set. Discrete Optimization 9(4), 216–235 (2012)
Shigeno, M., Iwata, S., McCormick, S.T.: Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow. Mathematics of Operations Research 25(1), 76–104 (2000)
Tarjan, R.E.: Data structures and network algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1983)
Vyve, M.V.: The continuous mixing polyhedron. Mathematics of Operations Research 30(2), 441–452 (2005)
Wolsey, L.A.: Integer Programming. Wiley, New York (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Bansal, M., Kianfar, K. (2014). n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem. In: Lee, J., Vygen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2014. Lecture Notes in Computer Science, vol 8494. Springer, Cham. https://doi.org/10.1007/978-3-319-07557-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-07557-0_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07556-3
Online ISBN: 978-3-319-07557-0
eBook Packages: Computer ScienceComputer Science (R0)