A decomposition procedure for convex quadratic programs

C. M. Shetty and Mohammed Ben Daya

Naval Research Logistics (NRL), 1988, vol. 35, issue 1, 111-118

Abstract: This article deals with the solution of convex quadratic programs by iteratively solving a master problem and a subproblem as proposed previously by Sacher. The approach has the advantage that the subproblems are linear programs so that advantage can be taken of existing schemes for solving large linear problems. At each step in solving the master problem, a closed‐form solution can be specified so that the procedure is well suited for solving large quadratic programs and can take advantage of the constraint structure.

Date: 1988
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198802)35:13.0.CO;2-#

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:navres:v:35:y:1988:i:1:p:111-118

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().