Download presentation

Presentation is loading. Please wait.

Published byGraciela Lunn Modified over 2 years ago

1
Simplex (quick recap)

2
Replace all the inequality constraints by equalities, using slack variables

3
8 constraints 5 variables (i.e., 5 dimensional space) any vertex solution corresponds to the intersection of 5 tight constraints. 3 of these are three equalities. other 2 must be xi = 0 and xj = 0 for some i,j x2x1 x3 x4 x5 (x1 = 0, x2 = 0, x3 = 1, x4 = 3, x5 = 2)

4
non-basic vars basic vars non-basic vars are set to 0. basic vars values are then fixed Pick a non-basic variable (say x2) with positive coefficient in objective increase its value until some other variable (x3) goes to 0 x2 enters basis, x3 exits basis. x2x1 x3 x4 x5 (x1 = 0, x2 = 0, x3 = 1, x4 = 3, x5 = 2) constraint for x3 now tight constraint for x2 no longer tight which one? (pivot rule)

5
non-basic vars are set to 0. basic vars values are then fixed (x1 = 0, x2 = 1, x3 = 0, x4 = 3, x5 = 1) x2x1 x3 x4 x5 Pick a non-basic variable (say x2) with positive coefficient in objective increase its value until some other variable (x3) goes to 0 x2 enters basis, x3 exits basis. constraint for x3 >= 0 now tight constraint x2 >= 0 no longer tight

6
non-basic vars are set to 0. basic vars values are then fixed Pick a non-basic variable (say x1) with positive coefficient in objective increase its value until some other variable (x5) goes to 0 x1 enters basis, x5 exits basis. (x1 = 0, x2 = 1, x3 = 0, x4 = 3, x5 = 1) x2x1 x3 x4 x5

7
non-basic vars are set to 0. basic vars values are then fixed Pick a non-basic variable (say x3) with positive coefficient in objective increase its value until some other variable (x4) goes to 0 x3 enters basis, x4 exits basis. (x1 = 1, x2 = 2, x3 = 0, x4 = 2, x5 = 0) x2x1 x3 x4 x5

8
non-basic vars are set to 0. basic vars values are then fixed Pick a non-basic variable with positive coefficient in objective if no such variable, must be at optimum. (x1 = 3, x2 = 2, x3 = 2, x4 = 0, x5 = 0) x2x1 x3 x4 x5

9
Pick a non-basic variable (say x2) with positive coefficient in objective non-basic vars are set to 0. basic vars values are then fixed If it can be increased arbitrarily, LP is unbounded

10
Pick a non-basic variable (say x2) with positive coefficient in objective non-basic vars are set to 0. basic vars values are then fixed If it can be increased by only zero, degenerate vertex.

11
Pick a non-basic variable (say x1) with positive coefficient in objective non-basic vars are set to 0. basic vars values are then fixed now it can be increased… What if we keep cycling in this degenerate vertices (or degenerate faces)? Solution: anti-cycling pivot rules.

12
Pivot rules largest coefficient largest increase steepest edge Bland’s rule (non-cycling) Random edge often best in practice

Similar presentations

Presentation is loading. Please wait....

OK

SIMPLEX METHOD FOR LP LP Model.

SIMPLEX METHOD FOR LP LP Model.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Structural analysis in reading ppt on ipad Ppt on nature and humans Ppt on tamper resistant outlet Ppt on eye oscillopsia Ppt on duty roster for camping Ppt on sea level rise simulation Ppt on honge oil Ppt on near field communication Ppt on communication in india Slides for ppt on internet