MCQ
The point which provides the solution to the linear programming problem: Max P = 2x + 3y subject to constraints: x ≥ 0, y ≥ 0, 2x + 2y ≤ 9, 2x + y ≤ 7, x + 2y ≤ 8, is ______
- A(3, 2.5)
- B(2, 3.5)
- ✓(1, 3.5)
- D(2, 2.5)
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.
Which of the Mendel's law the above mentioned statement explains?