Robust_optimization.pdf

Robust_optimization.pdf

ID:34891877

大小:681.96 KB

页数:171页

时间:2019-03-13

Robust_optimization.pdf_第1页
Robust_optimization.pdf_第2页
Robust_optimization.pdf_第3页
Robust_optimization.pdf_第4页
Robust_optimization.pdf_第5页
资源描述:

《Robust_optimization.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、RobustOptimizationbyMelvynSimB.Eng,ElectricalEngineering,NationalUniverityofSingapore(1995)M.Eng,ElectricalEngineering,NationalUniverityofSingapore(1996)S.M,HPCES,Singapore-MIT-Alliance(2000)SubmittedtotheSloanSchoolofManagementinpartialful¯llmentoftherequirementsforthedegreeofD

2、octorofPhilosophyinOperationsResearchattheMASSACHUSETTSINSTITUTEOFTECHNOLOGYJune2004°cMassachusettsInstituteofTechnology2004.Allrightsreserved.Author..............................................................SloanSchoolofManagementMay14,2004Certi¯edby.........................

3、.................................DimitrisJ.BertsimasBoeingProfessorofOperationsResearchSloanSchoolofManagementThesisSupervisorAcceptedby.........................................................JamesB.OrlinEdwardPennellBrooksProfessorofOperationsResearchCo-Director,OperationsRese

4、archCenter2RobustOptimizationbyMelvynSimSubmittedtotheSloanSchoolofManagementonMay14,2004,inpartialful¯llmentoftherequirementsforthedegreeofDoctorofPhilosophyinOperationsResearchAbstractWeproposenewmethodologiesinrobustoptimizationthatpromisegreatertractabil-ity,boththeoreticall

5、yandpracticallythantheclassicalrobustframework.Wecoverabroadrangeofmathematicaloptimizationproblems,includinglinearoptimization(LP),quadraticconstrainedquadraticoptimization(QCQP),generalconicoptimiza-tionincludingsecondorderconeprogramming(SOCP)andsemide¯niteoptimization(SDP),m

6、ixedintegeroptimization(MIP),network°owsand0¡1discreteoptimiza-tion.Ourapproachallowsthemodelertovarythelevelofconservatismoftherobustsolutionsintermsofprobabilisticboundsofconstraintviolations,whilekeepingtheproblemtractable.Speci¯cally,forLP,MIP,SOCP,SDP,ourapproachesretainthe

7、samecomplexityclassastheoriginalmodel.TherobustQCQPbecomesaSOCP,whichiscomputationallyasattractiveasthenominalproblem.Innetwork°ows,weproposeanalgorithmforsolvingtherobustminimumcost°owprobleminpolynomialnumberofnominalminimumcost°owproblemsinamodi¯ednetwork.For0¡1discreteoptimi

8、zationproblemwithcostuncertainty,therobustcount

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。
相关文章
更多
相关标签