Skip to main content
SpringerLink
Log in

A procedure to rank bases by probability of being optimal using imbedded hyperspheres

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

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

References

  1. C.N. Beer, “Polyhedral subspaces and the selection of optimal bases in probabilistic linear programming”, Ph.D. Dissertation, University of Oklahoma, Norman, Okla. (1972), unpublished.

    Google Scholar 

  2. B. Bereanu, “Régions de décision et répartition de l'optimum dans la programmation linéaire”,Comptes Rendus Hebdomadaires des Séances de l'Académy des Sciences, 259 (1964) 1383–1386.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. USAF Academy, Colorado, USA

    C. N. Beer

  2. University of Oklahoma, Oklahoma, USA

    B. L. Foote

Authors
  1. C. N. Beer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. L. Foote
    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

Beer, C.N., Foote, B.L. A procedure to rank bases by probability of being optimal using imbedded hyperspheres. Mathematical Programming 9, 123–128 (1975). https://doi.org/10.1007/BF01681335

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation