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
In the graph, the feasible region representing the Linear Programming Problem for maximising objective function \(\mathrm{Z}=\mathrm{px}+\mathrm{qy}, \mathrm{p}, \mathrm{q}>0\) is shaded. If all points on segment AB give max (Z), then which of the following is true?
Select an option to see the answer, or skip this question.
Question 2 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 3 of 5
NCERT Exemplar
The feasible solution for a LPP is shown in Fig. 12.12. Let \(Z=3 x-\) 4y be the objective function. Maximum of Z occurs at
Select an option to see the answer, or skip this question.
Question 4 of 5
NCERT Exemplar
The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Let \(\mathrm{Z}=\mathrm{px}+\) qy, where \(\mathrm{p}, \mathrm{q}>0\). Condition on p and q so that the maximum of Z occurs at both the points \((15,15)\) and \((0,20)\) is
Select an option to see the answer, or skip this question.
Question 5 of 5
CBSE Board Exam 2024
Of the following, which group of constraints represents the feasible region given below?
Select an option to see the answer, or skip this question.
Stuck? Keep your progress moving.