EASY
12th CBSE
IMPORTANT
Earn 100

In a LPP, the linear inequalities or restrictions on the variables are called linear .

33.33% studentsanswered this correctly

Important Questions on Linear Programming

EASY
12th CBSE
IMPORTANT
NCERT Exemplar Mathematics - Class 12>Chapter 12 - Linear Programming>EXERCISE>Q 36
In a LPP, the objective function is always _____.
EASY
12th CBSE
IMPORTANT
NCERT Exemplar Mathematics - Class 12>Chapter 12 - Linear Programming>EXERCISE>Q 37
If the feasible region for a LPP is_____ (bounded/unbounded), then the optimal value of the objective function Z=ax+ by may or may not exist.
EASY
12th CBSE
IMPORTANT
NCERT Exemplar Mathematics - Class 12>Chapter 12 - Linear Programming>EXERCISE>Q 38
In a LPP, if the objective function Z=ax+by has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same _____ value.
EASY
12th CBSE
IMPORTANT
NCERT Exemplar Mathematics - Class 12>Chapter 12 - Linear Programming>EXERCISE>Q 39
A feasible region of a system of linear inequalities is said to be _____ if it can be enclosed within a circle.
EASY
12th CBSE
IMPORTANT
NCERT Exemplar Mathematics - Class 12>Chapter 12 - Linear Programming>EXERCISE>Q 40
A corner point of a feasible region is a point in the region which is the _____ of two boundary lines.
EASY
12th CBSE
IMPORTANT
NCERT Exemplar Mathematics - Class 12>Chapter 12 - Linear Programming>EXERCISE>Q 41
The feasible region for an LPP is always a _____ polygon.
EASY
12th CBSE
IMPORTANT
NCERT Exemplar Mathematics - Class 12>Chapter 12 - Linear Programming>EXERCISE>Q 42
If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z=ax+by may or may not exist.
EASY
12th CBSE
IMPORTANT
NCERT Exemplar Mathematics - Class 12>Chapter 12 - Linear Programming>EXERCISE>Q 43
Maximum value of the objective function Z=ax+by in a LPP always occurs at only one corner point of the feasible region.