Intuition Education classes

1387, sec 11-12 HUDA , N.H.B.C panipat

Test / Exam Name: Ch-12 Lpp Standard: 12th Science Subject: Mathematics
Student Name: Section: Roll No.:
Questions: 29 Time: 01:00 hh:mm Negative Marks: 0 Marks: 29

Q1. Directions: In the following questions, the Assertions (A) and Reason(s) (R) have been put 1 Mark
forward. Read both the statements carefully and choose the correct alternative from the
following:
Assertion (A): The maximum value of Z = 11x + 7y Subject to the constraints are
2x + y ≤ 6, x ≤ 2, x,y ≥ 0.x,y 0. Occurs at the point (0,6).

Reason (R): If the feasible region of the given LPP is bounded, then the maximum and minimum
values of the objective function occurs at corner points.
A Both A and R are true and R is the correct B Both A and R are true but R is NOT the
explanation of A correct explanation of A
C A is true but R is false. D A is false but R is true.
Ans: A Both A and R are true and R is the correct explanation of A
Q2. The feasible, region for an LPP is shown shaded in the figure. Let Z = 3x - 4y be the 1 Mark
objective function. A minimum of Z occurs at:

IR
BH
M
A
G

1. (0, 0)
2. (0, 8)
L

3. (5, 0)
U

4. (4, 10)
H

A (0, 0) B (0, 8) C (5, 0) D (4, 10)

Ans: B (0, 8)
RA

Q3. The objective function of LPP defined over the convex set attains its optimum value at. 1 Mark
A Atleast two of the corner points. B All the corner points.
C Atleast one of the corner points. D None of the corner points.
Ans: C Atleast one of the corner points.
Solution:
Let Z = ax + by be the objective function
When Z has optimum value(maximum or minimum), where the variables
x and y are subject to constraints described by linear inequalities, this optimum value must occur
at a corner points of the feasible region.
Thus, the function attains its optimum value at one of the corner points.
Q4. The region represented by the inequation system x, y ≥ 0, y ≤ 6, x + y ≤ 3 is: 1 Mark
A Unbounded in first quadrant. B Unbounded in first and second quadrants.
C Bounded in first quadrant. D None of these.
Ans: C Bounded in first quadrant.
Solution:
Converting the given inequations into equations, we obtain
y = 6, x + y = 3, x = 0 and y = 0
y = 6 is the line passing through (0, 6) and parallel to the X axis.
 The region below the line y = 6 will satisfy the given inequation.
The line x + y = 3 meets the coordinate axis at A(3, 0) and B(0, 3).
Join these points to obtain the line x + y = 3
Clearly, (0, 0) satisfies the inequation x + y = 3.
So, the region in xy-plane that contains the origin represents the solution set of the given
equation.
Region represented by x = 0 and y = 0:
Since, every point in the first quadrant satisfies these inequations.
So, the first quadrant is the region represented by the inequations.
These lines are drawn using a suitable scale.

The shaded region represents the feasible region of the given LPP, which is bounded in the first
quadrant.
Q5. Which of the following statements about an LP problem and its dual is false? 1 Mark

IR
A If the primal and the dual both have optimal B If one of the variables in the primal has
solutions, the objective function values for unrestricted sign, the corresponding
BH
both problems are equal at the optimum. constraint in the dual is satisfied with
equality.
M
C If the primal has an optimal solution, so has D The dual problem might have an optimal
the dual. solution, even though the primal has no
A

(bounded) optimum.
Ans:
G

D The dual problem might have an optimal solution, even though the primal has no (bounded)
L

optimum.
U

Solution:
If one of the problems (primal, dual) is infeasible then the other problem is infeasible.
H

Q6. In order for a linear programming problem to have a unique solution, the solution must exist. 1 Mark
RA

A At the intersection of the nonnegativity B At the intersection of a nonnegativity

