Skip to main content
SpringerLink
Log in

A note on polyhedral sets having A least element

  • 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. R.W. Cottle and A.F. Veinott, Jr., “Polyhedral sets having a least element”,Mathematical Programming 3 (1972) 238–249.

    Google Scholar 

  2. H. Gabbay, “Some issues in hierarchical planning”, Tech. Rept. No. 112, Operations Research Center, M.I.T. (June, 1975).

  3. H. Gabbay, “A hierarchical approach to production planning”, Tech. Rept. No. 120, Operations Research Center, M.I.T. (December, 1975).

Download references

Author information

Author notes

  1. Henry Gabbay

    Present address: Operating Group of the First National City Bank of New York, USA

Authors and Affiliations

  1. Massachusetts Institute of Technology, Cambridge, Mass., USA

    Henry Gabbay

Authors
  1. Henry Gabbay
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by ONR Contract Number N00014-75-C-0556.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gabbay, H. A note on polyhedral sets having A least element. Mathematical Programming 11, 94–96 (1976). https://doi.org/10.1007/BF01580374

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation