The tableau form used above to describe the algorithm lends itself to an immediate implementation in which the tableau is maintained as a rectangular ("m" + 1)-by-("m" + "n" + 1) array. It is straightforward to avoid storing the m explicit columns of the identity matrix that will occur within the tableau by virtue of B being a subset of the columns of [A, I]. This implementation is referred to as the ""standard" simplex algorithm". The storage and computation overhead is such that the standard simplex method is a prohibitively expensive approach to solving large linear programming problems.