Next Article in Journal
Chebyshev Collocation Method for Solving Linear Differential Equations
Previous Article in Journal
Thermodynamic Effects at Interaction between Laser Beam and Heavy - Viscous Liquids
Article Menu

Article Versions

Export Article

Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Articles in this Issue were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence. Articles are hosted by MDPI on mdpi.com as a courtesy and upon agreement with the previous journal publisher.
Open AccessArticle
Math. Comput. Appl. 2003, 8(1), 27-34; https://doi.org/10.3390/mca8010027

On Complexity of a Global Optimization Problem

Ege University, Department of Mathematics, 35100, Bornova-Izmir / TURKEY
Published: 1 April 2003
Download PDF [390 KB, uploaded 31 March 2016]

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.
Keywords: Global Optimization Problem; Gutting Angle Method; Dominant Subset with Minimal Weight Problem; NP-Complete Global Optimization Problem; Gutting Angle Method; Dominant Subset with Minimal Weight Problem; NP-Complete
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Nuriyev, U.G. On Complexity of a Global Optimization Problem. Math. Comput. Appl. 2003, 8, 27-34.

Show more citation formats Show less citations formats

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Math. Comput. Appl. EISSN 2297-8747 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top