Linear Programming - Graphical Method

Grade 12 Maths — Linear Programming - Graphical Method: 25 practice questions with instant scoring and explanations.

1. Linear programming is used to:
2. A feasible region in linear programming is:
3. The vertices of the feasible region are important because:
4. For constraints x ≥ 0, y ≥ 0, x + y ≤ 5, the vertices are:
5. Maximize Z = 2x + 3y subject to x + y ≤ 5, x ≥ 0, y ≥ 0:
6. In the graphical method, the objective function line is:
7. The constraint x + 2y ≤ 10 represents:
8. If a linear programming problem has no feasible solution, it is called:
9. If the optimal value can be arbitrarily large, the problem is:
10. Minimize Z = 3x + 2y subject to x + y ≥ 5, x ≥ 0, y ≥ 0:
11. The constraint 2x + y ≥ 4 represents:
12. For a linear program with constraints, the feasible region is:
13. The corner point theorem states:
14. For maximize Z = x + y subject to x + 2y ≤ 6, 2x + y ≤ 6, x, y ≥ 0:
15. The feasible region for x ≥ 2, y ≥ 3, x + y ≤ 10 has vertices:
16. Maximize Z = 4x + 5y subject to x + y ≤ 5, 2x + y ≤ 8, x, y ≥ 0 gives:
17. A linear program with two variables can be solved graphically by:
18. If the objective function is Z = 2x + 2y and constraints give a feasible region that is a line segment, then:
19. For the constraint 3x + 2y ≤ 12, the y-intercept is:
20. The x-intercept of 3x + 2y ≤ 12 is:
21. Minimize Z = 2x + 3y subject to x + y ≥ 4, 2x + y ≥ 6, x, y ≥ 0:
22. In linear programming, the objective function must be:
23. Question?
24. Question?
25. Question?