Problem Formulation
The quadratic programming problem can be formulated as:
Assume x belongs to space. Both x and c are column vectors with n elements (n×1 matrices), and Q is a symmetric n×n matrix.
Minimize (with respect to x)
Subject to one or more constraints of the form:
- (inequality constraint)
- (equality constraint)
where indicates the vector transpose of . The notation means that every entry of the vector is less than or equal to the corresponding entry of the vector .
If the matrix is positive semidefinite, then is a convex function: In this case the quadratic program has a global minimizer if there exists some feasible vector (satisfying the constraints) and if is bounded below on the feasible region. If the matrix is positive definite and the problem has a feasible solution, then the global minimizer is unique.
If is zero, then the problem becomes a linear program.
A related programming problem, quadratically constrained quadratic programming, can be posed by adding quadratic constraints on the variables.
Read more about this topic: Quadratic Programming
Famous quotes containing the words problem and/or formulation:
“Will women find themselves in the same position they have always been? Or do we see liberation as solving the conditions of women in our society?... If we continue to shy away from this problem we will not be able to solve it after independence. But if we can say that our first priority is the emancipation of women, we will become free as members of an oppressed community.”
—Ruth Mompati (b. 1925)
“Art is an experience, not the formulation of a problem.”
—Lindsay Anderson (b. 1923)