Skip to main content
SpringerLink
Log in

A closed-form representation of mixed-integer program value functions

  • Published:
Mathematical Programming Submit manuscript

Abstract

We identify a class of formulas computable in polynomial time such that the functions defined by these formulas are precisely the value functions of mixed-integer programs with rational constraint coefficients.

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. C. Blair and R. Jeroslow, “The value function of a mixed integer program: I,”Discrete Mathematics 19 (1977) 121–138.

    Google Scholar 

  2. C. Blair and R. Jeroslow, “The value function of a mixed integer program: II,”Discrete Mathematics 25 (1979) 7–19.

    Google Scholar 

  3. C.E. Blair and R.G. Jeroslow, “The value function of an integer program,”Mathematical Programming 23 (3) (1982) 237–273.

    Google Scholar 

  4. C. Blair and R. Jeroslow, “Constructive characterizations of the value-function of a mixed-integer program I,”Discrete Applied Mathematics 9 (1984) 217–233.

    Google Scholar 

  5. V. Chvátal, “Edmonds polytopes and a hierarchy of combinatorial problems,”Discrete Mathematics 4 (1973) 305–337.

    Google Scholar 

  6. W. Cook, A. Gerards, A. Schrijver and É. Tardos, “Sensitivity theorems in integer linear programming,”Mathematical Programming 34 (1986) 251–264.

    Google Scholar 

  7. R. Jeroslow, “The principles of cutting-plane theory: Part I,” Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University (1974).

  8. R. Jeroslow, “Cutting-plane theory: algebraic methods,”Discrete Mathematics 23 (1978) 121–150.

    Google Scholar 

  9. R. Meyer, “On the existence of optimal solutions to integer and mixed-integer programming problems,”Mathematical Programming 7 (1974) 223–235.

    Google Scholar 

  10. A. Schrijver,Theory of Linear and Integer Programming (Wiley, New York, 1986).

    Google Scholar 

  11. J. Stoer and C. Witzgall.Convexity and Optimization in Finite Dimensions I (Springer, Berlin, 1970).

    Google Scholar 

  12. L. Wolsey, “Integer programming duality: price functions and sensitivity analysis,”Mathematical Programming 20 (1981) 173–195.

    Google Scholar 

  13. L. Wolsey, “The b-hull of an integer program,”Discrete Applied Mathematics 3 (1981) 193–201.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Business Administration Department, University of Illinois, 1206 South Sixth Street, Box 8, 61820, Champaign, IL, United States

    Charles Blair

Authors
  1. Charles Blair
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blair, C. A closed-form representation of mixed-integer program value functions. Mathematical Programming 71, 127–136 (1995). https://doi.org/10.1007/BF01585994

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation