Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points

A. Victor Cabot and Richard L. Francis
Additional contact information
A. Victor Cabot: Indiana University, Bloomington, Indiana
Richard L. Francis: The Ohio State University, Columbus, Ohio

Operations Research, 1970, vol. 18, issue 1, 82-86

Abstract: Certain types of quadratic programs with linear constraints have the property that an extreme point of the convex set of feasible solutions is an optimal solution. This paper presents a procedure for solving these problems, it involves determining a related linear program having the same constraints, the extreme-point-ranking approach of Murty is then applied to this linear program to obtain an optimum solution to the quadratic program.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.1.82 (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:oropre:v:18:y:1970:i:1:p:82-86

Access Statistics for this article

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