Challenge your friends

Try this Chapter 12 Class 12 Linear Programming quiz on Teachoo. Can you beat me?

WhatsApp Telegram

See class leaderboard →
Teachoo Quiz

Maths Linear Programming Class 12 MCQ and Assertion Questions

Short Quiz · Class 12 · Maths · CBSE

Preparing for CBSE

Class leaderboard →

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

Practise Linear Programming Class 12 with Teachoo's Short Quiz (Class 12 · Maths · CBSE). Practise these questions in a free interactive quiz with answer feedback.

Attempt time 0:00
This question 0:00
Question 1 of 5
Advertisement
Question 1 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.
Question 2 of 5
CBSE Board Exam 2025
A factory produces two products X and Y . The profit earned by selling X and Y is represented by the objective function \(\mathrm{Z}=5 x+7 \mathrm{y}\), where \(x\) and y are the number of units of X and Y respectively sold. Which of the following statement is correct?
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.. Minimum value of \(F\) is
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
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.
Stuck? Keep your progress moving.

Frequently asked questions

Who is this Linear Programming Class 12 quiz for?

This Short Quiz covers Linear Programming Class 12 for Class 12 · Maths · CBSE. Practise the questions in the interactive quiz and check your answers.

Is this quiz free?

Yes. This online quiz is free to attempt. Teachoo Black is not required to take the quiz.

How many questions will I get?

The current selection contains 5 questions. The questions and count can vary with the available question bank and grouped questions.

Can I check my answers and score?

Yes. In quiz mode, check your answer to receive feedback. Submit the quiz to review your score and answers. Full Teachoo solution links are shown where available.

Will I get the same questions when I retry?

Questions can change between attempts. Teachoo uses your previous practice when available to prioritise new questions and revision; a completely new set is not guaranteed.

Practice · Linear Programming Class 12