An efficient algorithm for computing a class of multiplicative optimization problem. (3rd May 2016)

• Record Type: Journal Article
• Authors: Wang, Jun-Tao; Yin, Jing-Ben
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 19:Number 3(2016)
• Page Start: 691
• Page End: 706
• Publication Date: 2016-05-03
• Subjects: Multiplicative optimization problem -- Global optimization -- Efficient computational algorithm; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2016.1178926
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: This article provides a new algorithm for effectively solving a class of multiplicative optimization problem (MOP), which has broad applications in engineering system designs and systems analysis. By utilizing equivalent transformation technique and new linearization method, the initial multiplicative optimization problem (MOP) can be reduced to a relaxed linear programs problem. By subsequently partitioning the rectangle feasible region, the presented approach can be convergent to the global optimum point of the initial problem (MOP). At last, the numerical experimental results are reported to indicate the practicability and effectiveness of the presented approach in this article.