Search

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.cor.2008.11.002 Byline: Yongqiang Chen (a), Hongwei Jiao (b) Abstract: This article presents a finite branch-and-bound algorithm for globally solving general linear multiplicative programming problems (GLMP). The proposed algorithm is based on the recently developed theory of monotonic optimization. The proposed algorithm provides a nonisolated global optimal solution, and it turns out that such an optimal solution is adequately guaranteed to be feasible and to be close to the actual optimal solution. It can be shown by the numerical results that the proposed algorithm is effective and the computational results can be gained in short time. Author Affiliation: (a) College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, PR China (b) Department of Mathematics, Henan Institute of Science and Technology, Xinxiang 453003, PR China Article Note: (footnote) [star] Research supported by the National Natural Science Foundation of China under Grant 10671057.