CO250 Study Guide - Simplex Algorithm

• School: University of Waterloo
• Department: Combinatorics and Optimization
• Course: CO250
• Professor: Christine Dupont

Document Summary

Due: wednesday march 20 at the beginning of class: consider the following lp: maximize subject to. 2x1 + x2 x3 + 3x4 + x5 x6 x1 + 2x2 + x4 + x5 2x6 = 3. Give the optimal basis, the optimal solution and the optimal value: consider the following lp: maximize subject to. After converting to sef by adding slack variables x4, x5, x6, the optimal tableau is: 0 0 for the basis b = {1, 3, 5}. 5000 (a) solve the following modi ed lp for the di erent values of : maximize subject to. 10x1 + 20x2 + 40x3 10000 + . 25x1 + 30x2 + 50x3 25000 2 . 50x1 + 40x2 + 100x3 40000 + x 0 by using the optimal tableau from the original lp. 50x1 + 40x2 + 100x3 40000 x 0 by using the optimal tableau from the original lp.