MHT CET 2025 Mathematics question

MathematicsLinear ProgrammingMHT CET 2025

Not in JEE syllabus

The solution for minimizing the function z = x + y under an L.P.P. with constraints x + y ≥ 2, x + 2y ≤ 8, y ≤ 3, x, y ≥ 0 is

Answer: (C)

Solution

The feasible region (bounded) has corner points (from , , and the axes). Values of : . The minimum value occurs at both and , hence at every point of the segment joining them,

See the full step-by-step solution

Create a free account to read the complete working, and practise questions like this in a timed test.

Create a free account

Question ID VK-103184