306 Introduction to Computational Modeling
(b) All variables must be non-negative.
(c) All RHS values must be non-negative.
(d) All constraints must be inequalities of the form ≤.
2. Convert all constraints to equalities by adding a slack variable for each con-
straint.
3. Construct the initial simplex tableau with all slack variables in the basic vari-
able set (BVS). The row 0 in the table contains the coefficient of the objective
function.
4. Determine whether the current tableau is optimal. That is: If all RHS values are
non-negative (called, the feasibility condition) and if all elements of the row
0 are non-positive (called, the optimality condition). If the answers to both
questions are Yes, then stop. The current tableau contains an optimal solution. ...