文档介绍：摘要随着科学信息技术的发展,使得全局优化在交通运输,金融经济,,关于研究全局优化问题的理论和算法相继出现,,存在多个不是全局最优解的局部最优解,,针对反向凸规划和二次分式比式和问题,: 第一章,总述全局优化问题的研究现状及一些经典算法,并简要介绍本文所研究问题的背景和所做的工作. 第二章,针对一类反向凸规划问题(RCP),,本算法首先把原问题转化为极小化一个辅助问题,再通过辅助问题删除盒子,求下界,更新最优解,分支等过程,,求解效率明显提高. 第三章,对于带有非凸二次约束的二次分式比式和问题,先通过引入一些新的变量, ,,,数值结果有明显改进. 关键词:二次比式和,反向凸规划,本质最优解,适应性分支,单调最优化 II ABSTRACT With the development ofscience and information technology,the globaloptimation has achieved extensive applicatipons inthe fieldoftransportation,work,physical,chemical and thetheory and algorithm ofglobaloptimiza- tionemerge gradually,but not yetvery forthe global minimization problems,there existmultiple localoptimal solutions thatdifferfrom theglobal solution. Thus,it isvery difficult toget aglobal optimal solution forthiskind thispaper,for akind of reverse convex programing and akindofsum ofqurdratic ratios problem,we propose anew globaloptimization method based on existing anized as follows: InChapter 1,first,a briefintroduction isgiven forsome classicdeterministic ap- proaches and stochastic approaches inorder wegive thelatestresearch development of reverse convex programing andsum ofqurdratic ratiosproblem and our work inthispaper. InChapter 2,this paper presents an adaptive branch reduced and bound algorithm forgloballysolving reverse convex programing(RCP).In order toget an essentialoptimal solution ofthisproblem,above all,we transform theproblem RCP into anequivalent global minization ,by reducing box depend on theauxiliary problem,determining thelowwer bound,updating theoptimal solution and subdivision,the convergence analysis guarantee that anessentialoptimal solut