In any linear programming problem with an equality constraint, an equivalent formulation can be obtained by simply replacing the equality constraint with a pair of inequality constraints obtained by serially replacing the equality sign of the constraint with $\pounds$ and by ${ }^{3}$ signs, leaving all other things unchanged.

Question

Quizplus · Accepted Answer

An equality constraint can be replaced by a pair of inequality constraints without changing the feasible region or the optimal solution.

In Any Linear Programming Problem with an Equality Constraint, an Equivalent