This final project discusses the quadratic programming problem of linear con- straints and solves it using the Kuhn-Tucker condition method. This method starts by changing the inequality constraint into an equation using the additio- nal function of the Lagrange multiplier. The multiplier is used to convert the extreme point of a constraint function into a point. Each Lagrange multiplier must s…