Linear Programming - Graphical Method, Corner Point Theorem

Grade 12 Maths Higher — Linear Programming - Graphical Method, Corner Point Theorem: 25 practice questions with instant scoring and explanations.

1. Linear Programming Problem consists of:
2. Feasible region is:
3. Corner Point Theorem states optimum occurs at:
4. Objective function Z = ax + by is optimized at:
5. Slack variables are introduced to convert:
6. Unbounded solution in LP means:
7. Infeasible solution when:
8. For minimize Z = 3x + 2y subject to x + y ≥ 5, x ≥ 0, y ≥ 0:
9. For maximize Z = x + 2y subject to x ≤ 4, y ≤ 3, x ≥ 0, y ≥ 0:
10. Graphical method for LP with two variables:
11. Constraint x + y ≤ 10 defines region:
12. Non-negativity constraints x ≥ 0, y ≥ 0 restrict to:
13. Isoquant (level curve) Z = c of objective function:
14. Optimal solution is found by:
15. Degenerate solution occurs when:
16. For system 2x + 3y ≤ 6 and x + 2y ≤ 4:
17. Sensitivity analysis in LP examines:
18. Maximize Z = 4x + 3y with 2x + 3y ≤ 12, x ≤ 4, y ≤ 3, x,y ≥ 0:
19. Minimize Z = x + y with x + y ≥ 4, x ≥ 1, y ≥ 1:
20. Mixed constraints (both ≤ and ≥) define:
21. Simplex method for LP with many variables:
22. Convex feasible region guarantees:
23. For constraint x + 2y = 8, the line passes through:
24. Review question for Linear Programming - Graphical Method, Corner Point Theorem
25. Review question for Linear Programming - Graphical Method, Corner Point Theorem