Simplex Method

Question 1

algorithm for simplex method

Answer 1

step 0: canonical form
step 1: if possible, guess feasible starting basis
else, use two-phase method and introduce artificial variables
if z’<0 no feasible solutions
if z’=0 then starting basis
step 2: perform pivots until
(a) all reduced costs are non positive (optimal basic solution reached)
(b) column with positive reduced costs and no positive element (unbounded)

Question 2

rules for picking

Answer 2

same rjθj: choose largest rj
same rj: choose lowest index
same θj values: lowest index