IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v21y1974i4p715-718.html
   My bibliography  Save this article

The minimum sphere covering a convex polyhedron

Author

Listed:
  • Jack Elzinga
  • Donald Hearn

Abstract

A finite algorithm is given for finding the smallest sphere enclosing a convex polyhedron in En described by a given system of linear equalities or inequalities. Extreme points of the polyhedron, and minimum spheres enclosing them, are generated in a systematic manner until the optimum is attained.

Suggested Citation

  • Jack Elzinga & Donald Hearn, 1974. "The minimum sphere covering a convex polyhedron," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 21(4), pages 715-718, December.
    • Handle: RePEc:wly:navlog:v:21:y:1974:i:4:p:715-718
    DOI: 10.1002/nav.3800210414
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800210414
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800210414?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jianzhe Zhen & Frans J. C. T. de Ruiter & Ernst Roos & Dick den Hertog, 2022. "Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 196-210, January.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navlog:v:21:y:1974:i:4:p:715-718. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.