quadratic programming -凯发k8网页登录

quadratic programming (qp) is minimizing or maximizing an objective function subject to bounds, linear equality, and inequality constraints. example problems include portfolio optimization in finance, power generation optimization for electrical utilities, and design optimization in engineering.

quadratic programming is the mathematical problem of finding a vector x that minimizes a quadratic function:

\[\min_{x} \left\{\frac{1}{2}x^{\mathsf{t}}hx f^{\mathsf{t}}x\right\}\]

subject to the constraints:

\[\begin{eqnarray}ax \leq b & \quad & \text{(inequality constraint)} \\a_{eq}x = b_{eq} & \quad & \text{(equality constraint)} \\lb \leq x \leq ub & \quad & \text{(bound constraint)}\end{eqnarray}\]

you can use matlab^® to implement the following commonly used algorithms to solve quadratic programming problems:

• interior-point-convex: solves convex problems with any combination of constraints
• trust-region-reflective: solves bound constrained or linear equality constrained problems
• active-set: solves small to medium-sized convex problems with any combination of constraints

for more information about quadratic programming, see optimization toolbox™.