In linear programming formulations,it is possible to have the following types of constraints:
A)$\le$.
B).
C)=.
D)a and c only.
E)All of the above.

Question

In linear programming formulations,it is possible to have the following types of constraints:
A)$\le$.
B)>.
C)=.
D)a and c only.
E)All of the above.

Quizplus · Accepted Answer

Option (A) talks about a less than or equal to constraint, and option (C) talks about an equal to constraint. Therefore, options (A) and (C) are the correct choices. Option (B) talks about a greater than constraint, which is not possible in linear programming formulations. Hence, it is not a valid constraint. Thus, option (E) is incorrect.

In Linear Programming Formulations,it Is Possible to Have the Following ≤\le≤

In Linear Programming Formulations,it Is Possible to Have the Following $\le$