A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming. (5th July 2011)

• Record Type: Journal Article
• Authors: Wang, Chun-Feng; Liu, San-Yang; Zheng, Geng-Zhong
• Other Names: Vampa Victoria Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2011(2011)
• Publication Date: 2011-07-05
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2011/409491
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : 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.