.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
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 Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
ShareSaveShareSaveShareSaveA Novel Group Decision Making Method Under Uncertain Multiplicative Linguistic Environment for Information System Selection.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSaveShareSaveShareSave
View more