Question 31 markMCQEasy
The corner points of the feasible region of a linear programming problem are , and . If is the objective function, then (maximum value of – minimum value of ) is equal to
Confirming your payment
Practice Questions · Question 3 of 30
The corner points of the feasible region of a linear programming problem are , and . If is the objective function, then (maximum value of – minimum value of ) is equal to
(A) 40
(B) 96
(C) 120
(D) 144
Answer: (D) 144
Step-by-Step Calculation:
Given Objective Function: Z = 30x + 24y
Evaluate Z at each corner point: