Quadratic programming (QP) is the
problem of optimizing a quadratic
objective function and is one of the
simplests form of non-linear
programming. The objective function
can contain bilinear or up to second
order polynomial terms, and the
constraints are linear and can be both
equalities and inequalities. QP is
widely...