QUADRATIC PROGRAMMING

Abstract

In this thesis I will introduce reviews application areas where quadratic programming has been effectively applied. Quadratic programming is a specialized area of mathematical optimization that focuses on problems where the objective function is quadratic and the constraints are linear. The primary goal of quadratic programming is to minimize or maximize a quadratic function subject to a set of linear constraints. Optimization is the process of maximization and minimization the objective function which satisfies the given constraints. There are two types of optimization problem linear and non-linear. Linear optimization problem has wide range of application, but all realistic problem cannot be modeled as linear -program, so here non-linear programming gains its importance. In the present I have tried to find solution of non-linear. Quadratic programming problem under different condition such as when constraints are equality and inequality sign. Solving quadratic programming problem by converting the quadratic problem in successive stages to linear programming. Generally quadratic programming (QP) is the process of solving certain mathematical optimization problem involving quadratic function.