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.
Downloads
Download data is not yet available.
Downloads
Published
1997-12-01
Issue
Section
Articles
How to Cite
GLOBAL SOLUTION FOR NONCONVEX QUADRATIC PROGRAMMING . (1997). Sindh University Research Journal - SURJ (Science Series), 29(2). https://sujo.usindh.edu.pk/index.php/SURJ/article/view/7469


