On Rutenberg's Decomposition Method

Wei Shen Hsia
Additional contact information
Wei Shen Hsia: University of Utah

Management Science, 1974, vol. 21, issue 1, 10-12

Abstract: David P. Rutenberg [Rutenberg, David P. 1970. Generalized networks, generalized upper bounding and decomposition of the convex simplex methods. Management Sci. 16 (5) 388-401.] provided a method to solve separable nonlinear objective functions with large-scale linear constraints by using W. I. Zangwill's Convex Simplex Method [Zangwill, W. L. 1967. The convex simplex method. Management Sci. 14 (3) 221-238.] However, there seem to be several errors in §4.3 [Rutenberg, David P. 1970. Generalized networks, generalized upper bounding and decomposition of the convex simplex methods. Management Sci. 16 (5) 397]. Two counterexamples to his conclusions are given in this paper. A revised definition of subproblem, therefore, an optimal criterion of the large-scaled program, is also given.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.1.10 (application/pdf)

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:inm:ormnsc:v:21:y:1974:i:1:p:10-12

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().