Journal of Applied Sciences1812-56541812-5662orgz10.3923/jas.2011.3807.3810AhmadianAliAfsharinafarReza1220111123In this study, we propose an approximate solution for nonconvex Quadratic Programming Problem (QPP) in general form using the eigenvalues of the Hessian matrix. Here we don't consider any special conditions (such as positive definiteness or positive semi definiteness) for the Hessian matrix of the objective function. Using the eigenvalues of the hessian matrix and solving two optimization problems, we propose an interval containing the optimal solution of QPP. This method can be useful for complicated and large scale optimization problems and also for integer quadratic programming problems.]]>Bazaraa, M.S., H.D. Sherali and C.M. Shetty,1993Fiedler, M., J. Nedoma, J. Ramik, J. Rohn and K. Zimmermann,2006Murty, K.G. and S.N. Kabadi,1987Pardalos, P.M. and J.B. Rosen,1987Petersen, J.A.M. and M. Bodson,2006Schwarz, H.G.,2006Wang, D.Q., S. Chukova and C.D. Lai,2005Zhu, Z. and K. Zhang,2004