Linear Programming MCQ Questions for Class 12 Maths Chapter 12 with Answers

Find here the NCERT chapter-wise Multiple Choice Questions from Class 12 Mathematics book Chapter 12 Linear Programming with Answers Pdf free download. This may assist you to understand and check your knowledge about the chapters. Students also can take a free test of the Multiple Choice Questions of Linear Programming. Each question has four options followed by the right answer. These MCQ Questions are selected supported by the newest exam pattern as announced by CBSE.

NCERT MCQ Chapters for Class 12 Mathematics

Q1. Objective function of a linear programming problem is

(i) a constraint
(ii) function to be obtimized
(iii) A relation between the variables
(iv) None of these

(ii) function to be obtimized

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

(i) 35
(ii) 36
(iii) 34
(iv) none of these

(iv) none of these

Q3. In a LPP, the objective function is always

(i) Linear
(ii) Quadratic
(iii) Cubic
(iv) Biquadratic

(i) Linear

Q4. Z = 7x + y, subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0. The minimum value of Z occurs at

(i) (3, 0)
(ii) (1/2, 5/2)
(iii) (7, 0)
(iv) (0, 5)

(iv) (0, 5)

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

(i) 300
(ii) 600
(iii) 400
(iv) 800

(ii) 600

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

(i) on X-axis
(ii) on Y-axis
(iii) which are comer points of the feascible region
(iv) none of these

(iii) which are comer points of the feascible region

Q7. The corner points of the bounded feasible region of a LPP are A(0,50), B(20, 40), C(50, 100) and D(0, 200) and the objective function is Z = x + 2y. Then the maximum value is

(i) 400
(ii) 250
(iii) 450
(iv) 100

(i) 400

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

(i) a constant
(ii) a function to be optimised
(iii) a relation between the variables
(iv) none of these

(ii) a function to be optimized

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

(i) Have solution for positive x and y
(ii) Have no solution for positive x and y
(iii) Have solution for all x
(iv) Have solution for all y

(i) Have solution for positive x and y

Q10. Region represented by x ≥ 0, y ≥ 0 is

(i) first quadrant
(ii) second quadrant
(iii) third quadrant
(iv) fourth quadrant

(i) first quadrant

Q11. A feasible solution to a linear programming problem

(i) Must satisfy all of the problem’s constraints simultaneously
(ii) Need not satisfy all of the constraints, only the non-negativity constraints
(iii) Must be a corner point of the feasible region
(iv) Must give the maximum possible profit

(i) Must satisfy all of the problem’s constraints simultaneously

Q12. minimize f = 6x + 10y subject to constraints x ≥ 6, y ≥ 2, 2x + y ≥ 10, x ≥ 0, y ≥ 0” redundant constraints are

(i) x ≥ 6, y ≥ 2
(ii) 2x + y ≥ 10, x ≥ 0, y ≥ 0
(iii) x ≥ 6
(iv) none of these

(ii) 2x + y ≥ 10, x ≥ 0, y ≥ 0

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

(i) 44 at (4, 2)
(ii) 60 at (4, 2)
(iii) 62 at (4, 0)
(iv) 48 at (4, 2)

(ii) 60 at (4, 2)

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

(i) 220
(ii) 300
(iii) 230
(iv) none of these

(i) 220

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

(i) highest value of z
(ii) lowest value of z
(iii) mid values of z
(iv) mean values of z

(i) highest value of z

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

(i) 44 at (4, 2)
(ii) 60 at (4, 2)
(iii) 62 at (4, 0)
(iv) 48 at (4, 2)

(ii) 60 at (4, 2)

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

(i) 20 at (1, 0)
(ii) 30 at (0, 6)
(iii) 37 at (4, 5)
(iv) 33 at (6, 3)

(iii) 37 at (4, 5)

Q18. Maximize Z = 10×1 + 25×2, subject to 0 ≤ x1 ≤ 3, 0 ≤ x2 ≤ 3, x1 + x2 ≤ 5.

(i) 80 at (3, 2)
(ii) 75 at (0, 3)
(iii) 30 at (3, 0)
(iv) 95 at (2, 3)

(iv) 95 at (2, 3)

I Think the given NCERT MCQ Questions for class 12 Maths book Chapter 12 Linear Programming with Answers Pdf free download will assist you. If you’ve got any queries regarding CBSE Class 12 Maths Linear Programming MCQs Multiple Choice Questions with Answers, drop a comment below and that we will come back to you soon.

MCQ Questions for Class 12 Mathematics Chapter wise with Answers

Leave a Comment