期刊
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
卷 135, 期 1, 页码 1-17出版社
SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10957-007-9199-8
关键词
global optimization; sum of ratios; fractional programming; concave minimization; branch-and-bound algorithms
This article presents an algorithm for globally solving a sum of ratios fractional programming problem. To solve this problem, the algorithm globally solves an equivalent concave minimization problem via a branch-and-bound search. The main work of the algorithm involves solving a sequence of convex programming problems that differ only in their objective function coefficients. Therefore, to solve efficiently these convex programming problems, an optimal solution to one problem can potentially be used to good advantage as a starting solution to the next problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据