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

A theorem in convex programming

Author

Listed:
  • William Karush

Abstract

An optimization problem which frequently arises in applications of mathematical programming is the following: Where fi are convex functions. In this paper, the function F is studied and shown to satisfy F(A, B) = M (A) + N(B), where M and N are increasing and decreasing convex functions, respectively. Also, the functional equation F (A, C) = F(A, B) + F(B, C) − F(B, B) is established. These results generalize to the continuous case F(A, B)=min ∫ OT f(t, x(t))dt, with x(t) increasing and A ≤ x (0) ≤ x (T) ≤ B. The results obtained in this paper are useful for reducing an optimization problem with many variables to one with fewer variables.

Suggested Citation

  • William Karush, 1959. "A theorem in convex programming," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 6(3), pages 245-260, September.
    • Handle: RePEc:wly:navlog:v:6:y:1959:i:3:p:245-260
    DOI: 10.1002/nav.3800060306
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800060306
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800060306?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. Tong Wang & Xiting Gong & Sean X. Zhou, 2017. "Dynamic Inventory Management with Total Minimum Order Commitments and Two Supply Options," Operations Research, INFORMS, vol. 65(5), pages 1285-1302, October.
    2. Rossi, Roberto & Chen, Zhen & Tarim, S. Armagan, 2024. "On the stochastic inventory problem under order capacity constraints," European Journal of Operational Research, Elsevier, vol. 312(2), pages 541-555.

    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:6:y:1959:i:3:p:245-260. 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.