Generalized Networks, Generalized Upper Bounding and Decomposition of the Convex Simplex Method
If the constraint matrix of a linear program has special structure it may be possible to speed computation. Techniques have been developed to take advantage of such special structures as generalized networks, generalized upper bounding, and decomposition. For these matrix structures, it is shown in this paper how to extend the techniques to Zangwill's mathematical programming algorithm, the convex simplex method.
Year of publication: |
1970
|
---|---|
Authors: | Rutenberg, David P. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 16.1970, 5, p. 388-401
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Rutenberg, David P., (1982)
-
The advantages of being multinational
Rutenberg, David P., (1972)
-
Rutenberg, David P., (1966)
- More ...