Skip to main content
SpringerLink
Log in

Superadditive characterizations of pure integer programming feasibility

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We derive a new family of integer programming (IP) Farkas’ lemmas based on superadditive duality. We construct a certificate of infeasibility for an IP as a function of its right-hand side. We develop a recursive approach to compute such a function.

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. Blair, C.E., Jeroslow, R.G.: The value function of an integer program. Math. Program. 23(1), 237–273 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  2. Carøe, C.C., Tind, J.: L-shaped decomposition of two-stage stochastic programs with integer recourse. Math. Program. 83(1–3), 451–464 (1998)

    Article  Google Scholar 

  3. Dawande, M.W., Hooker, J.N.: Inference-based sensitivity analysis for mixed integer/linear programming. Oper. Res. 48(4), 623–634 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. In: Hammer, P.L., Johnson, E.L., Korte, B.H., Nemhauser, G.L. (eds). Studies in Integer Programming, Annals of Discrete Mathematics, vol. 1, pp. 185–204. Elsevier, Amsterdam (1977)

  5. Farkas, G.: On the applications of the mechanical principle of Fourier. Math. Termtud. Ért. 12, 457–472 (1894)

    Google Scholar 

  6. Gilmore, P.C., Gomory, R.E.: The theory and computation of knapsack functions. Oper. Res. 14(6), 1045–1074 (1966)

    Article  MathSciNet  Google Scholar 

  7. Köppe, M., Weismantel, R.: Cutting planes from a mixed integer Farkas lemma. Oper. Res. Lett. 32(3), 207–211 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lasserre, J.B.: A discrete Farkas lemma. Discret. Optim. 1(1), 67–75 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Trapp, A.C., Prokopyev, O.A., Schaefer, A.J.: On a level-set characterization of the value function of an integer program and its application to stochastic programming. Oper. Res. 61(2), 498–511 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  10. Wolsey, L.A.: Integer programming duality: price functions and sensitivity analysis. Math. Program. 20(1), 173–195 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

This paper was supported by National Science Foundation Grants CMMI-1100082, CMMI-1333758, and CMMI-1400009.

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, USA

    Amin Dehghanian & Andrew J. Schaefer

Authors
  1. Amin Dehghanian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew J. Schaefer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrew J. Schaefer.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dehghanian, A., Schaefer, A.J. Superadditive characterizations of pure integer programming feasibility. Optim Lett 10, 181–188 (2016). https://doi.org/10.1007/s11590-015-0885-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-015-0885-4

Keywords

Search

Navigation