On Quadratic Programming

B. Curtis Eaves
Additional contact information
B. Curtis Eaves: University of California, Berkeley

Management Science, 1971, vol. 17, issue 11, 698-711

Abstract: A procedure based on Lemke's algorithm is developed which either computes stationary points for general quadratic programs or else shows that the program has no optimum. If a general quadratic program has an optimum and satisfies a non-degeneracy condition then it is demonstrated that there are an odd number of stationary points.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (46)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.17.11.698 (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:17:y:1971:i:11:p:698-711

Access Statistics for this article

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