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

OR Practice—Large-Scale Nonlinear Network Models and Their Application

Author

Listed:
  • Ron S. Dembo

    (University of Toronto, Ontario, Canada)

  • John M. Mulvey

    (Princeton University, Princeton, New Jersey)

  • Stavros A. Zenios

    (University of Pennsylvania, Philadelphia, Pennsylvania)

Abstract

Nonlinear network applications arise in a variety of contexts: hydroelectric power system scheduling, financial planning, matrix estimation, air traffic control, and so on. This paper reviews applications of network optimization models with nonlinear objectives and, possibly, generalized arcs. Particular emphasis is placed on large-scale implementations. Specialized nonlinear network programming software is typically an order of magnitude faster than general purpose codes.

Suggested Citation

  • Ron S. Dembo & John M. Mulvey & Stavros A. Zenios, 1989. "OR Practice—Large-Scale Nonlinear Network Models and Their Application," Operations Research, INFORMS, vol. 37(3), pages 353-372, June.
    • Handle: RePEc:inm:oropre:v:37:y:1989:i:3:p:353-372
    DOI: 10.1287/opre.37.3.353
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.37.3.353
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.37.3.353?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. Spyros Kontogiorgis, 2000. "Practical Piecewise-Linear Approximation for Monotropic Optimization," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 324-340, November.
    2. F. Guerriero & P. Tseng, 2002. "Implementation and Test of Auction Methods for Solving Generalized Network Flow Problems with Separable Convex Cost," Journal of Optimization Theory and Applications, Springer, vol. 115(1), pages 113-144, October.
    3. Paul Tseng, 2001. "An (epsilon)-Out-of-Kilter Method for Monotropic Programming," Mathematics of Operations Research, INFORMS, vol. 26(2), pages 221-233, May.

    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:37:y:1989:i:3:p:353-372. 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.