Date: 05 May 2010

General Quadratic Programming and Its Applications in Response Surface Analysis

* Final gross prices may vary according to local VAT.

Get Access


In this chapter, we consider the response surface problems that are formulated as the general quadratic programming. The general quadratic programming is split into convex quadratic maximization, convex quadratic minimization, and indefinite quadratic programming. Based on optimality conditions, we propose finite algorithms for solving those problems. As application, some real practical problems arising in the response surface, one of the main part of design of experiment, have been solved numerically by the algorithms.