.png){kind=icon}
.png){kind=icon}
Return
A note on a deterministic global optimization algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2008.01.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this technical note, we give a short extension application for a deterministic global optimization algorithm proposed in [Y. Ji, K.-C. Zhang, S.-J. Qu, A deterministic global optimization algorithm, Applied Mathematics and Computation 185 (2007) 382-387]. Actually our result is slightly more general, since it does not impose any special sign restrictions on numerators and denominators of the ratios. The only assumption is that the denominators of the ratios are nonzero over the feasible region of the problem. For clarity we use the same notations for the different equivalent problems and the corresponding relaxation linear programming (RLP) as done in Ji et al. (2007). (c) 2008 Elsevier Inc. All rights reserved.
Keywords:
global optimization
linear sum of ratios
branch and bound
linear relaxation
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W