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

Simple item page
dc.contributor.authorE. K. Blum
dc.contributor.authorW. Oettli
dc.coverage.spatialBolivia
dc.date.accessioned2026-03-22T14:43:56Z
dc.date.available2026-03-22T14:43:56Z
dc.date.issued1972
dc.descriptionCitaciones: 26
dc.description.abstractA 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.
dc.identifier.doi10.1287/opre.20.1.165
dc.identifier.urihttps://doi.org/10.1287/opre.20.1.165
dc.identifier.urihttps://andeanlibrary.org/handle/123456789/48221
dc.language.isoen
dc.publisherInstitute for Operations Research and the Management Sciences
dc.relation.ispartofOperations Research
dc.sourceHigher University of San Andrés
dc.subjectInfimum and supremum
dc.subjectMathematics
dc.subjectDirect proof
dc.subjectQuadratic equation
dc.subjectSet (abstract data type)
dc.subjectFunction (biology)
dc.subjectFinite set
dc.subjectQuadratic function
dc.subjectDiscrete mathematics
dc.subjectCombinatorics
dc.titleTechnical Note—Direct Proof of the Existence Theorem for Quadratic Programming
dc.typearticle

Files

Collections

Artículo Científico Publicado