An Accelerating Algorithm for Linear Multiplicative Programming Problem
By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for globally solving the problem (LMP). Firstly, a linear relaxed programming problem is constructed, which...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9225012/ |
| _version_ | 1819132792337858560 |
|---|---|
| author | Shuai Tang Zhisong Hou Longquan Yong |
| author_facet | Shuai Tang Zhisong Hou Longquan Yong |
| author_sort | Shuai Tang |
| collection | DOAJ |
| description | By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for globally solving the problem (LMP). Firstly, a linear relaxed programming problem is constructed, which can be used to compute the lower bound of the global optimal value of the problem (EP). Then, by subsequently subdividing the initial outcome space rectangle, and by solving a series of linear relaxed programming problems, the global optimal solution of the problem (LMP) can be obtained. It's worth mentioning that a new region reducing method and a new linear relaxed programming with a higher degree of tightness are also constructed to improve the computational efficiency in the presented algorithm. The global convergence of the presented algorithm is established, and its computational complexity is estimated. Finally, the numerical tests indicate that the presented algorithm has the higher computational efficiency than the known algorithms. |
| first_indexed | 2024-12-22T09:37:02Z |
| format | Article |
| id | doaj.art-c82f5af54b78486fabf064f16becb3a8 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-22T09:37:02Z |
| publishDate | 2020-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-c82f5af54b78486fabf064f16becb3a82022-12-21T18:30:48ZengIEEEIEEE Access2169-35362020-01-01818878418879610.1109/ACCESS.2020.30313549225012An Accelerating Algorithm for Linear Multiplicative Programming ProblemShuai Tang0https://orcid.org/0000-0003-1800-6016Zhisong Hou1Longquan Yong2Basic Department, Jiyuan Vocational and Technical College, Jiyuan, ChinaSchool of Information Engineering, Henan Institute of Science and Technology, Xinxiang, ChinaShaanxi Key Laboratory of Industrial Automation, Shaanxi University of Technology, Hanzhong, ChinaBy reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for globally solving the problem (LMP). Firstly, a linear relaxed programming problem is constructed, which can be used to compute the lower bound of the global optimal value of the problem (EP). Then, by subsequently subdividing the initial outcome space rectangle, and by solving a series of linear relaxed programming problems, the global optimal solution of the problem (LMP) can be obtained. It's worth mentioning that a new region reducing method and a new linear relaxed programming with a higher degree of tightness are also constructed to improve the computational efficiency in the presented algorithm. The global convergence of the presented algorithm is established, and its computational complexity is estimated. Finally, the numerical tests indicate that the presented algorithm has the higher computational efficiency than the known algorithms.https://ieeexplore.ieee.org/document/9225012/Linear multiplicative programmingregion reducing methodimproving compactness techniquelinear relaxed programmingbranch-and-bound algorithm |
| spellingShingle | Shuai Tang Zhisong Hou Longquan Yong An Accelerating Algorithm for Linear Multiplicative Programming Problem IEEE Access Linear multiplicative programming region reducing method improving compactness technique linear relaxed programming branch-and-bound algorithm |
| title | An Accelerating Algorithm for Linear Multiplicative Programming Problem |
| title_full | An Accelerating Algorithm for Linear Multiplicative Programming Problem |
| title_fullStr | An Accelerating Algorithm for Linear Multiplicative Programming Problem |
| title_full_unstemmed | An Accelerating Algorithm for Linear Multiplicative Programming Problem |
| title_short | An Accelerating Algorithm for Linear Multiplicative Programming Problem |
| title_sort | accelerating algorithm for linear multiplicative programming problem |
| topic | Linear multiplicative programming region reducing method improving compactness technique linear relaxed programming branch-and-bound algorithm |
| url | https://ieeexplore.ieee.org/document/9225012/ |
| work_keys_str_mv | AT shuaitang anacceleratingalgorithmforlinearmultiplicativeprogrammingproblem AT zhisonghou anacceleratingalgorithmforlinearmultiplicativeprogrammingproblem AT longquanyong anacceleratingalgorithmforlinearmultiplicativeprogrammingproblem AT shuaitang acceleratingalgorithmforlinearmultiplicativeprogrammingproblem AT zhisonghou acceleratingalgorithmforlinearmultiplicativeprogrammingproblem AT longquanyong acceleratingalgorithmforlinearmultiplicativeprogrammingproblem |