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

SUMT (Revisited)

Author

Listed:
  • Stephen G. Nash

    (George Mason University, Fairfax, Virginia)

Abstract

Fiacco and McCormick's 1968 book is a classic. It arose out of the authors' activities at the Research Analysis Corporation, and as such it is the record of an ambitious and productive collaboration. But it is more than that. The topics they studied and the situations they encountered are representative of the experiences of other researchers in the 1960s. At a deeper level, Fiacco and McCormick's book illustrates the influence of two great traditions of research: one based on linear programming, and the other based on the calculus of variations. The work of Fiacco and McCormick remains influential, as do the influences of these two traditions. An understanding of these influences illuminates not only the history of nonlinear programming, but also its present and future.

Suggested Citation

  • Stephen G. Nash, 1998. "SUMT (Revisited)," Operations Research, INFORMS, vol. 46(6), pages 763-775, December.
    • Handle: RePEc:inm:oropre:v:46:y:1998:i:6:p:763-775
    DOI: 10.1287/opre.46.6.763
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.46.6.763
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.46.6.763?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
    ---><---

    References listed on IDEAS

    as
    1. Charles W. Carroll, 1961. "The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems," Operations Research, INFORMS, vol. 9(2), pages 169-184, April.
    2. Anthony V. Fiacco & Garth P. McCormick, 1964. "Computational Algorithm for the Sequential Unconstrained Minimization Technique for Nonlinear Programming," Management Science, INFORMS, vol. 10(4), pages 601-617, July.
    3. Stephen G. Nash & Ariela Sofer, 1993. "A Barrier Method for Large-Scale Constrained Optimization," INFORMS Journal on Computing, INFORMS, vol. 5(1), pages 40-53, February.
    4. Anthony V. Fiacco & Garth P. McCormick, 1966. "Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation," Management Science, INFORMS, vol. 12(11), pages 816-828, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Coelho, B. & Andrade-Campos, A., 2014. "Efficiency achievement in water supply systems—A review," Renewable and Sustainable Energy Reviews, Elsevier, vol. 30(C), pages 59-84.
    2. J. Frédéric Bonnans & Mounir Haddou, 2000. "Asymptotic Analysis of Congested Communication Networks," Mathematics of Operations Research, INFORMS, vol. 25(3), pages 409-426, August.
    3. Benjamin Lev, 2006. "Book Reviews," Interfaces, INFORMS, vol. 36(6), pages 608-615, December.
    4. Lai, Xiangjing & Hao, Jin-Kao & Yue, Dong & Lü, Zhipeng & Fu, Zhang-Hua, 2022. "Iterated dynamic thresholding search for packing equal circles into a circular container," European Journal of Operational Research, Elsevier, vol. 299(1), pages 137-153.
    5. Yo-Hwan Kim & Myoungwoo Lee & In-Ju Hwang & Youn-Jea Kim, 2019. "Noise Reduction of an Extinguishing Nozzle Using the Response Surface Method," Energies, MDPI, vol. 12(22), pages 1-13, November.
    6. M. Fernanda P. Costa & Rogério B. Francisco & Ana Maria A. C. Rocha & Edite M. G. P. Fernandes, 2017. "Theoretical and Practical Convergence of a Self-Adaptive Penalty Algorithm for Constrained Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 174(3), pages 875-893, September.
    7. Xiangjing Lai & Jin-Kao Hao & Renbin Xiao & Fred Glover, 2023. "Perturbation-Based Thresholding Search for Packing Equal Circles and Spheres," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 725-746, July.
    8. Choi, Byung-Cheon & Park, Myoung-Ju, 2015. "A continuous time–cost tradeoff problem with multiple milestones and completely ordered jobs," European Journal of Operational Research, Elsevier, vol. 244(3), pages 748-752.

    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:46:y:1998:i:6:p:763-775. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.