For a Linear Programming Problem, Z = 2x + 4y . Feasible corner points are O(0, 0), A(0, 2.5), B(3, 1), C(4, 0) . What is the optimal maximized value - Mathematics MCQ Mathematics Mock Test - 3 2026 | ExamTest.live

mediumMCQMathematics Mock Test - 32026Mathematics

1 mark

For a Linear Programming Problem, Z = 2 x + 4 y . Feasible corner points are O (0, 0), A (0, 2.5), B (3, 1), C (4, 0) . What is the optimal maximized value of Z ?

Solution & Step-by-step Explanation

Testing corner points in Z = 2 x + 4 y :At O (0, 0) : Z = 2 (0) + 4 (0) = 0 At A (0, 2.5) : Z = 2 (0) + 4 (2.5) = 10 At B (3, 1) : Z = 2 (3) + 4 (1) = 6 + 4 = 10 At C (4, 0) : Z = 2 (4) + 4 (0) = 8 The maximum value is 10 .

Try it yourself before checking the explanation above.

For a Linear Programming Problem, Z = 2 x + 4 y . Feasible corner points are O (0, 0), A (0, 2.5), B (3, 1), C (4, 0) . What is the optimal maximized value of Z ?

12

10

6

None

Practice with timed mock tests and track your performance across Mathematics.