Question

linear programming:

where is i and m coming from in step5, from the second image?The algorithm is in the first image

The Simplex Algorithm for Maximum Tableaus - (1) The current tableau is of the form (ind. var.'s) a 2,2 ... ain 2,1 2,2 azn --(dep. var.'s) c c ... d -f (2) If b.b2,...,b-20, go to (6). Otherwise, continue. (3) Choose b; <0 such that i is maximal. (4) If a1.02...., 20, STOP; the maximization problem is infeasible. (This will be discussed more fully in a moment.) Otherwise, continue, (5) If i=m, choose a., <0, pivot on am, and go to (1). If i<m, choose a,<0, compute min({b;/a;}{bx/2x;:22; >0})=b/2, pivot on aj, and go to (1).

i am not looking for a solution, i am trying to figure out what the variable i and m stand for

Answer 1

m is the no. of linear constraints and i is highest subscript such that bi<0 since in the given problem there are 3 constraints we have m=3 and since b1<0 is the only bi which is less than 0 so we get i=1.