QUADRATIC PROGRAMMING POSSIBILITIES
Linear programming problems of search the extremum of the objective linear functional on the linear constraints are displayed on the optimal objective function search as extremum of a quadratic functional under the same constraints. In the last method the linear constraints number can be minimum. The constructed method of quadratic programming is solved by the method of Lagrange multipliers.