Operations Research.
optimal point of a convex optimization is globally optimal. A linear program (LP) is a convex optimization with affine objective and constraint functions. A quadratic program (QP) is an optimization with a quadratic objective function and affine constraint functions. - A QP is convex iff the