Journal of Applied Sciences 1812-5654 1812-5662 Asian Network for Scientific Information 10.3923/jas.2010.1627.1631 Chikhaoui A. Djebbar B. Mekki R. 12 2010 10 15 The aim of this study is to present a new method for finding an optimal solution to quadratic programming problems. The principle of the method is based on calculating the value of critical point. If the critical point belongs to the set of feasible solutions, so the optimal solution to our problem is the critical point itself. If the critical point is not at in the feasible solution set, a new feasible constraint set is built by a homographic transform, in such a way that the projection of the critical point of the objective function onto this set produces the exact solution to the problem on hand. It should be noted here that the objective function may be convex or not convex. On the other hand the search for the optimal solution is to find the hyper plane separating the convex and the critical point. Notice that one does not need to transform the quadratic problem into an equivalent linear one as in the numerical methods; the method is purely analytical and avoids the usage of initial solution. An algorithm computing the optimal solution of the concave function has given.

]]>
Achmanov, S., 1984 Programmation Lineaire Traduction Francaise. Bierlaire, M., 2006 Introduction a l'Optimisation Differentiable. De Werra, D., T.M. Liebling and J.F. Heche, 2003 Recherche Operationnelle Pour Ingenieur I. De Klerk, E. and D.V. Pasechnik, 2007 J. Global Optim., 37 75 84 Delbos, F. and J.C. Gilbert, 2005 J. Convex Anal., 12 45 69 Hillier, F.S. and G.J. Lieberman, 2005 Introduction to Operations Research. 8th Edn., pp: 547-602 pp: 547-602 Dozzi, M., 2004 Methodes nonlineaires et stochastiques de la recherche operationnelle. 2004 Simonnard, M., 1973 Programmation Lineaire: Techniques du Calcul Economique. 2nd Edn., Vol. 40, pp: 32-45 pp: 32-45 Dong, S., 2006 Methods for Constrained Optimization.