Skip to main content
SpringerLink
Log in

On the existence of optimal solutions to integer and mixed-integer programming problems

  • Published:
Mathematical Programming Submit manuscript

Abstract

The purpose of this paper is to present sufficient conditions for the existence of optimal solutions to integer and mixed-integer programming problems in the absence of upper bounds on the integer variables. It is shown that (in addition to feasibility and boundedness of the objective function) (1) in the pure integer case a sufficient condition is that all of the constraints (other than non-negativity and integrality of the variables) beequalities, and (2) that in the mixed-integer caserationality of the constraint coefficients is sufficient. Some computational implications of these results are also given.

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. G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, N.J., 1963).

    Google Scholar 

  2. S. Halfin, “Arbitrarily complex corner polyhedra are dense inR n”,SIAM Journal on Applied Mathematics 23 (1972) 157–163.

    Google Scholar 

  3. R.G. Jeroslow, “On the unlimited number of faces in integer hulls of linear problems with two constraints”, Tech. Rept. No. 67, Department of Operations Research, Cornell University, Ithaca, N.Y. (April, 1969).

    Google Scholar 

  4. R.G. Jeroslow, “Comments on integer hulls of two linear constraints”,Operations Research 19 (1971) 1061–1069.

    Google Scholar 

  5. R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, N.J., 1970).

    Google Scholar 

  6. D.S. Rubin, “On the unlimited number of faces in integer hulls of linear programs with a single constraint”,Operations Research 18 (1970) 940–946.

    Google Scholar 

  7. D.S. Rubin, “The neighboring vertex cut and other cuts derived with Gomory's asymptotic algorithm”, Ph.D. Thesis, The University of Chicago, 1970.

  8. H.M. Stark,An introduction to number theory (Markham Publishing Company, Chicago, 1970).

    Google Scholar 

  9. L.A. Wolsey, “Group theoretic results in mixed integer programming”,Operations Research 19 (1971) 1691–1697.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Wisconsin, Madison, Wisconsin, USA

    R. R. Meyer

Authors
  1. R. R. Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Sponsored by the United States Army under Contract No. DA-31-124-ARO-D-462.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meyer, R.R. On the existence of optimal solutions to integer and mixed-integer programming problems. Mathematical Programming 7, 223–235 (1974). https://doi.org/10.1007/BF01585518

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01585518

Keywords

Search

Navigation