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

E. K. BlumW. Oettli2026-03-222026-03-22197210.1287/opre.20.1.165https://doi.org/10.1287/opre.20.1.165https://andeanlibrary.org/handle/123456789/48221Citaciones: 26A 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.enInfimum and supremumMathematicsDirect proofQuadratic equationSet (abstract data type)Function (biology)Finite setQuadratic functionDiscrete mathematicsCombinatoricsTechnical Note—Direct Proof of the Existence Theorem for Quadratic Programmingarticle