IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v22y1975i1p79-100.html
   My bibliography  Save this article

An operator theory of parametric programming for the generalized transportation problem: I. Basic theory

Author

Listed:
  • V. Balachandran
  • G. L. Thompson

Abstract

This paper gives a new organization of the theoretical results of the Generalized Transportation Problem with capacity constraints. A graph‐theoretic approach is utilized to define the basis as a one‐forest consisting of one‐trees (a tree with an extra edge). Algorithmic development of the pivot‐step is presented by the representation of a two‐tree (a tree with two extra edges). Constructive procedures and proofs leading to an efficient computer code are provided. The basic definition of an operator theory which leads to the discussion of various operators is also given. In later papers we will present additional results on the operator theory for the generalized transportation problem based on the results in the present paper.

Suggested Citation

  • V. Balachandran & G. L. Thompson, 1975. "An operator theory of parametric programming for the generalized transportation problem: I. Basic theory," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 22(1), pages 79-100, March.
    • Handle: RePEc:wly:navlog:v:22:y:1975:i:1:p:79-100
    DOI: 10.1002/nav.3800220108
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800220108
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800220108?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
    ---><---

    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:wly:navlog:v:22:y:1975:i:1:p:79-100. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.