A Method of Solution for Quadratic Programs

C. E. Lemke
Additional contact information
C. E. Lemke: Rensselaer Polytechnic Institute, Troy, New York

Management Science, 1962, vol. 8, issue 4, 442-453

Abstract: This paper describes a method of minimizing a strictly convex quadratic functional of several variables constrained by a system of linear inequalities. The method takes advantage of strict convexity by first computing the absolute minimum of the functional. In the event that the values of the variables yielding the absolute minimum do not satisfy the constraints, an equivalent and simplified quadratic problem in the "Lagrange multipliers" is derived. An efficient algorithm is devised for the transformed problem, which leads to the solution in a finite number of applications. A numerical example illustrates the method.

Date: 1962
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.8.4.442 (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:8:y:1962:i:4:p:442-453

Access Statistics for this article

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