constraints. constraint and a resource constraint.
C At the intersection of the objective function D At the intersection of two or more
and a constraint. constraints.
E None of the above.
Ans: D At the intersection of two or more constraints.
Solution:
In order for a linear programming problem to have a unique solution, the solution must exist at
the intersection of two or more constraints.
Then the problem becomes convex and has a single optimum (maximum or minimum).
Q7. Minimize Z = 20x1 + 9x2, subject to x ≥ 0, x ≥ 0, 2x + 2x ≥ 36, 6x + x ≥ 60.
1 2 1 2 1 2 1 Mark
A 360 at (18, 0) B 336 at (6, 4) C 540 at (0, 60) D 0 at (0, 0)
Ans: B 336 at (6, 4)
Q8. In Graphical solution the feasible solution is any solution to a LPP which satisfies. 1 Mark
A Only objective function. B Non - negativity restriction.
C Only constraint. D All the three
Ans: B Non - negativity restriction.
Solution:
 The feasible region is the set of all the points that satisfy all the given constraints.
The variables of the linear programs must always take the non - negative values (i.e., x ≥ 0 and
y ≥ 0).

These are used because x and y are usually the number of items produced and we cannot produce
the negative number of items.
The least possible number of items could be zero.
Therefore, the feasible solution should satisfy the non - negativity restriction.
Q9. What is the solution of x ≤ 4, y ≥ 0 and x ≤ −4, y ≥ 0? 1 Mark
A x ≥ −4, y ≤ 0 B x ≤ 4, y ≥ 0
C x ≤ −4, y = 0 D x ≥ −4, y = 0
Ans: C x ≤ −4, y = 0
Solution:
x ≤ 4 and x ≤ −4

⇒ x ≤ −4

Also, y ≥ 0 and y ≤ 0
⇒ y = 0

Hence the solutione is x ≤ −4, y = 0.

Q10.The objective function Z = 4x + 3y can be maximised subjected to the constraints 3x + 4y ≤ 24, 1 Mark
8x + 6y ≤ 48, x ≤ 5, y ≤ 6, x, y ≥ 0
A At only one point. B At two points only.
C At an infinite number of points. D None of these.
Ans: C At an infinite number of points.

IR
Solution:
We need to maximize Z = 4x + 3y BH
First, we will convert the given inequations into equations, we obtain the following equations: 3x
+ 4y = 24, 8x + 6y = 48, x = 5, y = 6, x = 0 and y = 0.
The line 3x + 4y = 24 meets the coordinate axis at A(8, 0) and B(0, 6).
M

Join these points to obtain the line 3x + 4y = 24.

Clearly, (0, 0) satisfies the inequation 3x + 4y = 24.
A

So, the region in xy-plane that contains the origin represents the solution set of the given
G

equation.
The line 8x + 6y = 48 meets the coordinate axis at C(6, 0) and D(0, 8).
L

Join these points to obtain the line 8x + 6y = 48.

U

Clearly, (0, 0) satisfies the inequation 8x + 6y = 48.

So, the region in xy plane that contains the origin represents the solution set of the given
H

equation.
RA

x = 5 is the line passing through x = 5 parallel to the Y axis.

y = 6 is the line passing through y = 6 parallel to the X axis.
Region represented by x = 0 and y = 0:
Since, every point in the first quadrant satisfies these inequations.
So, the first quadrant is the region represented by the inequations.
These lines are drawn using a suitable scale.
and B (0,6).
The corner points of the feasible region are O(0, 0), G(5, 0),
and B(0, 6).
The values of Z at these corner points are as follows.

We see that the maximum value of the objective function Z is 24 which is at F(5, 4) and
Thus, the optimal value of Z is 24.
As, we know that if a LPP has two optimal solution, then there are an infinite number of optimal
solutions.
Therefore, the given objective function can be subjected at an infinite number of points.
Q11.If the constraints in a linear programming problem are changed: 1 Mark
A Solution is not defined. B The objective function has to be modified.
C The problems is to be re - evaluated. D None of these.
Ans:
C The problems is to be re - evaluated.
Q12.Z = 20x1 + 20x2, subject to x1 ≥ 0, x 2 ≥ 0, x1 + 2x2 ≥ 8, 3x1 + 2x2 ≥ 15, 5x1 + 2x2 ≥ 20. 1 Mark
The minimum value of Z occurs at
A (8, 0) B (
5
,
15
)
2 4

