IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v18y1970i2p253-262.html
   My bibliography  Save this article

Searching for the Multiplier in One-Constraint Optimization Problems

Author

Listed:
  • B. L. Fox

    (The Rand Corporation, Santa Monica, California)

  • D. M. Landi

    (The Rand Corporation, Santa Monica, California)

Abstract

One-constraint optimization problems are approached via Lagrange multipliers. Sequential search schemes for generating suitable trial multiplier values are compared, and it is shown that, in general, the minimax sequential search is bisection. For certain applications, it pays to design search procedures that take advantage of special structure, such as recursively defined functions. An efficient, one-pass search procedure based on bisection for a multi-item, multi-echelon inventory problem is also presented.

Suggested Citation

  • B. L. Fox & D. M. Landi, 1970. "Searching for the Multiplier in One-Constraint Optimization Problems," Operations Research, INFORMS, vol. 18(2), pages 253-262, April.
    • Handle: RePEc:inm:oropre:v:18:y:1970:i:2:p:253-262
    DOI: 10.1287/opre.18.2.253
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.18.2.253
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.18.2.253?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. Wang, Shuaian, 2016. "Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization," European Journal of Operational Research, Elsevier, vol. 250(1), pages 46-55.
    2. Formaneck, Steven D. & Cozzarin, Brian P., 2013. "Technology adoption and training practices as a constrained shortest path problem," Omega, Elsevier, vol. 41(2), pages 459-472.
    3. Ghaddar, Bissan & Sakr, Nizar & Asiedu, Yaw, 2016. "Spare parts stocking analysis using genetic programming," European Journal of Operational Research, Elsevier, vol. 252(1), pages 136-144.
    4. Nowicki, David R. & Randall, Wesley S. & Ramirez-Marquez, Jose Emmanuel, 2012. "Improving the computational efficiency of metric-based spares algorithms," European Journal of Operational Research, Elsevier, vol. 219(2), pages 324-334.
    5. D Nowicki & U D Kumar & H J Steudel & D Verma, 2008. "Spares provisioning under performance-based logistics contract: profit-centric approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 342-352, March.
    6. Sáez-Aguado, Jesús & Trandafir, Paula Camelia, 2012. "Some heuristic methods for solving p-median problems with a coverage constraint," European Journal of Operational Research, Elsevier, vol. 220(2), pages 320-327.

    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:inm:oropre:v:18:y:1970:i:2:p:253-262. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.