%0 Journal Article %A Belkacem Brahmi and Mohand Ouamer Bibi %D 2009 %J International Journal of Mathematical and Computational Sciences %B World Academy of Science, Engineering and Technology %I Open Science Index 34, 2009 %T A Dual Method for Solving General Convex Quadratic Programs %U https://publications.waset.org/pdf/8966 %V 34 %X In this paper, we present a new method for solving quadratic programming problems, not strictly convex. Constraints of the problem are linear equalities and inequalities, with bounded variables. The suggested method combines the active-set strategies and support methods. The algorithm of the method and numerical experiments are presented, while comparing our approach with the active set method on randomly generated problems. %P 825 - 829