On complexity of a global optimization problem

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.