Skip to main content

A bound on the roof-duality gap

Seminars

Part of the Lecture Notes in Mathematics book series (LNMCIME,volume 1403)

Abstract

Zero-one maximization of a quadratic function f(x) is NP-hard. In [4] several equivalent polynomially solvable relaxations are described whose common optimal value, w, yields an upper bound of f*, the zero-one maximum of f(x). One of these relaxations is the maximization of a piecewise linear concave function, R(x), over the full unit hypercube. Using this relaxation we obtain a bound on (w−f*). In the special case where the off-diagonal elements of the Hessian matrix are nonnegative, we show that R(x) coincides with the concave envelope.

Keywords

  • Quadratic Zero-One
  • Roof duality
  • Concave envelope

The partial support of NSF Grant No. ECS85-03212 and AFOSR Grant No. 0271 is gratefully acknowledged.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.L. Balinski, "Integer Programming: Methods, uses, computation", in: G.B. Dantzig and A.F. Veinott, Jr., eds., Mathematics of the Decision Sciences, Part I (American Mathematical Society, Providence 1968), 38–64.

    Google Scholar 

  2. M.R. Garey, D.S. Johnson and L. Stockmeyer, "Some simplified NP-complete graph problems", Theoretical Computer Science 1 (1976), 237–267.

    CrossRef  Google Scholar 

  3. J.E. Falk, and K.L Hoffman, "A successive underestimation method for concave minimization problems", Mathematics of Operations Research 1 (1976), 251–259.

    CrossRef  Google Scholar 

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

    CrossRef  Google Scholar 

  5. J. Rhys, "A selection problem of shared fixed costs and networks", Managements Science 17 (1970), 200–207.

    CrossRef  Google Scholar 

  6. R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton 1970).

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1989 Springer-Verlag

About this paper

Cite this paper

Hammer, P.L., Kalantari, B. (1989). A bound on the roof-duality gap. In: Simeone, B. (eds) Combinatorial Optimization. Lecture Notes in Mathematics, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083469

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51797-9

  • Online ISBN: 978-3-540-46810-3

  • eBook Packages: Springer Book Archive