Graphical Method Linear Programming MCQs
Graphical Method Linear Programming – MCQs with Answers & Explanations
Class: CBSE Class 12
Subject: Mathematics
Section: Linear Programming
Topic: Graphical Method Linear Programming MCQs
Exam Focus: CBSE Board Examinations
Subject: Mathematics
Section: Linear Programming
Topic: Graphical Method Linear Programming MCQs
Exam Focus: CBSE Board Examinations
These Multiple Choice Questions (MCQs) are designed strictly as per the NCERT syllabus, making them ideal for CBSE Class 12 Board Examination practice. Each question includes a detailed explanation for better conceptual understanding of the Graphical Method in Linear Programming.
1. Graphical method of LPP is used when number of variables are:
Answer: B
Graph plotting is possible only in two dimensions; hence graphical method applies to two variables.
Graph plotting is possible only in two dimensions; hence graphical method applies to two variables.
2. Feasible region is obtained by:
Answer: A
Common solution of all inequalities forms feasible region.
Common solution of all inequalities forms feasible region.
3. Feasible region lies in:
Answer: A
Non-negativity constraints restrict region to first quadrant.
Non-negativity constraints restrict region to first quadrant.
4. Optimal value occurs at:
Answer: B
Fundamental theorem of LPP.
Fundamental theorem of LPP.
5. Lines representing constraints are:
Answer: A
Because constraints are linear.
Because constraints are linear.
6. Iso-profit lines are drawn to:
Answer: B
They help locate maximum/minimum value.
They help locate maximum/minimum value.
7. If feasible region is unbounded, optimum:
Answer: B
8. Extreme points are also called:
Answer: B
9. Feasible region shape is:
Answer: A
10. If objective line overlaps boundary:
Answer: B
11. Graphical solution is:
Answer: B
12. Non-negativity means:
Answer: B
13. Feasible region may be:
Answer: D
14. Objective function line slope depends on:
Answer: A
15. Corner point method evaluates:
Answer: A
16. Region satisfying all constraints:
Answer: A
17. Linear constraints produce:
Answer: A
18. Graph method belongs to:
Answer: A
19. Bounded region optimum:
Answer: A
20. Graphical method gives solution visually:
Answer: A
