Teachoo Quiz

Short Quiz

Preparing for CBSE

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
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.
Question 2 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.
The Minimum value of F occurs at
Select an option to see the answer, or skip this question.
Question 3 of 5
NCERT Exemplar
Feasible region (shaded) for a LPP is shown in the Fig. 12.6.
Minimum of \(\mathrm{Z}=4 \mathrm{x}+3 \mathrm{y}\) occurs at the point
Select an option to see the answer, or skip this question.
Question 4 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 5 of 5
NCERT Exemplar
The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0).

The objective function is \(\mathrm{Z}=4 \mathrm{x}+3 \mathrm{y}\).
Compare the quantity in Column A and Column B

Column AColumn B
Maximum of Z325
Select an option to see the answer, or skip this question.
Stuck? Keep your progress moving.