.png){kind=icon}
.png){kind=icon}
Return
A new linearization method for generalized linear multiplicative programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2010.10.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a deterministic global optimization algorithm for solving generalized linear multiplicative programming (GLMP). In this algorithm, a new linearization method is proposed, which applies more information of the function of (GLMP) than some other methods. By using this new linearization technique, the initial nonconvex problem is reduced to a sequence of linear programming problems. A deleting rule is presented to improve the convergence speed of this algorithm. The convergence of this algorithm is established, and some experiments are reported to show the feasibility and efficiency of this algorithm. (C) 2010 Elsevier Ltd. All rights reserved.
Keywords:
Global optimization
Multiplicative programming
Linear relaxation
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
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W