C (
7
,
9
)
D (0, 10)
2 4

Ans: C (
7
,
9
)
2 4

Q13.Consider the objective function Z = 40x + 50y The minimum number of constraints that are 1 Mark
required to maximize Z are:
A4 B2 C3 D1
Ans: C 3
Solution:
Since in the given function Z = 40x + 50y, two variables are used.
So, the two constraints will be x ≥ 0, y ≥ 0 and the third one will be of the type
ax + by ≥ c.

Hence, at least 3 constraints are required.

Q14.A linear programming of linear functions deals with: 1 Mark
A Minimizing B Optimizing C Maximizing D None
Ans: B Optimizing
Q15.The optimal value of the objective function is attained at the points: 1 Mark

IR
A On X - axis B On Y - axis
C Corner points of the feasible region D None of these BH
Ans: C Corner points of the feasible region
Solution:
M

Any point in the feasible region that gives the optimal value (maximum or minimum) of the
objective function is called an optimal solution.
A

Q16.Directions: In the following questions, the Assertions (A) and Reason(s) (R) have been put 1 Mark
G

forward. Read both the statements carefully and choose the correct alternative from the
following:
L

Assertion (A): :Consider the linear programming problem. Maximise Z = 4x + y Subject to

U

constraints x + y ≤ 50; x + y ≥ 100 and x, y ≥ 0, Then, maximum value of Z is 50.

Reason (R): If the shaded region is bounded then maximum value of objective function can be
H

determined.
RA

A Both A and R are true and R is the correct B Both A and R are true but R is NOT the
explanation of A correct explanation of A
C A is true but R is false. D A is false but R is true.
Ans: D A is false but R is true.
Q17.The corner points of the feasible region determined by the system of linear constraints are (0, 10), 1 Mark
(5, 5), (25, 20) and (0, 30). Let Z = px + qy, where p, q > 0. Condition on p and q so that the
maximum of Z occurs at both the points (25, 20) and (0, 30) is _______.
A 5p = 2q B 2p = 5q C p = 2q D q = 3p
Ans: A 5p = 2q
Solution:
Maximum of Z occurs at (25, 20) and at (0, 30).
Hence, equating the vales of Z at these points, we get 25p + 20q = 30q
∴ 5p = 2q

This is the required relation.

Also as p, q > 0, the value of Z is always positive and hence, is greater at (25, 20) and at (0,
30) than at (0,10) and (5, 5).
Q18.The corner points of the feasible region determined by the following system of linear 1 Mark
inequalities:
2x + y ≤ 10, x + 3y ≤ 15, x, y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5).
 Let Z = px + qy, where p.q > 0.
Condition on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is:
A P=q B p = 2q C p = 3q D q = 3q
Ans: D q = 3q
Solution:
The maximum value of Z is unique.
It is given that the maximum value of Z occurs at two points (3, 4) and (0,5).
Value of Z at (3, 4) = Value of Z at (0,5)
= p(3) + q(4) = p(0) + 7(5)
= 3p + 4q = 5q
= q = 3p
Q19.Directions: In the following questions, the Assertions (A) and Reason(s) (R) have been put 1 Mark
forward. Read both the statements carefully and choose the correct alternative from the
following:
Assertion (A): For the constraints of a LPP problem given by
x + 2x ≤ 2000, x + x ≤ 1500, x ≤ 600 and x , x ≥ 0 the points (1000, 0), (0, 500), (2, 0)
2
1 2 1 2 1 2

lie in the positive bounded region, but point (2000, 0) does not lie in the positive boundedregion.
Reason (R):

IR
A Both A and R are true and R is the correct B Both A and R are true but R is NOT the
explanation of A correct explanation of A
BH
C A is true but R is false. D A is false but R is true.
Ans: A Both A and R are true and R is the correct explanation of A
Q20.The value of objective function is maximum under linear constraints: 1 Mark
M

A At the centre of feasible region. B At (0, 0)

A

