# Computing the Optimal Simplex Tableau for Linear Programming

I am learning in my class about computing the optimal simplex tableau. I learned that, if you have an initial basic feasible solution, you can apply a series of formulas to compute the optimal tableau.

When you have $m$ basic variables in your BFS and $m$ constraints, I understand how these formulas work.

However, let's say you have $m-1$ basic variables. Then, your $B$ matrix will not be square, and its inverse is not well defined. How do you deal with situations like these?

• The number of basic variables in a BFS is always equal to the number of constraints... – Math1000 Dec 18 '14 at 1:24