IDEAS home Printed from https://ideas.repec.org/h/pal/intecp/978-1-349-08461-6_5.html
   My bibliography  Save this book chapter

Programming Involving Infinitely Many Variables and Constraints

In: Activity Analysis in the Theory of Growth and Planning

Author

Listed:
  • Leonid Hurwicz

    (University of Minnesota)

Abstract

In recent years economists have been increasingly interested in problems of optimization involving unknown functions and infinite numerical sequences.2 Among obvious examples are studies related to optimal growth (with time continuous or discrete) and programming under uncertainty, but many others could easily be found.

Suggested Citation

  • Leonid Hurwicz, 1967. "Programming Involving Infinitely Many Variables and Constraints," International Economic Association Series, in: E. Malinvaud & M. O. L. Bacharach (ed.), Activity Analysis in the Theory of Growth and Planning, chapter 0, pages 142-149, Palgrave Macmillan.
  • Handle: RePEc:pal:intecp:978-1-349-08461-6_5
    DOI: 10.1007/978-1-349-08461-6_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Spear, Stephen E. & Young, Warren, 2014. "Optimum Savings And Optimal Growth: The Cass–Malinvaud–Koopmans Nexus," Macroeconomic Dynamics, Cambridge University Press, vol. 18(1), pages 215-243, January.

    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:pal:intecp:978-1-349-08461-6_5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave.com .

    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.