Consider a maximization type linear program in standard form with three constraints and six variables. Suppose that in a particular iteration of simplex algorithm, the basic variables are $x_1,x_2,x_3,$ the non$-$basic variables are $x_4,x_5,x_6$ and the current simplex tableau is given as below:

$2$

IE $311$

$\backslash$table$[[$Row$,$BV$,,,,,,,,$RHS$],[0,x_0,x_0,,,,-x_4,-x_5,-x_6,=$