Back to Search
Start Over
Global optimization for sum of geometric fractional functions
- Source :
-
Applied Mathematics & Computation . Jun2010, Vol. 216 Issue 8, p2263-2270. 8p. - Publication Year :
- 2010
-
Abstract
- Abstract: This paper presents an efficient branch and bound algorithm for globally solving sum of geometric fractional functions under geometric constraints, which arise in various practical problems. By using an equivalent transformation and a new linear relaxation technique, a linear relaxation programming problem of the equivalent problem is obtained. The proposed algorithm is convergent to the global optimal solution by means of the subsequent solutions of a series of linear programming problems. Numerical results are reported to show the feasibility of our algorithm. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00963003
- Volume :
- 216
- Issue :
- 8
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 51259621
- Full Text :
- https://doi.org/10.1016/j.amc.2010.03.061