Good Case SR1 Iteration 2 Output Optimal SolutionSR 1 yGW yGC 1 yGB \u03bcG

# Good case sr1 iteration 2 output optimal solutionsr 1

This preview shows page 10 - 19 out of 28 pages.

Good Case - SR1 (Iteration 2) – Output Optimal SolutionSR 1: ∆ yGW = 0 ∆ yGC =− 1 ∆ yGB = 0 ∆ μG = 0 Feasibility Cut needed to add: −( 240 3.6 x C ) 0 Average Case – SP2 (Iteration 2)
Average Case – SP2 (Iteration 2) – Output Infeasible Average Case – SR2 (Iteration 2)
Average Case – SR2 (Iteration 2) – Output Optimal SolutionSR 2: ∆ yAW = 0 ∆ yAC =− 1 ∆ yAB = 0 ∆ μA = 0 Feasibility Cut needed to add: −( 240 3 x C ) 0
Bad Case – SP3 (Iteration 2) Bad Case – SP3 (Iteration 2) – Output Infeasible
Bad Case – SR3 (Iteration 2) Bad Case – SR3 (Iteration 2) – Output Optimal SolutionSR 2: ∆ yBW = 0 ∆ yBC =− 1 ∆ yVBB = 0 ∆μB = 0 Feasibility Cut needed to add: −( 240 2.4 x C ) 0
MP (Iteration 3) after adding Feasibility Cuts from Iteration 2. MP (Iteration 3) – Output ^ x W = 100 ^ x C = 100 ^ x B = 0 ^ z G = ^ z A = ^ z B =
Good Case - SP1 (Iteration 3) Good Case - SP1 (Iteration 3) – Output Feasible – Find Dual Optimal Solution, there is no extreme direction Optimal SolutionSD 1: ^ yGW =− 42.5 ^ yGC =− 37.5 ^ yGB = 9 ^ μG = 0 Optimality Cut needed to add: 42.5 × ( 200 3 x W ) 37.5 × ( 240 3.6 x C ) + 9 × ( 24 x B ) 0
Average Case – SP2 (Iteration 3) Average Case – SP2 (Iteration 3) – Output Feasible – Find Dual Optimal Solution, there is no extreme direction Optimal SolutionSD 2: ^ y AW =− 59.5 ^ y AC =− 52.5 ^ y AB = 12.6 ^ μG = 0 Optimality Cut needed to add: 59.5 × ( 200 2.5 x W ) 52.5 × ( 240 3 x C ) + 12.6 × ( 20 x B ) 0
Bad Case – SP3 (Iteration 3) Bad Case – SP3 (Iteration 3) – Output Feasible

#### You've reached the end of your free preview.

Want to read all 28 pages?

• Spring '12
• lizhiwang
• Trigraph, good case, SP1