The Dual Method for the Generalized Transportation Problem
In this paper the dual method and the poly-\omega technique are specialized for the generalized transportation problem. A simple procedure is obtained for solving the parametric version of this problem, i.e. for passing from a solution optimal for given values of the parameters, to solutions optimal for other values of the parameters. This procedure is then extended to the case when not only the parameters change, but additional constraints appear. Finally, the procedure may be used as a general method for solving the usual (nonparametric) generalized transportation problem, and for this case a way is described for finding an initial (dual-feasible) solution.
Year of publication: |
1966
|
---|---|
Authors: | Balas, Egon |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 12.1966, 7, p. 555-568
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
The perfectly matchable subgraph polytope of an arbitrary graph
Balas, Egon, (1987)
-
The perfectly matchable subgraph polytope of a bipartite graph
Balas, Egon, (1981)
-
Job shop scheduling with setup times, deadlines and precedence constraints
Balas, Egon, (2008)
- More ...