HOT PRACTICE TEST
Chapter 12 – Linear Programming
Class XII Mathematics • 25 Marks
Graphical Feasible Region
Section A – 6 × 1 = 6
1. What is a feasible region?
2. What is a constraint?
3. What is an objective function?
4. Where does the optimum value generally occur in a bounded feasible region?
5. Can a linear programming problem have more than one optimal solution?
6. What is meant by a non-negative restriction?
Section B – 3 × 2 = 6
1. Graph x+y≤5, x≥0 and y≥0 and identify the feasible region.
2. Write the objective function for maximising profit when profit per unit of X and Y is ₹30 and ₹40 respectively.
3. Explain why corner points are important in graphical LPP.
Section C – 3 × 3 = 9
1. Maximise Z=3x+2y subject to x+y≤4, x≤2, y≤3, x,y≥0.
2. Minimise Z=2x+3y subject to x+y≥4, x≥1, y≥1.
3. Determine whether an LPP can have an unbounded feasible region but still possess a finite optimum.
Section D – 1 × 4 = 4
1. A manufacturer produces two products using two resources. Formulate an appropriate linear programming model from given resource limitations and profit data, draw the feasible region, and explain how the optimum is identified.