C At any vertex of feasible region. D The vertex which is maximum distance

G

from (0, 0)
Ans: C At any vertex of feasible region.
L

Solution:
U

In linear programming problem we substitute the coordinates of vertices of feasible region in the
H

objective function and then we obtain the maximum or minimum value.

Therefore, the value of objective function is maximum under linear constraints at any vertex of
RA

feasible region.
Q21.Maximize Z = 6x + 4y, subject to x ≤ 2, x + y ≤ 3, −2x + y ≤ 1, x ≥ 0, y ≥ 0. 1 Mark
A 12 at (2, 0) B 16 at (2, 1)
C at ( , )
140 2 1 D 4 at (0, 1)
3 3 3

Ans: C 140
at ( 2
,
1
)
3 3 3

Q22.The corner points of the feasible region determined by the system of linear constraints are (0, 10), 1 Mark
(5, 5), (15, 15), (0, 20). Let Z = px + qy, where p, q > 0. Condition on p and q so that the
maximum of Z occurs at both the points (15, 15) and (0, 20) is Maximum of Z occurs at:
A (5, 0) B (6, 5) C (6, 8) D (4, 10)
Ans: A (5, 0)
Q23.The solution set of the inequation 2x + y > 5 is:​​ 1 Mark
A Half plane that contains the origin. B Open half plane not containing the origin.
C Whole xy-plane except the points lying on D None of these.
the line 2x + y = 5
Ans: B Open half plane not containing the origin.
Solution:
 On putting x = 0, y = 0 in the given inequality, we get 0 > 5, which is absurd.
Therefore, the solution set of the given inequality does not include the origin.
Thus, the solution set of the given inequality consists of the open half plane not containing the
origin.
Q24.Objective function of a L.P.P. is: 1 Mark
A A constant B A function to be optimised
C A relation between the variables D None of these

Ans: B A function to be optimised

Q25.The solution set of the inequation 3x + 2y > 3 is: 1 Mark
A Half plane not containing the origin B Half plane containing the origin
C The point being on the line 3x + 2y = 3 D None of these
Ans: A Half plane not containing the origin
Q26.Which of the following is not true about feasibility? 1 Mark
A It cannot be determined in a graphical B It is independent of the objective function.
solution of an LPP.
C It implies that there must be a convex D Extreme points of the convex region gives
region satisfying all the constraints. the optimum solution.
Ans: A It cannot be determined in a graphical solution of an LPP.
Solution:
There are various methods to solve the linear programming problems namely simplex method,
ellipsoid method, graphical method, interior points method, etc.

IR
Therefore a linear programming problem can be solved using the graphical method.
Hence, the feasibility of the linear programming problem can be determined by the graphical
BH
method.
Q27.In linear programming, objective function and objective constraints are: 1 Mark
A Solved B Linear C Quadratic D Adjacent
M

Ans: B Linear
A

Solution:
G

In linear programming, objective function and objective constraints are linear.

Any linear programming problem must have the following properties:-
L

The relationship between variables and constraints must be linear.

U

The constraints must be non-negative.

objective function must be linear.
H

Q28.Directions: In the following questions, the Assertions (A) and Reason(s) (R) have been put 1 Mark
RA

forward. Read both the statements carefully and choose the correct alternative from the following
Assertion (A): The graph of x ≤ 2 and y ≥ 2 will be situated in the first and second quadrants.
Reason (R):

A Both A and R are true and R is the correct B Both A and R are true but R is NOT the
explanation of A correct explanation of A
C A is true but R is false. D A is false but R is true.
Ans: D A is false but R is true.
Q29.To write the dual; it should be ensured that 1 Mark
1. All the primal variables are non - negative.
2. All the bi values are non - negative.
 3. All the constraints are ≤ type if it is maximization problem and ≥ type if it is a minimization
problem.
A I and II B II and III C I and III D I, II and IIl
Ans: C I and III
Solution:
To write the dual, then all the primal variables must be non-negative.
All the constraints are ≤ type if it ia maximization problem and ≥ type if it is a minimization
problem.

IR
BH
M
A
G
L
U
H
RA