In a linear programming problem involving minimization, at least one constraint must be of the __________ type.
A) less than or equal
B) integer
C) greater than or equal
D) binary
E) slack

Question

Quizplus · Accepted Answer

In a minimization problem, at least one constraint needs to be of the "greater than or equal" type because the objective function is to minimize (i.e., make as small as possible) the value of the decision variables. Without a constraint that forces the decision variables to be greater than or equal to a certain value, the optimal solution could be negative and unbounded.

In a Linear Programming Problem Involving Minimization, at Least One