GLOBAL SOLUTION FOR NONCONVEX QUADRATIC PROGRAMMING

Abstract

This paper concerns with an exact penalty function method to convert constrained optimization problem into a single unconstrained optimization problem. The use of the interval analysis method was employed to find the global solution in nonconvex quadratic program- ming. Key words Unconstrained optimization; Exact penalty functions; Nonconvex quadratic programming.