DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click HERE
to register or log in.
A Decomposition Procedure for Convex Quadratic Programs,
GEORGIA INST OF TECH ATLANTA PRODUCTION AND DISTRIBUTION RESEARCH CENTER
Pagination or Media Count:
This paper 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 existing schemes for solving large problems can be taken advantage of. This paper gives a closed form solution to the master problem so that the procedure is well suited for solving large quadratic programs and can take advantage of the constraint structure. Author.
APPROVED FOR PUBLIC RELEASE