Simplex.
The core of the simplex method in matrix form. Given a feasible maximization problem P in standard form (the matrix form with slack variables) where c is a row vector of the coefficients of the cost function and T is obviously the transposition. The matrix A has m rows, d columns, where m is the