Linear Programming

a₁ artificial variables artificial vector B.F. solutions B₁ basic feasible solution basic solution basic variables basis matrix c₁ CB XB CBXB column vector component compute convex combination convex set corresponding dual problem entering vector extreme point following L.P.P. given L.P.P. given problem Hence identity matrix incoming vector iteration key element L.P. problem leaving vector linear programming problem maximization maximize Z Meerut 87 Meerut 95 Mini Ratio minimum ratio rule mixed strategies non-degenerate non-negative objective function obtained outgoing vector primal problem pure strategies revised simplex method saddle point simplex algorithm slack variables Solve the following starting B.F.S. starting simplex table Step strategy surplus variables theorem units unrestricted in sign W₁ x₁ and x2 XB Y1 Y2 Y₁ Y3 Y4 Ys zero ας β₁ Св