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

Proportional Equity Flow Problem for Terminal Arcs

Author

Listed:
  • Lisa M. Betts

    (Kent State University, Kent, OH)

  • J. Randall Brown

    (Kent State University, Kent, OH)

Abstract

The proportional equity flow problem extends a class of problems referred to as equity flow problems whose objective is to equitably distribute flow among the arcs in a flow circulation network. The proportionally bounded flow circulation problem places lower and upper bounds on each arc flow that are nondecreasing continuous functions of the flow through one special arc, and the objective is to maximize the flow through the special arc. The proportional equity flow problem for terminal arcs (Problem TA) is then defined as a special case where all the proportional arcs enter a sink vertex. Applications of both the general problem and Problem TA are given. Two optimality conditions for Problem TA are developed, as well as an algorithm that is polynomially bounded for many types of nondecreasing, continuous, proportional bounding functions. Specifically, the algorithm is shown to be polynomially bounded if the largest root of an equation can be found in polynomial time.

Suggested Citation

  • Lisa M. Betts & J. Randall Brown, 1997. "Proportional Equity Flow Problem for Terminal Arcs," Operations Research, INFORMS, vol. 45(4), pages 521-535, August.
    • Handle: RePEc:inm:oropre:v:45:y:1997:i:4:p:521-535
    DOI: 10.1287/opre.45.4.521
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.45.4.521
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.45.4.521?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. Hervé Moulin & Jay Sethuraman, 2013. "The Bipartite Rationing Problem," Operations Research, INFORMS, vol. 61(5), pages 1087-1100, October.
    2. Hanan Luss, 1999. "On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach," Operations Research, INFORMS, vol. 47(3), pages 361-378, June.

    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:45:y:1997:i:4:p:521-535. 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.