.png){kind=icon}
返回
An Accelerating Algorithm for Linear Multiplicative Programming Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3031354.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. Its 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.
Keyword:
Programming profession
Approximation algorithms
Heuristic algorithms
Acceleration
Linear programming
Computational complexity
Linear multiplicative programming
region reducing method
improving compactness technique
linear relaxed programming
branch-and-bound algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
分享收藏分享收藏A Comparison of Postural Stability during Upright Standing between Normal and Flatfooted Individuals, Based on COP-Based Measures.png)
EntropyOAAI
EntropyIF0
OAAI分享收藏An Efficient Outer Space Algorithm for Generalized Linear Multiplicative Programming Problem广义线性乘性规划问题的一种有效外空间算法IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏分享收藏
查看更多内容