A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming
Joint Authors
Zheng, Geng-Zhong
Wang, Chun-Feng
Liu, San-Yang
Source
Mathematical Problems in Engineering
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-12, 12 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-07-05
Country of Publication
Egypt
No. of Pages
12
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Wang, Chun-Feng& Liu, San-Yang& Zheng, Geng-Zhong. 2011. A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming. Mathematical Problems in Engineering،Vol. 2011, no. 2011, pp.1-12.
https://search.emarefa.net/detail/BIM-469887
Modern Language Association (MLA)
Wang, Chun-Feng…[et al.]. A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming. Mathematical Problems in Engineering No. 2011 (2011), pp.1-12.
https://search.emarefa.net/detail/BIM-469887
American Medical Association (AMA)
Wang, Chun-Feng& Liu, San-Yang& Zheng, Geng-Zhong. A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming. Mathematical Problems in Engineering. 2011. Vol. 2011, no. 2011, pp.1-12.
https://search.emarefa.net/detail/BIM-469887
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-469887
