Mathematical Problems in Engineering
Volume 2011 (2011), Article ID 409491, 12 pages
Research Article

A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming

1Department of Mathematical Sciences, Xidian University, Xi'an 710071, China
2Department of Mathematics, Henan Normal University, Xinxiang 453007, China
3School of Computer Science and Technology, Xidian University, Xi'an 710071, China

Received 15 March 2011; Accepted 12 May 2011

Academic Editor: Victoria Vampa

Copyright © 2011 Chun-Feng Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We consider a branch-and-reduce approach for solving generalized linear multiplicative programming. First, a new lower approximate linearization method is proposed; then, by using this linearization method, the initial nonconvex problem is reduced to a sequence of linear programming problems. Some techniques at improving the overall performance of this algorithm are presented. The proposed algorithm is proved to be convergent, and some experiments are provided to show the feasibility and efficiency of this algorithm.