Тема: Use graphical methods to solve the linear programming problem (140)?
The initial tableau of Simplex method consists of all the coefficients of the decision variables of the original problem and the slack, surplus and artificial variables added in second step (in columns, with P 0 as the constant term and P i as the coefficients of the rest of X i variables), and constraints (in rows). The C b column contains the coefficients of the variables that are in the base.
The last row is calculated as follows: Z j = Σ(C bi ·P j ) for i = 1..m, where if j = 0, P 0 = b i and C 0 = 0, else P j = a ij. Although this is the first tableau of the Simplex method and all C b are null, so the calculation can simplified, and by this time Z j = -C j.