MTH 208 Lecture 20: 12.5
15 May 2020
School
Department
Course
Professor
Document Summary
Oneidea reduce your problem by means of cutting planes. Idea to solve 2 l o p split feasible set into 2 pieces c branch show ihop optimum on one piece is smaller than on other piece c bond. 7 11 9 2 e 35 where x xz c in eo 1,2 3. Usingsimplex on the relaxation of p cwhere x 1 220 and x xzelr givesoptimum x. In this is not a kop optimal sire x l96 cn. 2 problems w addedconstraints xj 71. 96 on problem pa. For pa branch on rz a z 28. In we will branch on both of those. Note paa is infeasible since 11 1 7 2 35. Xz 73 xzein has empty feasibleregion tellsus paoptimumand. X2e3 let"s branch on pb before branching pab. Cie more horizontlyfirst called breadthfirstsearch going down the first called depthfirst. On ib can solve for q ct ft ic i 3. 11.
