Abstract: By using approximation concepts, the objective function and constraint functions have been approximated by second and first order Taylor series expansions, respectively. A sequence of quadratic programming problems is thus obtained and than solved by quasi-analytical method based on the dual theory of nonlinear programming. Several typical problems have been tested. The results have shown satisfactory convergence and computational efficiency.