IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v21y1974i1p87-97.html
   My bibliography  Save this article

A Primal Algorithm to Solve Network Flow Problems with Convex Costs

Author

Listed:
  • Andres Weintraub

    (University of California, Berkeley)

Abstract

The problem of determining continuous flows of minimum cost in a network with convex cost functions is considered. The approach used is that of finding, for any given feasible flow, circuit flows of negative incremental costs. In the main theoretical result of this paper, it is proved that if at each stage, given a feasible nonoptimal flow X, the circuit flow with most negative incremental cost is added to X, linear convergence to the optimal solution will be obtained. In addition, this most negative incremental cost determines an upper bound on the difference in cost between the given feasible solution and the optimal. Based on these concepts, an algorithm, which preserves linear convergence, is presented to determine minimum cost flows in networks with convex costs in the arcs. Results of computer runs made for this algorithm are given. The special case of networks with linear costs is also considered.

Suggested Citation

  • Andres Weintraub, 1974. "A Primal Algorithm to Solve Network Flow Problems with Convex Costs," Management Science, INFORMS, vol. 21(1), pages 87-97, September.
  • Handle: RePEc:inm:ormnsc:v:21:y:1974:i:1:p:87-97
    DOI: 10.1287/mnsc.21.1.87
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.21.1.87
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.21.1.87?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. Olsson, Leif & Lohmander, Peter, 2005. "Optimal forest transportation with respect to road investments," Forest Policy and Economics, Elsevier, vol. 7(3), pages 369-379, March.
    2. Maiko Shigeno & Satoru Iwata & S. Thomas McCormick, 2000. "Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 76-104, February.
    3. Kevin D. Wayne, 2002. "A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 445-459, August.
    4. Olsson, Leif, 2005. "Road investment scenarios in Northern Sweden," Forest Policy and Economics, Elsevier, vol. 7(4), pages 615-623, May.

    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:ormnsc:v:21:y:1974:i:1:p:87-97. 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.