Linear Programming MCQs | Class 12 Maths Chapter 12 MCQ Question and Answers

by | Dec 24, 2025 | General | 0 comments

 

Linear Programming MCQ Question Answers for CUET 2026 from Class 12 Maths Chapter 12

To score full marks in the CUET 2026 Maths exam, Practice Class 12 Maths Chapter 12 Linear Programming MCQ Test any number of times free on our website. These questions have been created by our experts from the latest Class 12 Maths Syllabus and as per latest exam pattern. Multiple Choice Questions (MCQs) are a type of objective assessment in which a person is asked to choose one or more correct answers from a list of available options. An MCQ presents a question along with several possible answers. Most of the exams in India including CUET exam conduct online test to check your knowledge

Class 12 Maths Chapter 12 MCQs

1. Question
a.
b.
c.
d.

2. Objective function of a linear programming problem is
a.
b.
c.
d.

3. Question
a.
b.
c.
d.

4. Question
a.
b.
c.
d.

5. Question
a.
b.
c.
d.

6. In solving the LPP: “minimize f = 6x + 10y subject to constraints x ≥ 6, y ≥ 2, 2x + y ≥ 10, x ≥ 0, y ≥ 0” redundant constraints are
a.
b.
c.
d.

7. The maximum value of Z = 3x + 4y subjected to constraints x + y ≤ 40, x + 2y ≤ 60, x ≥ 0 and y ≥ 0 is
a.
b.
c.
d.

8. Question
a.
b.
c.
d.

9. In a LPP, the objective function is always
a.
b.
c.
d.

10. Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0
a.
b.
c.
d.

11. The minimum value of Z = 4x + 3y subjected to the constraints 3x + 2y ≥ 160, 5 + 2y ≥ 200, 2y ≥ 80; x, y ≥ 0 is
a.
b.
c.
d.

12. Z = 8x + 10y, subject to 2x + y ≥ 1, 2x + 3y ≥ 15, y ≥ 2, x ≥ 0, y ≥ 0. The minimum value of Z occurs at
a.
b.
c.
d.

13. A set of values of decision variables that satisfies the linear constraints and non-negativity conditions of an L.P.P. is called its:
a.
b.
c.
d.

14. The region represented by the inequation system x, y ≥ 0, y ≤ 6, x + y ≤ 3 is
a.
b.
c.
d.

15. Maximize Z = 11 x + 8y subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0.
a.
b.
c.
d.

16. Objective function of a L.P.P.is
a.
b.
c.
d.

17. In equation 3x – y ≥ 3 and 4x – 4y > 4
a.
b.
c.
d.

18. For the LP problem maximize z = 2x + 3y The coordinates of the corner points of the bounded feasible region are A(3, 3), B(20,3), C(20, 10), D(18, 12) and E(12, 12). The minimum value of z is
a.
b.
c.
d.

19. Region represented by x ≥ 0, y ≥ 0 is:
a.
b.
c.
d.

20. The minimum value of Z = 3x + 5y subjected to constraints x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0 is:
a.
b.
c.
d.

21. The linear inequalities or equations or restrictions on the variables of a linear programming problem are called:
a.
b.
c.
d.

22. The maximum value of the object function Z = 5x + 10 y subject to the constraints x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x ≥ 0, y ≥ 0 is
a.
b.
c.
d.

23. The optimal value of the objective function is attained at the points:
a.
b.
c.
d.

24. The point which does not lie in the half plane 2x + 3y -12 < 0 is
a.
b.
c.
d.

25. The maximum value of Z = 4x + 2y subject to the constraints 2x + 3y ≤ 18, x + y ≥ 10, x, y ≤ 0 is
a.
b.
c.
d.


 

 

To summarize, revising for free using our MCQs on Class 12 Maths Chapter 12 Linear Programming is highly beneficial for scoring full marks on the CUET 2026 Maths exam. We provide a sophisticated online test platform tailored for unlimited practice through proficiently crafted questions built on the most recent syllabus and exam pattern. Practicing MCQs regularly will boost conceptual understanding as they are significant for objective assessments. Start practicing now to succeed in your CUET 2026 Maths exam!

Also See :

on

Submit a Comment

Your email address will not be published. Required fields are marked *