The problem of maximizing a concave quadratic function over a linear constraint set is relatively difficult to solve.

Name: The problem of maximizing a concave quadratic function over a linear constraint set is relatively difficult to solve.
Brand: Quizplus
Rating: 4.7 (36 reviews)

Question

Quizplus · Accepted Answer

Maximizing a concave quadratic function over a linear constraint set is relatively easier to solve because it can be formulated as a convex optimization problem, for which efficient algorithms exist.

The Problem of Maximizing a Concave Quadratic Function Over a Linear