A lagrangean relaxation algorithm for the constrained matrix problem

Richard W. Cottle, Steven G. Duvall and Karel Zikan

Naval Research Logistics Quarterly, 1986, vol. 33, issue 1, 55-76

Abstract: We present variants of a convergent Lagrangean relaxation algorithm for minimizing a strictly convex separable quadratic function over a transportation polytope. The algorithm alternately solves two “subproblems,” each of which has an objective function that is defined by using Lagrange multipliers derived from the other. Motivated by the natural separation of the subproblems into independent and very easily solved “subsubproblems,” the algorithm can be interpreted as the cyclic coordinate ascent method applied to the dual problem. We exhibit our computational results for different implementations of the algorithm applied to a set of large constrained matrix problems.

Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (1)

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

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:33:y:1986:i:1:p:55-76

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 ().