Mathematics - Extra Topics Question with Solution | TestHub
The difference between the maximum value and minimum value of the objective function of a linear programming problem subject to constraints , , and is . Then the value of is
Options:
Answer:
Solution:
The given constraints are:
The feasible region is bounded by the lines , , , , and . Let us find the corner points of this feasible region:
Intersection of and
Intersection of and
Intersection of and
Intersection of and
Intersection of and
Now, we evaluate the objective function at each of these corner points:
At ,
At ,
At ,
At ,
At ,
From the above values, the maximum value of is and the minimum value of is .
The difference between the maximum and minimum values is:
Given that this difference is equal to , we have:
Answer: .
