中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Conical partition algorithm for maximizing the sum of dc ratios

文献类型:期刊论文

作者Dai, Y; Shi, JM; Wang, SY
刊名JOURNAL OF GLOBAL OPTIMIZATION
出版日期2005-02-01
卷号31期号:2页码:253-270
关键词cutting plane fractional programming global optimization outer approximation sum of ratios
ISSN号0925-5001
DOI10.1007/s10898-004-5699-3
英文摘要The following problem is considered in this paper: max(x is an element of D) {Sigma(j = 1)(m) g(j)(x)\h(j)(x)}, where g(j)(x)>= 0 and h(j)(x) > 0; j = 1,..., m; are d. c. (difference of convex) functions over a convex compact set D in R-n. Specifically, it is reformulated into the problem of maximizing a linear objective function over a feasible region defined by multiple reverse convex functions. Several favorable properties are developed and a branch-and-bound algorithm based on the conical partition and the outer approximation scheme is presented. Preliminary results of numerical experiments are reported on the efficiency of the proposed algorithm.
WOS研究方向Operations Research & Management Science ; Mathematics
语种英语
WOS记录号WOS:000228173700005
出版者SPRINGER
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/1134]  
专题中国科学院数学与系统科学研究院
通讯作者Dai, Y
作者单位1.Univ Illinois, Dept Bioengn MC063, Chicago, IL 60607 USA
2.Muroran Inst Technol, Dept Comp Sci & Syst Engn, Muroran, Hokkaido 0508585, Japan
3.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Dai, Y,Shi, JM,Wang, SY. Conical partition algorithm for maximizing the sum of dc ratios[J]. JOURNAL OF GLOBAL OPTIMIZATION,2005,31(2):253-270.
APA Dai, Y,Shi, JM,&Wang, SY.(2005).Conical partition algorithm for maximizing the sum of dc ratios.JOURNAL OF GLOBAL OPTIMIZATION,31(2),253-270.
MLA Dai, Y,et al."Conical partition algorithm for maximizing the sum of dc ratios".JOURNAL OF GLOBAL OPTIMIZATION 31.2(2005):253-270.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。