In a linear program, if a constraint is of the equality type (=), then solutions that make the constraint $

Question

In a linear program, if a constraint is of the equality type (=), then solutions that make the constraint $<$ will also be allowed (that is, these solutions will also be feasible).

Quizplus · Accepted Answer

In a linear program, a constraint of the equality type (=) requires the solution to exactly match the specified value, not less than (<) or greater than (>). Solutions that do not exactly satisfy the equality will not be considered feasible.

In a Linear Program, If a Constraint Is of the Equality