Primal Decomposition of Mathematical Programs by Resource Allocation: II—Computational Algorithm with an Application to the Modular Design Problem

Gary J. Silverman
Additional contact information
Gary J. Silverman: IBM Scientific Center, Los Angeles, California

Operations Research, 1972, vol. 20, issue 1, 75-93

Abstract: Part I of this paper presented a method for primal decomposition of large convex separable programs into a sequence of smaller subproblems. In this part, additional theory and development of a parametric subproblem-solution and step-size-determination technique completes the algorithm. A previously unsolved problem in the operations-research literature, the generalized modular design problem of Evans [ Opns. Res. 18, 562–4 (1970)] is solved by the algorithm and numerical results provided.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.1.75 (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:oropre:v:20:y:1972:i:1:p:75-93

Access Statistics for this article

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