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

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 t...

Full description

Bibliographic Details
Main Authors: Chun-Feng Wang, San-Yang Liu, Geng-Zhong Zheng
Format: Article
Language:English
Published: Hindawi Limited 2011-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2011/409491
id doaj-478a7d86bc424420a998a0ccc7088534
record_format Article
spelling doaj-478a7d86bc424420a998a0ccc70885342020-11-25T00:32:53ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472011-01-01201110.1155/2011/409491409491A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative ProgrammingChun-Feng Wang0San-Yang Liu1Geng-Zhong Zheng2Department of Mathematical Sciences, Xidian University, Xi'an 710071, ChinaDepartment of Mathematical Sciences, Xidian University, Xi'an 710071, ChinaSchool of Computer Science and Technology, Xidian University, Xi'an 710071, ChinaWe 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.http://dx.doi.org/10.1155/2011/409491
collection DOAJ
language English
format Article
sources DOAJ
author Chun-Feng Wang
San-Yang Liu
Geng-Zhong Zheng
spellingShingle Chun-Feng Wang
San-Yang Liu
Geng-Zhong Zheng
A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming
Mathematical Problems in Engineering
author_facet Chun-Feng Wang
San-Yang Liu
Geng-Zhong Zheng
author_sort Chun-Feng Wang
title A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming
title_short A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming
title_full A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming
title_fullStr A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming
title_full_unstemmed A Branch-and-Reduce Approach for Solving Generalized Linear Multiplicative Programming
title_sort branch-and-reduce approach for solving generalized linear multiplicative programming
publisher Hindawi Limited
series Mathematical Problems in Engineering
issn 1024-123X
1563-5147
publishDate 2011-01-01
description 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.
url http://dx.doi.org/10.1155/2011/409491
work_keys_str_mv AT chunfengwang abranchandreduceapproachforsolvinggeneralizedlinearmultiplicativeprogramming
AT sanyangliu abranchandreduceapproachforsolvinggeneralizedlinearmultiplicativeprogramming
AT gengzhongzheng abranchandreduceapproachforsolvinggeneralizedlinearmultiplicativeprogramming
AT chunfengwang branchandreduceapproachforsolvinggeneralizedlinearmultiplicativeprogramming
AT sanyangliu branchandreduceapproachforsolvinggeneralizedlinearmultiplicativeprogramming
AT gengzhongzheng branchandreduceapproachforsolvinggeneralizedlinearmultiplicativeprogramming
_version_ 1725318547378274304