Sequence Independent, Simultaneous and Multidimensional Lifting of Generalized Flow Covers for the Semi-Continuous Knapsack Problem with Generalized Upper Bounds Constraints

  • Alejandro Angulo
  • Daniel Espinoza
  • Rodrigo Palma
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8494)


We consider the semi-continuous knapsack problem with generalized upper bound constraints on binary variables. We prove that generalized flow cover inequalities are valid in this setting. We also prove that, under mild assumptions, they are facet-defining inequalities for the full problem. We then focus on simultaneous lifting of pairs of variables. The associated lifting problem naturally induce multidimensional lifting functions, and we prove that a simple relaxation, in a restricted domain, is a superadditive function. We also prove that in many cases this approximation is actually the optimal lifting function. We then analyze the separation problem, which we separate in two phases: first, find a seed inequality, where we evaluate both exact and heuristic methods; secondly, since the lifting is simultaneous, our class of lifted inequalities might contain an exponential number of them. We choose a strategy of maximizing resulting violation. Finally, we test this class of inequalities on instances arising from electricity planning problems. Our test show that the proposed class of inequalities are strong in the sense that adding a few of these inequalities, they close, on average, 57.70% percent of the root integrality gap, and close 97.70% of the relative gap, while adding very few cuts.


Knapsack problem sequence independent multidimensional lifting generalized upper bounds 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Atamtürk, A.: Sequence independent lifting for mixed-integer programming (2004)Google Scholar
  2. 2.
    Balas, E.: Facets of the knapsack polytope. Mathematical Programming 8, 146–164 (1975)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Balas, E., Jeroslow, R.: Canonical cuts on the unit hypercube. Mathematical Programming 23, 61–69 (1972)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Balas, E., Zemel, E.: Facets of the knapsack polytope from minimal covers. SIAM J. Appl. Math. 34, 119–148 (1978)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profiles. Mathematical Programming 91(2), 201–213 (2002)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Gu, Z., Nemhauser, G., Savelsbergh, M.: Lifted flow cover inequalities for mixed 0-1 integer programs. Mathematical Programming 85, 439–468 (1999)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Gu, Z., Nemhauser, G., Savelsbergh, M.: Sequence independent lifting in mixed integer programming. Journal of Combinatorial Optimization 4, 109–129 (2000)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Johnson, E.L., Padberg, M.W.: A note on the knapsack problem with special ordered sets. Operational Research Letters 1, 18–22 (1981)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Louveaux, Q., Wolsey, L.A.: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. Annals OR 153, 47–77 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley (1988)Google Scholar
  11. 11.
    Padberg, M. (1,k)-configurations and facets for packing problems. Mathematical Programming 18, 94–99 (1980)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Roy, T.V., Wolsey, L.: Valid inequalities for mixed 0-1 programs. Discrete Applied Mathematics 14, 199–213 (1986)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Sherali, H., Lee, Y.: Sequential and simultaneous lifting of minimal cover inequalities for generalized upper bound constrained knapsack polytopes. SIAM J. Disc. Math. 8, 133–153 (1995)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Wolsey, L.: Valid inequalities for 0-1 knapsack and mips with generalized upper bound constraints. Discrete Applied Mathematics 29, 251–261 (1988)CrossRefMathSciNetGoogle Scholar
  15. 15.
    Wolsey, L.A.: Facets of linear inequalities in 0-1 variables. Mathematical Programming 8, 165–178 (1975)CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    Wolsey, L.A.: Valid inequalities and superadditivity for 0/1 integer programs. Mathematics of Operations Research 2, 65–77 (1977)CrossRefMathSciNetGoogle Scholar
  17. 17.
    Zeng, B.: Efficient Lifting Methods for Unstructured Mixed Integer Programs with Multiple Constraints. Ph.D. thesis, Purdue University. Industrial Engineering Department (2007)Google Scholar
  18. 18.
    Zeng, B., Richard, J.P.P.: Sequence independent lifting for 0-1 knapsack problems with disjoint cardinality constraints (2006)Google Scholar
  19. 19.
    Zeng, B., Richard, J.P.P.: A framework to derive multidimensional superadditive lifting functions and its applications. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 210–224. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Alejandro Angulo
    • 1
  • Daniel Espinoza
    • 1
  • Rodrigo Palma
    • 2
  1. 1.Department of Industrial EngineeringUniversidad de ChileChile
  2. 2.Department of Electrical EngineeringUniversidad de ChileChile

Personalised recommendations