Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming

E. Blum and W. Oettli
Additional contact information
E. Blum: Universidad Mayor de San Andrés, La Paz, Bolivia
W. Oettli: IBM Zurich Research Laboratory, 8803 Rüschlikon, Switzerland

Operations Research, 1972, vol. 20, issue 1, 165-167

Abstract: A direct analytical proof is given for the following theorem: If the infimum of a quadratic function on a nonempty (possibly unbounded) polyhedral set R ⊆ ℛ n is finite, then the infimum is assumed somewhere on R , thus being a minimum.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.20.1.165 (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:20:y:1972:i:1:p:165-167

Access Statistics for this article

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