Mathematics - Extra Topics Question with Solution | TestHub
For the linear programming problem, , the maximum value of occurs at every point on the line segment joining the points..
Options:
Answer:
Solution:
The given constraints are:
To find the corner points of the feasible region, we solve the equations of the boundary lines:
Multiplying the second equation by 2, we get . Subtracting the first equation from this gives:
Substituting back into the first equation:
The intersection point is .
The corner points of the feasible region are , , , and .
Now, we evaluate the objective function at each corner point:
At :
At :
At :
At :
The maximum value of is , which occurs at two adjacent corner points: and .
Since the maximum value is the same at these two points, it occurs at every point on the line segment joining and .
Answer: and
