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. Question

a.b

b.a

c.d

d.c

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

a.Mid values of Z

b.Lowest value of Z

c.Mean values of Z

d.Highest value of Z

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

a.Objective function

b.A constraint

c.Decision variables

d.None of these

4. 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.Feasible solution

b.Unbounded solution

c.Optimum solution

d.None of these

5. 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, 3)

b.(0, 5)

c.(6, 0)

d.(1, 0)

6. Question

a.(3.5, 0)

b.(2, 3)

c.(3, 3)

d.(7.5, 0)

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

a.On Y-axis

b.Corner points of the feasible region

c.None of these

d.On X-axis

8. Question

a.The quantity in column B is greater

b.The two quantities are equal

c.The quantity in column A is greater

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

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

a.Function to be optimized

b.A relation between the variables

c.None of these

d.A constraint

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

a.(2,3)

b.(1,2)

c.(-2,3)

d.(2,1)

11. Question

a.a

b.b

c.c

d.d

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

a.16

b.None of these

c.12

d.14

13. Feasible region in the set of points which satisfy

a.Some the given constraints

b.All of the given constraints

c.The objective functions

d.None of these

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

a.10

b.7

c.5

d.11

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

a.48 at (4, 2)

b.60 at (4, 2)

c.62 at (4, 0)

d.44 at (4, 2)

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

a. Third quadrant

b.Fourth quadrant

c.First quadrant

d.Second quadrant

17. 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.400

b.800

c.600

d.300

18. A feasible solution to an LP problem,

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

b.Must optimize the value of the objective function.

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

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

19. 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.(4.5, 2)

b.(0, 7)

c.(1.5, 4)

d.(7, 0)

20. Question

a.95 at (2, 3)

b.75 at (0, 3)

c.80 at (3, 2)

d.30 at (3, 0)

21. 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.100

c.160

d.140

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

a.16 at (4, 0)

b.24 at (6, 0)

c.24 at (0, 4)

d.36 at (0, 6)

23. 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.32

d.40

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

a.48 at (4, 2)

b.60 at (4, 2)

c.62 at (4, 0)

d.44 at (4, 2)

25. Question

a.(5, 0)

b.(0, 8)

c.(6, 10)

d.(0, 0)

26. 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.82

d.70

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

a.At the boundary line of the feasible region

b.Inside the feasible region

c.Vertex point of the boundary of the feasible region

d.None of these

28. 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.2x + y ≥ 10, x ≥ 0, y ≥ 0

d. x ≥ 6, y ≥ 2

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

a.30 at (0, 6)

b.33 at (6, 3)

c.37 at (4, 5)

d.20 at (1, 0)

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

a.40

b.36

c.30

d.None of these

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

a.Diet Problem

b.Transportation problesm

c.All of the above

d.Manufacturing problem

32. Question

a.360 at (18, 0)

b.0 at (0, 0)

c.336 at (6, 24)

d.540 at (0, 60)

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

a.300

b.230

c.220

d.None of these

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

a.A constraint

b.A Function to be optimized

c.None of these

d.A relation between the variables

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

a.Have solution for all y

b.Have solution for all x

c.Have solution for positive x and y

d.Have no solution for positive x and y

36. 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.33 at (6, 3)

c.37 at (4, 5)

d.30 at (0, 6)

37. Question

a.c

b.b

c.a

d.d

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

a.On X-axis

b.Which are corner points of the feascible region

c.On Y-axis

d.None of these

39. 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.Feasible solution

b.Optimum solution

c.None of these

d.Unbounded solution

40. Objective function of a linear programming problem is

a.A constraint

b.Function to be optimized

c.A relation between the variables

d.None of these

41. In a LPP, the objective function is always

a.Linear

b.Quadratic

c.Biquadratic

d.Cubic

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

a.None of these

b.unbounded in first and second quadrant

c.unbounded in first quadrant

d.bounded in first quadrant

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

a.34

b.None of these

c.36

d.35

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

a.(2, 3)

b.(2, 1)

c.(1, 2)

d.(-3, 2)

45. Which of the following statements is correct ?

a.Every LP problem has a unique solution.

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

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

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

46. Question

a.b

b.c

c.d

d.a

47. Question

a.30 at (3, 0)

b.95 at (2, 3)

c.75 at (0, 3)

d.80 at (3, 2)

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