Chap 3 The simplex method q Linear Programming

Chap 3. The simplex method q Linear Programming 2019 1

3. 1 Optimality conditions q Linear Programming 2019 2

q Linear Programming 2019 3

q Linear Programming 2019 4

q Linear Programming 2019 5

q Linear Programming 2019 6

E F G q Linear Programming 2019 7

q Linear Programming 2019 8

q Linear Programming 2019 9

q Linear Programming 2019 10

3. 2 Development of the simplex method q Linear Programming 2019 11

q Linear Programming 2019 12

q Linear Programming 2019 13

q Linear Programming 2019 14

q Linear Programming 2019 15

Remarks q Linear Programming 2019 16

q Linear Programming 2019 17

q Linear Programming 2019 18

Simplex method for degenerate problems q Linear Programming 2019 19

q Linear Programming 2019 20

q Cycling : a sequence of basis changes that leads back to the initial basis. ( only basis changes, no solution change) q Cycling may occur if there exists degeneracy. Finite termination of the simplex method is not guaranteed. Need special rules for entering and/or leaving variable selection to avoid cycling (later). q Although cycling hardly occurs in practice, prolonged degenerate iterations might happen frequently, especially in well-structured problems. Hence how to get out of degenerate iterations as early as possible is of practical concern. Linear Programming 2019 21

Pivot Selection q Linear Programming 2019 22

Review of calculus q Linear Programming 2019 23

q Linear Programming 2019 24

q Linear Programming 2019 25

q Linear Programming 2019 26

q Linear Programming 2019 27