.png){kind=icon}
返回
Global Algorithm for Generalized Affine Multiplicative Programming Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2951515.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a new outer space rectangle branch and bound algorithm is proposed for globally solving generalized affine multiplicative programming problem. By applying the equivalent transformations and affine approximations of bilinear function, the initial generalized affine multiplicative programming problem can be reduced to a linear relaxed programming problem. By subsequently refine the initial outer space rectangle, and by means of the subsequent solutions of a series of linear relaxed programming problems, the algorithm is convergent to the global optimal solution of the primal problem, and numerical results show the feasibility and effectiveness of the algorithm.
Keyword:
Programming
Approximation algorithms
Linear programming
Optimization
Partitioning algorithms
Heuristic algorithms
Search problems
Generalized affine multiplicative programming
global optimization
linear relaxed programming
branch and bound
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
分享收藏A Novel Group Decision Making Method Under Uncertain Multiplicative Linguistic Environment for Information System Selection.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏分享收藏
查看更多内容