4 solving linear programming problems the simplex method(p)new

4 solving linear programming problems the simplex method(p)new

ID:34543042

大小:539.60 KB

页数:14页

时间:2019-03-07

4 solving linear programming problems the simplex method(p)new_第1页
4 solving linear programming problems the simplex method(p)new_第2页
4 solving linear programming problems the simplex method(p)new_第3页
4 solving linear programming problems the simplex method(p)new_第4页
4 solving linear programming problems the simplex method(p)new_第5页
资源描述:

《4 solving linear programming problems the simplex method(p)new》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、Session4运筹学OperationsResearch4-1运筹学运筹学OperationsResearchOperationsResearch4SolvingLPProblems:SimplexMethod4SolvingLinearProgrammingProblems:4.1TheEssenceoftheSimplexMethodTheSimplexMETHODThesimplexmethodisanalgebraicprocedure.However,itsunderlyingconceptsaregeometric.understandingthese

2、geometricø4.1TheEssenceOftheSimplexMethodconceptsprovidesastrongintuitivefeelingforhowthesimplexø4.2SettingUptheSimplexMethodmethodoperatesandwhatmakesitsoefficient.ø4.3TheAlgebraoftheSimplexMethodForasimplexmethod,wefirstfinditscorner-pointsolutionsø4.4TheSimplexMethodinTabularForm(CP

3、FSOLUTIONS),thenwewillprovideaveryusefulwayofcheckingwhetheraCPFsolutionisanoptimalsolution.ø4.5TieBreakingintheSimplexMethodNowwearereadytoapplythesimplexmethodtotheø4.6AdaptingtoOtherModelFormexample.ø4.7Post-OptimalityAnalysis江西财经大学信息管理学院©2006江西财经大学信息管理学院©2006SchoolofInformationTech

4、nology,JiangXiUniversityofFinance&Economics©20061SchoolofInformationTechnology,JiangXiUniversityofFinance&Economics©20062运筹学4.1TheEssenceoftheSimplexMethod运筹学4.1TheEssenceoftheSimplexMethodOperationsResearchOperationsResearchSolvingtheExample¾Initialization:Choose(0,0)astheinitialCPFso

5、lutiontoHereisanoutlineofwhatthesimplexexamine.(Thisisaconvenientchoicebecausenocalculationx2methoddoes(fromageometricviewpoint)arerequiredtoidentifythisCPFsolution.)(0,9)tosolvetheWyndorGlassCo.problem.At¾OptimalTest:Concludethat(0,0)isnotanoptimalsolution.eachstep,firsttheconclusioni

6、sstatedand(AdjacentCPFsolutionsarebetter.)thenthereasonisgiveninparentheses.(2,6)(4,6)¾Iteration1:MovetoabetteradjacentCPFsolution,(0,6),(0,6)6CPFItsadjacentCPFbyperformingthefollowingthreesteps.solutionsolutions4(4,3)(0,0)(0,6)and(4,0)•Betweenthetwoedgesofthefeasibleregionthatemanatef

7、rom(0,6)(2,6)and(0,0)(0,0),choosetomovealongtheedgethatleadsupthex2axis.2(2,6)(4,3)and(0,6)•Stopatthefirstnewconstraintboundary:2x2=12.(0,0)(6,0)(4,3)(4,0)and(2,6)•Solvefortheintersectionofthenewsetofconstraint0(4,0)(4,0)(0,0)and(4,3)boundaries:(0,6).24x1江西财经大学信息管理学院©2006江西财经大学信息管理学院

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

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

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