TODAY:Daily Quiz LIVE (Earn +50 XP)
All Mock TestsPYQsLeaderboardDaily QuizRewardsStart Free

Classes

Class 10Class 12

School Exams

All boards
GetMyMockTest
Login

Class 12 Maths: Linear Programming — Chapter Test 1

Class 12 • Maths • Linear Programming • Chapter Test

MediumFREE

15

Questions

20 min

Duration

15

Marks (1 each)

No

Negative marking

Original practice questions with full solutions by ExamPortal.

Instructions

  • • Read each question carefully and pick the correct answer.
  • • You can mark questions for review and come back to them.
  • • Answers are saved automatically.
  • • The test is submitted automatically when time runs out.

Access

This test is completely free.

Finish it to earn +5 points.

Take as Guest (Instant Start)Login to Track Rank
SYLLABUS & QUESTION BLUEPRINT

Sample Practice Questions

Preview 5 sample questions from this 15-question test. Test your knowledge below or take the full exam in timed CBT mode.

Start Guest Test
Question 1 of 15
In a linear programming problem, the function to be maximised or minimised is called the:
A
constraint
B
objective function
C
feasible region
D
decision variable
View Correct Answer & Step-by-Step Solution
Correct Option:(B)objective function

Detailed explanation is available inside the official test attempt review.

Question 2 of 15
The feasible region of an LPP is the region that satisfies:
A
only the objective function
B
all the constraints
C
no constraints
D
only non-negativity
View Correct Answer & Step-by-Step Solution
Correct Option:(B)all the constraints

Detailed explanation is available inside the official test attempt review.

Question 3 of 15
The optimal value of the objective function (if it exists) occurs at:
A
the centre of the feasible region
B
a corner point of the feasible region
C
the origin always
D
any interior point
View Correct Answer & Step-by-Step Solution
Correct Option:(B)a corner point of the feasible region

Detailed explanation is available inside the official test attempt review.

Question 4 of 15
Non-negativity constraints are:
A
x ≤ 0, y ≤ 0
B
x ≥ 0, y ≥ 0
C
x = y
D
x + y = 0
View Correct Answer & Step-by-Step Solution
Correct Option:(B)x ≥ 0, y ≥ 0

Detailed explanation is available inside the official test attempt review.

Question 5 of 15
Maximise Z = 3x + 2y subject to x + y ≤ 4, x ≥ 0, y ≥ 0. The maximum value is:
A
8
B
12
C
10
D
6
View Correct Answer & Step-by-Step Solution
Correct Option:(B)12

Detailed explanation is available inside the official test attempt review.

Want to practice all 15 questions under exam conditions?

Experience real CBT interface, live countdown timer, question palette, and get your instant All-India rank & percentile.

Take as Guest (Instant Start)Login to Track Rank

Try next

Class 12 • MathsFREE

Class 12 Maths: Relations and Functions — Chapter Test 1

Chapter Test • Relations and Functions

Medium15 Qs20 minStart
Class 12 • MathsFREE

Class 12 Maths: Inverse Trigonometric Functions — Chapter Test 1

Chapter Test • Inverse Trigonometric Functions

Medium15 Qs20 minStart
Class 12 • MathsFREE

Class 12 Maths: Matrices — Chapter Test 1

Chapter Test • Matrices

Medium15 Qs20 minStart

Frequently asked questions

How many questions are there in Class 12 Maths: Linear Programming — Chapter Test 1?

There are 15 questions to answer in 20 min. Each correct answer gives 1 mark, for a total of 15 marks.

Is there negative marking?

No. Wrong answers do not lose marks, so attempt every question.

Is this mock test free?

Yes, it is completely free. Just log in with your email to start.

What does this test cover?

It covers the chapter "Linear Programming" of Class 12 Maths. All questions are original, with a full solution for each.

Will I see my result and the solutions?

Yes. Right after you submit you get your score, accuracy, rank and percentile, and you can review every question with the correct answer and a step-by-step explanation.

Can I take this test again?

Yes, you can retake it as many times as you like and compare your scores.