.png){kind=icon}
Return
A deterministic global optimization algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.06.101.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we consider a deterministic global optimization algorithm for solving a general linear sum of ratios (LFP). First, an equivalent optimization problem (LFP1) of LFP is derived by exploiting the characteristics of the constraints of LFP. By a new linearizing method the linearization relaxation function of the objective function of LFP1 is derived, then the linear relaxation programming (RLP) of LFP1 is constructed and the proposed branch and bound algorithm is convergent to the global minimum through the successive refinement of the linear relaxation of the feasible region of the objection function and the solutions of a series of RLP. And finally the numerical experiments are given to illustrate the feasibility of the proposed algorithm. (c) 2006 Elsevier Inc. All rights reserved.
Keywords:
general linear sum of ratios
linearization relaxation
branch and bound algorithm
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
ShareSaveThe clinicopathological significance of monocarboxylate transporters in testicular germ cell tumors.png)
Oncotarget
OAAI
OncotargetIF0
OAAIShareSaveQuantitative assessment of circulatory changes in the fetal aortic isthmus during progressive increase of resistance to umbilical blood flow.CirculationOAAI
CirculationIF0
OAAIShareSaveShareSave no more
no more