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

V. Balachandran and G. L. Thompson

Naval Research Logistics Quarterly, 1975, vol. 22, issue 1, 79-100

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.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800220108

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:22:y:1975:i:1:p:79-100

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().