On Complexity of a Global Optimization Problem
Ege University, Department of Mathematics, 35100, Bornova-Izmir / TURKEY
Math. Comput. Appl. 2003, 8(1), 27-34; https://doi.org/10.3390/mca8010027
Published: 1 April 2003
Abstract
The Solution of the Subproblem of the Cutting Angle Method of Global Optimization for problems of minimizing increasing Positively Homogeneous of degree one functions is proved to be NP-Complete. For the proof of this fact we formulate another problem which we call "Dominating Subset with Minimal Weight". The solution of this problem is also NP-Complete.
Share and Cite
MDPI and ACS Style
Nuriyev, U.G. On Complexity of a Global Optimization Problem. Math. Comput. Appl. 2003, 8, 27-34. https://doi.org/10.3390/mca8010027
AMA Style
Nuriyev UG. On Complexity of a Global Optimization Problem. Mathematical and Computational Applications. 2003; 8(1):27-34. https://doi.org/10.3390/mca8010027
Chicago/Turabian StyleNuriyev, Urfat G. 2003. "On Complexity of a Global Optimization Problem" Mathematical and Computational Applications 8, no. 1: 27-34. https://doi.org/10.3390/mca8010027
