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

Question

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

Quizplus · Accepted Answer

In linear programming formulations, constraints can be of three types - less than or equal to (≤), greater than (>) or equal to (=). Thus, all three types of constraints mentioned in options A), B) and C) are commonly used in linear programming problems. Hence, the best answer is D) All of the above.

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