FWe define the standard form of a linear programming problem as:
*One whose objective function is maximization
*One whose constraints are expressed as equations and whose right hand side is non-negative (after the introduction of slack and surplus variables)
* One in which all the decision variables are non-negative
F