Skip to main content
SpringerLink
Log in

Optimal scaling of balls and polyhedra

  • Published:
Mathematical Programming Submit manuscript

Abstract

The concern is with solving as linear or convex quadratic programs special cases of the optimal containment and meet problems. The optimal containment or meet problem is that of finding the smallest scale of a set for which some translation contains a set or meets each element in a collection of sets, respectively. These sets are unions or intersections of cells where a cell is either a closed polyhedral convex set or a closed solid ball.

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. S.W. Director and G.D. Hachtel, “The simplicial approximation approach to design centering”,IEEE Transactions on Circuits and Systems 24 (1977) 363–372.

    Google Scholar 

  2. B.C. Eaves and R.M. Freund, “Inscribing and circumscribing convex polyhedra”, Technical Report (1979), Department of Operations Research, Stanford University.

  3. D.J. Elzinga and D.W. Hearn, “The minimum covering sphere problem”,Management Science 19 (1972) 96–140.

    Google Scholar 

  4. D. Gale, “Solution of spherical inequalities”, unpublished communication.

  5. L.G. Khachiyan, “A polynomial algorithm in linear programming”,Doklady Akademii Nauk SSSR 244(5) (1979) 1093–1096 [English translation,Soviet Mathematics Doklady 20(1) (1979) 191–194].

    Google Scholar 

  6. M.K. Kozlov, S.P. Tarasov and L.G. Khachiyan, “Polynomial solvability of convex quadratic programming”,Doklady Adademii Nauk SSSR 248(5) (1979) [English translation,Soviet Mathematics Doklady 20(5) (1979)].

  7. H.W. Kuhn, “Nonlinear programming: a historical view”,Nonlinear Programming—SIAM-AMS Proceedings IX (1976) 1–26.

    Google Scholar 

  8. T.H. Mattheiss and D.S. Rubin, “A survey and comparison of methods for finding all vertices of convex polyhedral sets”,Mathematics of Operations Research 5 (1980) 186–196.

    Google Scholar 

  9. R.P. van der Vet, “Flexible solutions to systems of linear inequalities”,European Journal of Operations Research 1 (1977) 247–254.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research, Stanford University, Stanford, CA, USA

    B. C. Eaves & R. M. Freund

Authors
  1. B. C. Eaves
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. M. Freund
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported in part by the Department of Energy Contract DE-AC03-76-SF00326, PA No. DE-AT-03-76ER72018; National Science Foundation Grants MCS79-03145 and SOC78-16811; and the Army Research Office—Durham, Contract DAAG-29-78-G-0026.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eaves, B.C., Freund, R.M. Optimal scaling of balls and polyhedra. Mathematical Programming 23, 138–147 (1982). https://doi.org/10.1007/BF01583784

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation