Teachoo Quiz

Short Quiz

Chapter 12 Class 12 Linear Programming | 5 questions | about 4 minutes

Attempt time 0:00
This question 0:00
Question 1 of 5
Advertisement
Question 1 of 5
CBSE Board Exam 2026
Assertion (A) : Consider a Linear Programming Problem with minimise \(\mathrm{Z}=\mathrm{x}+2 \mathrm{y}\) subject to constraints \(2 \mathrm{x}+\mathrm{y} \geq 3, \mathrm{x}+2 \mathrm{y} \geq 6\), \(\mathrm{x}, \mathrm{y} \geq 0\) which gives minimum Z at infinitely many points. The corner points of feasible region are \((0,3)\) and \((6,0)\).

Reason (R) : If two corner points produce the same minimum value of the objective function, then every point on the line segment joining the points will give the same minimum value.
Select an option to see the answer, or skip this question.
Question 2 of 5
CBSE Board Exam 2025
Assertion (A) : Every point of the feasible region of a Linear Programming Problem is an optimal solution.
Reason (R) : The optimal solution for a Linear Programming Problem exists only at one or more corner point(s) of the feasible region.
Select an option to see the answer, or skip this question.
Question 3 of 5
NCERT Exemplar
The feasible region for an LPP is shown in the Fig. 12.13. Let \(F=3 x-\) 4 y be the objective function. Maximum value of F is.
Select an option to see the answer, or skip this question.
Question 4 of 5
NCERT Exemplar
The feasible solution for a LPP is shown in Fig. 12.12. Let \(Z=3 x-\) 4 y be the objective function. (Maximum value of \(\mathrm{Z}+\) Minimum value of Z) is equal to
Select an option to see the answer, or skip this question.
Question 5 of 5
NCERT Exemplar
Corner points of the feasible region for an LPP are \((0,2),(3,0),(6\), \(0),(6,8)\) and \((0,5)\).

Let \(F=4 x+6 y\) be the objective function.
Maximum of \(\mathrm{F}-\) Minimum of \(\mathrm{F}=\)
Select an option to see the answer, or skip this question.
Stuck? Keep your progress moving.