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

Technical Note—A Class of Linear Programs Convertible to Network Problems

Author

Listed:
  • William H. Cunningham

    (Universitat Bonn, Bonn, West Germany)

Abstract

We consider a class of two-commodity network flow problems with additional, highly structured linear constraints in place of the usual capacity constraints. This class of linear programs arose as subproblems in a mixed integer programming formulation of a location model, and was solved by Ramakrishnan using a special purpose primal simplex algorithm. We show that, even though the constraint matrices of these problems are not transformable to constraint matrices of pure network problems, the problems themselves can be converted to pure network problems. The transformation depends on the existence of a set of variables whose non-negativity restrictions are redundant to the definition of the feasible region. We point out other situations in which such structure occurs.

Suggested Citation

  • William H. Cunningham, 1983. "Technical Note—A Class of Linear Programs Convertible to Network Problems," Operations Research, INFORMS, vol. 31(2), pages 387-391, April.
    • Handle: RePEc:inm:oropre:v:31:y:1983:i:2:p:387-391
    DOI: 10.1287/opre.31.2.387
    as

    Download full text from publisher

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

    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:31:y:1983:i:2:p:387-391. 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.