Skip to main content
SpringerLink
Log in

Roof duality for polynomial 0–1 optimization

  • Published:
Mathematical Programming Submit manuscript

Abstract

The purpose of this note is to generalize the roof duality theory of Hammer, Hansen and Simeone to the case of polynomial 0–1 optimization (0-1PP). By reformulating 0-1PP and expanding some of their definitions, we show that most of the results for quadratic 0–1 problem (0-1QP) can be extended to the general polynomial case.

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. Egon Balas and Joseph B. Mazzola, “Nonlinear 0–1 programming: I. Linearization techniques,”Mathematical Programming 30 (1984) 1–22.

    MATH  MathSciNet  Google Scholar 

  2. Egon Balas and Joseph B. Mazzola, “Nonlinear 0–1 programming: II. Dominance relations and algorithms,”Mathematical Programming 30 (1984) 22–45.

    MATH  MathSciNet  Google Scholar 

  3. George B. Dantzig and Richard M. Van Slyke, “Generalized upper bounding techniques,”Journal of Computer and Systems Sciences 1 (1967) 213–226.

    MATH  Google Scholar 

  4. J. Elam, F. Glover and D. Klingman, “A strongly convergent primal-simplex algorithm for generalized networks,”Mathematics of Operations Research 4 (1979) 39–59.

    MATH  MathSciNet  Google Scholar 

  5. P.L. Hammer, P. Hansen and B. Simeone, “Roof duality, complementation and persistency in quadratic 0–1 optimization,”Mathematical Programming 28 (1984) 121–155.

    MATH  MathSciNet  Google Scholar 

  6. P.L. Hammer, P. Hansen and B. Simeone, “Upper planes of quadratic 0–1 functions and stability in graphs,”Nonlinear Programming 4 (1981) 395–414.

    MathSciNet  Google Scholar 

  7. P.A. Jensen and J.W. Barnes,Network Flow Programming (Wiley, New York, 1980).

    MATH  Google Scholar 

  8. S.H. Lu and A.C. Williams, “Roof duality for nonlinear 0–1 optimization,” Tech. Rept., RUTCOR Research Report #2-85, RUTCOR, Hill Center, Rutgers University, New Brunswick, NJ 08903 (August, 1985).

    Google Scholar 

  9. J. Rhys, “A selection problem of shared fixed costs and network flows,”Management Science 17 (1970) 200–207.

    Article  MATH  Google Scholar 

  10. A.C. Williams, “Quadratic 0–1 programming using the roof dual (with Computational Results),” Tech. Rept., RUTCOR Research Report #8-85, RUTCOR, Hill Center, Rutgers University, New Brunswick, NJ, 08903 (December, 1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RUTCOR, Rutgers University, 08903, New Brunswick, NJ, USA

    S. H. Lu & A. C. Williams

Authors
  1. S. H. Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. C. Williams
    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

Lu, S.H., Williams, A.C. Roof duality for polynomial 0–1 optimization. Mathematical Programming 37, 357–360 (1987). https://doi.org/10.1007/BF02591742

Download citation

  • Received:

  • Issue Date:

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

Key words

Search

Navigation