A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem

Lin-Peng Yang, Pei-Ping Shen and Yong-Gang Pei

Abstract and Applied Analysis, 2014, vol. 2014, 1-14

Abstract:

This paper presents a global optimization algorithm for solving globally the generalized nonlinear multiplicative programming (MP) with a nonconvex constraint set. The algorithm uses a branch and bound scheme based on an equivalently reverse convex programming problem. As a result, in the computation procedure the main work is solving a series of linear programs that do not grow in size from iterations to iterations. Further several key strategies are proposed to enhance solution production, and some of them can be used to solve a general reverse convex programming problem. Numerical results show that the computational efficiency is improved obviously by using these strategies.

Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2014/641909.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2014/641909.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaaa:641909

DOI: 10.1155/2014/641909

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().