330 Introduction to Computational Models with Python
with a negative coefficient in the objective row (row 0 ) has a non-positive
coefficient in every constraint.
20.4.2 Detailed Description of the Simplex Algorithm
A shorthand form of the set of equations known as the simplex tableau is
used in the alg orithm. Each tableau corresponds to a movement from one
basic variable set BVS (extreme or corner point) to another, making sure that
the objective function improves at each iteration until the optimal solution
is reached. The following sequence of steps describes the application of the
simplex solution algorithm:
1. Convert the LP to the following form:
(a) Convert the minimization problem into a maximization one.
(b) All variables must be non-negativ