✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
The solution of this problem is also NP-Complete.
📌 3 Key Takeaways
🎯
Objective & Hypothesis: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.
📊
Key Findings & Data:For the proof of this fact we formulate another problem which we call "Dominating Subset with Minimal Weight".
💡
Conclusion & Impact:The solution of this problem is also NP-Complete.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters
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.
🔖
Cite This Article
NURİYEV, U. G. (2003). On complexity of a global optimization problem. Mathematical and Computational Applications, Cilt: 8 - Sayı: 1, 27–34. https://ajindex.com/articles/280354