Linear Programming MCQs, Class 12 Maths Chapter 12 MCQ Quiz

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

Please wait...

1. In maximization problem, optimal solution occurring at corner point yields the

a.Highest value of Z

b.Mid values of Z

c.Mean values of Z

d.Lowest value of Z

2. 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.None of these

b. x ≥ 6

c. x ≥ 6, y ≥ 2

d.2x + y ≥ 10, x ≥ 0, y ≥ 0

3. Question

a.d

b.c

c.b

d.a

4. The maximum value of z = 3x + 2y subject to x + 2y ≥ 2, x + 2y ≤ 8, x, y ≥ 0 is

a.None of these

b.24

c.40

d.32

5. 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.600

b.800

c.400

d.300

6. A feasible solution to an LP problem,

a.Need not satisfy all of the constraints, only some of them.

b.Must be a corner point of the feasible region.

c.Must satisfy all of the problem’s constraints simultaneously.

d.Must optimize the value of the objective function.

7. Question

a.(6, 10)

b.(0, 8)

c.(5, 0)

d.(0, 0)

8. Maximize Z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0

a.24 at (0, 4)

b.36 at (0, 6)

c.24 at (6, 0)

d.16 at (4, 0)

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

a.120

b.140

c.100

d.160

10. In a LPP, the objective function is always

a.Biquadratic

b.Linear

c.Cubic

d.Quadratic

11. The maximum value of f = 4x + 3y subject to constraints x ≥ 0, y ≥ 0, 2x + 3y ≤ 18; x + y ≥ 10 is

a.34

b.35

c.None of these

d.36

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

a.220

b.300

c.None of these

d.230

13. Objective function of a linear programming problem is

a.A constraint

b.Function to be optimized

c.None of these

d.A relation between the variables

14. Question

a.80 at (3, 2)

b.95 at (2, 3)

c.30 at (3, 0)

d.75 at (0, 3)

15. Maximize Z = 3x + 5y, subject to constraints: x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0

a.20 at (1, 0)

b.30 at (0, 6)

c.37 at (4, 5)

d.33 at (6, 3)

16. Question

a.c

b.b

c.a

d.d

17. Region represented by x ≥ 0, y ≥ 0 is:

a.First quadrant

b. Third quadrant

c.Fourth quadrant

d.Second quadrant

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

a.36

b.40

c.30

d.None of these

19. The point which does not lie in the half plane 2x + 3y -12 < 0 is

a.(-3, 2)

b.(2, 3)

c.(1, 2)

d.(2, 1)

20. Corner points of the bounded feasible region for an LP problem are A(0,5) B(0,3) C(1,0) D(6,0). Let z=−50x + 20y be the objective function. Minimum value of z occurs at ______ center point.

a.(0, 5)

b.(0, 3)

c.(6, 0)

d.(1, 0)

21. Question

a.336 at (6, 24)

b.0 at (0, 0)

c.540 at (0, 60)

d.360 at (18, 0)

22. Which of the following statements is correct ?

a.If an LP problem has two optimal solutions, then it has infinitely many solutions.

b.Every LP problem has a unique solution.

c.Every LP problem has at least one optimal solution.

d.If a feasible region is unbounded then LP problem has no solution

23. Maximize Z = 3x + 5y, subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0

a.20 at (1, 0)

b.33 at (6, 3)

c.37 at (4, 5)

d.30 at (0, 6)

24. In equation 3x – y ≥ 3 and 4x – 4y > 4

a.Have no solution for positive x and y

b.Have solution for all y

c.Have solution for positive x and y

d.Have solution for all x

25. Which of the following is a type of Linear programming problem?

a.All of the above

b.Manufacturing problem

c.Transportation problesm

d.Diet Problem

26. The maximum value of Z = 3x + 4y subjected to constraints x + y ≤ 4, x ≥ 0 and y ≥ 0 is:

a.14

b.None of these

c.12

d.16

27. The point which does not lie in the half-plane 2x + 3y -12 < 0 is:

a.(1,2)

b.(2,3)

c.(-2,3)

d.(2,1)

28. 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.None of these

b.Unbounded solution

c.Feasible solution

d.Optimum solution

29. Objective function of a L.P.P.is

a.A relation between the variables

b.A constraint

c.None of these

d.A Function to be optimized

30. 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.72

b.80

c.70

d.82

31. Question

a.The relationship cannot be determined On the basis of the information supplied

b.The quantity in column B is greater

c.The quantity in column A is greater

d.The two quantities are equal

32. Maximize Z = 11 x + 8y subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0.

a.62 at (4, 0)

b.44 at (4, 2)

c.60 at (4, 2)

d.48 at (4, 2)

33. Question

a.95 at (2, 3)

b.80 at (3, 2)

c.30 at (3, 0)

d.75 at (0, 3)

34. 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.(7, 0)

b.(1.5, 4)

c.(0, 7)

d.(4.5, 2)

35. The linear inequalities or equations or restrictions on the variables of a linear programming problem are called:

a.A constraint

b.None of these

c.Decision variables

d.Objective function

36. The optimal value of the objective function is attained at the points

a.None of these

b.On X-axis

c.Which are corner points of the feascible region

d.On Y-axis

37. The region represented by the inequation system x, y ≥ 0, y ≤ 6, x + y ≤ 3 is

a.unbounded in first quadrant

b.None of these

c.unbounded in first and second quadrant

d.bounded in first quadrant

38. A set of values of decision variables which satisfies the linear constraints and nn-negativity conditions of a L.P.P. is called its

a.Optimum solution

b.None of these

c.Unbounded solution

d.Feasible solution

39. Of all the points of the feasible region for maximum or minimum of objective function the points

a.Inside the feasible region

b.At the boundary line of the feasible region

c.Vertex point of the boundary of the feasible region

d.None of these

40. Question

a.c

b.d

c.a

d.b

41. Question

a.(3, 3)

b.(3.5, 0)

c.(2, 3)

d.(7.5, 0)

42. Maximize Z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x ≥ 0, y ≥ 0.

a.60 at (4, 2)

b.48 at (4, 2)

c.62 at (4, 0)

d.44 at (4, 2)

43. Feasible region in the set of points which satisfy

a.None of these

b.The objective functions

c.Some the given constraints

d.All of the given constraints

44. Question

a.d

b.b

c.c

d.a

45. The minimum value of Z = 3x + 5y subjected to constraints x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0 is:

a.11

b.5

c.10

d.7

46. The objective function of a linear programming problem is:

a.A constraint

b.None of these

c.Function to be optimized

d.A relation between the variables

47. The optimal value of the objective function is attained at the points:

a.On X-axis

b.None of these

c.Corner points of the feasible region

d.On Y-axis

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 :

Relations and Functions MCQs Class 12 Chapter 1
Inverse Trigonometric Functions MCQs Class 12 Chapter 2
Matrices MCQs Class 12 Chapter 3
Determinants MCQs Class 12 Chapter 4
Continuity and Differentiability MCQs Class 12 Chapter 5
Applications of Derivatives MCQs Class 12 Chapter 6
Integrals MCQs Class 12 Chapter 7
Application of the Integrals MCQs Class 12 Chapter 8
Differential Equations MCQs Class 12 Chapter 9
Vectors MCQs Class 12 Chapter 10
Three Dimensional Geometry MCQs Class 12 Chapter 11
Multiplication Theorem Probability MCQs Class 12 Chapter 13

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

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

Class 12 Maths Chapter 12 MCQs

Submit a Comment Cancel reply

General

Important Days

CBSE School Lessons

Popular Pages