Based on an active set strategy a method for solving lin-early constrained indefinite quadratic programs to solve the correspond-ing system of equations at each iteration is presented. The algorithm takes two descent directions to strictly decrease the value of objective function and obtains a suitable step to maintain feasibility. Computa-tional results on a range of quadratic test problems are given.