On Quadratic Programming
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.
Volume (Year): 17 (1971)
Issue (Month): 11 (July)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:17:y:1971:i:11:p:698-711. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.