myCBSEguide

Class 12 - Mathematics
Linear Programming Test 04

Question No. 1 to 5 are based on the given text. Read the text carefully and answer the questions:
Sheetal rides her car at 25 km/hr. She has to spend ₹ 2 per km on diesel and if she rides it at a faster speed of 40 km/hr, the
diesel cost increases to ₹ 5 per km. She has ₹ 100 to spend on diesel. Let she travels x kms with speed 25 km/hr and y kms with
speed 40 km/hr. The feasible region for the LPP is shown below :

1. What is the point of intersection of line l1 and l2.

a. ( −50

3
,
−40

3
)

b. ( 50

3
,
40

3
)

c. (
−50 40
, )
3 3

d. ( 40

3
,
50

3
)

2. The corner points of the feasible region shown in above graph are
a. (0, 0), ( , (0,20)
40 50
, )
3 3

b. (0, 0), (25, 0), (0, 20)

c. (0, 25), (20, 0), ( 40

3
,
50

3
)

d. (0, 0), (25, 0), ( , (0, 20)

50 40
, )
3 3

To practice more questions & prepare well for exams, download myCBSEguide App. It provides complete study
material for CBSE, NCERT, JEE (main), NEET-UG and NDA exams. Teachers can use Examin8 App to create similar
papers with their own name and logo.
3. If Z = x + y be the objective function and max Z = 30. The maximum value occurs at point
a. (25, 0)
b. (0, 0)
c. (
50 40
, )
3 3

d. (0, 20)
4. If Z = 6x - 9y be the objective function, then maximum value of Z is
a. -20
b. 150
c. 180
d. 20

Copyright © [Link]. Mass distribution in any mode is strictly prohibited.

1/8
myCBSEguide
5. If Z = 6x + 3y be the objective function, then what is the minimum value of Z?
a. 150
b. 120
c. 130
d. 0
6. In Corner point method for solving a linear programming problem the first step is to
a. Find the feasible region of the linear programming problem and determine its center points (vertices).
b. Find the infeasible regions of the linear programming problem and determine theunion of the infeasible regions
c. Find the feasible region of the linear programming problem and determine its corner points (vertices).
d. Find the infeasible region of the linear programming problem and determine its complement
7. Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective
function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to constraints
described by linear inequalities,
a. optimal value must occur at the midpoints of the corner points (vertices) of the feasible region.
b. optimal value must occur at a corner point (vertex) of the feasible region.
c. None of these
d. optimal value must occur at the centroid of the feasible region.
8. The corner points of the feasible region determined by the system of linear constraints are (0, 10), (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
a. q = 3p
b. q = 2p
c. p = q
d. p = 2q
9. The optimal value of the objective function Z = ax + by may or may not exist, if the feasible region for a LPP is
a. Unbounded
b. A circle
c. Bounded
d. A polygon
10. The objective function Z = 4 x + 3 y can be maximised subjected to the constraints 3x + 4y ≤ 24, 8x + 6y ≤ 48 , x ≤ 5 ,
y ≤ 6 ; x, y ≥ 0
a. at only one point
b. None of these
c. at two points only
d. at an infinite number of points
11. State True or False:
i. Maximum or minimum value of the objective function may or may not exist, if the feasible region is bounded.
a. True
b. False
ii. The necessary condition for third quadrant region in xy-plane is x < 0, y > 0.
a. True
b. False
12. Fill in the blanks:
a. If the feasible region R is ________, then a maximum or a minimum value of the objective function may or may not
exist.
b. The process of obtaining the optimal solution of the linear programming problem is called ________.

Copyright © [Link]. Mass distribution in any mode is strictly prohibited.

2/8
myCBSEguide
13. Solve the Linear Programming Problem graphically:
Maximize Z = - x1 + 2x2 Subject to
-x1 + 3x2 ≤ 10
x1 + x2 ≤ 6
x1 - x2 ≤ 2
x1, x2 ≥ 0
14. Maximise the function Z = 11x + 7y, subject to the constraints: x ⩽ 3, y ⩽ 2, x ⩾ 0, y ⩾ 0 .
To practice more questions & prepare well for exams, download myCBSEguide App. It provides complete study
material for CBSE, NCERT, JEE (main), NEET-UG and NDA exams. Teachers can use Examin8 App to create similar
papers with their own name and logo.
15. Show that the minimum of Z occurs at more than two points.
Maximize Z = x + y subject to x − y ≤ −1, −x + y ≤ 0, x, y ≥ 0 .
16. Show that the minimum of Z occurs at more than two points.
Maximize Z = -x + 2y subject to the constraints: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0 .

Copyright © [Link]. Mass distribution in any mode is strictly prohibited.

3/8
myCBSEguide

Class 12 - Mathematics
Linear Programming Test 04

Solution

1. (b) (
50 40
, )
3 3

Explanation: Let B(x, y) be the point of intersection of the given lines

2x + 5y = 100...(i)
y
and = 1 ⇒ 8x + 5y = 20 ...(ii)
x
+
25 40

Solving (i) and (ii), we get

,y=
50 40
x =
3 3

∴ The point of intersection B(x, y) = ( 50

3
,
40

3
)

2. (d) (0, 0), (25, 0), ( 50

3
,
40

3
) , (0, 20)
Explanation: The corner points of the feasible region shown in the given graph are
(0, 0), A(25, 0), B ( , C(0, 20).
50 40
, )
3 3

To practice more questions & prepare well for exams, download myCBSEguide App. It provides complete study
material for CBSE, NCERT, JEE (main), NEET-UG and NDA exams. Teachers can use Examin8 App to create similar
papers with their own name and logo.
3. (c) ( 50
,
40
)
3 3

Explanation: Here Z = x + y
Corner Points Value of Z = x + y

(0, 0) 0
(25, 0) 25
50 40
(
3
,
3
) 30 ← Maximum

(0, 20) 20

Thus, max Z = 30 occurs at point ( 50

3
,
40

3
) .
4. (b) 150
Explanation:
Corner Points Value of Z = 6x - 9y

(0, 0) 0

(25, 0) 150 ← Maximum

50 40
(
3
,
3
) -20

(0, 20) -180

5. (d) 0
Explanation:
Corner Points Value of Z = 6x - 9y

(0, 0) 0 ← Minimum

Copyright © [Link]. Mass distribution in any mode is strictly prohibited.

4/8
myCBSEguide
(25, 0) 150
50 40
(
3
,
3
) 140

(0, 20) 60
6. (c) Find the feasible region of the linear programming problem and determine its corner points (vertices).
Explanation: In Corner point method for solving a linear programming problem the first step is : To find the feasible
region of the linear programming problem and determine its corner points (vertices) either by inspection or by solving
the two equations of the lines intersecting at that point.
7. (b) optimal value must occur at a corner point (vertex) of the feasible region.
Explanation: Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be
the objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to
constraints described by linear inequalities then , optimal value must occur at a corner point (vertex) of the feasible
region.
8. (a) q = 3p
Explanation: Since Z occurs maximum at (15, 15) and (0, 20), therefore, 15p + 15q = 0p + 20q ⇒ q = 3p.
9. (a) Unbounded
Explanation: The optimal value of the objective function Z = ax + by may or may not exist, if the feasible region for an
LPP is unbounded. This is because the maximum or minimum value of the objective function may not exist. Even if it
exists it must occur in a corner point of the feasible region.
10. (d) at an infinite number of points
Explanation: 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). Join these points to obtain the line 3x + 4y = 24
Clearly, (0, 0) satisfies the inequation 3x + 4y ≤ 24 . So, the region in x y -plane that contains the origin represents the
solution set of the given equation. The line 8x + 6y = 48 meets the coordinate axis at C(6, 0) and D(0, 8) . Join these
points to obtain the line 8x + 6y = 48 Clearly, (0, 0) satisfies the inequation 8x + 6y ≤ 48 . So, the region in x y -plane
that contains the origin represents the solution set of the given equation.
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.
The 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 corner points of the feasible region are O(0, 0), G(5, 0), F (5, , E( and B(0, 6)
4 24 24
) , )
3 7 7

The values of Z at these corner points are as follows:

Corner point : Z = 4x + 3y
O(0, 0) : 4 × 0 + 3 × 0 = 0
G(5, 0) : 4 × 5 + 3 × 0 = 20
: 4× 5+ 3×
4 4
F (5, ) = 24
3 3

E(
24

7
,
24

7
) : 4× 24

7
+ 3×
24

7
=
196

7
= 28

B(0, 6) : 4 × 0 + 3 × 6 = 18

We see that the maximum value of the objective function z is 24 which is at F (5, and E ( Thus, the
4 24 24
) , )
3 7 7

optimal value of Z is 24
As, we know that if an LPP has two optimal solutions, then there are an infinite number of optimal solutions. Therefore,
the given objective function can be subjected at an infinite number of points.

Copyright © [Link]. Mass distribution in any mode is strictly prohibited.

5/8
myCBSEguide
11. State True or False:
i. (b) False
Explanation: False
ii. (b) False
Explanation: False
12. Fill in the blanks:
a. unbounded
b. optimisation technique
13. First, we will convert the given inequations into equations, we obtain the following equations:
- x1 + 3x2 = 10, x1 + x2 = 6, x1 + x2 = 2, x1 = 0 and x2 = 0
Region represented by - x1 + 3x2 ≤ 10 :

The line - x1 + 3 x2 = 10 meets the coordinate axes at A( - 10,0) and B (0, respectively. By joining these points we
10
)
3

obtain the line - x1 + 3x2 = 10

Clearly (0,0) satisfies the in equation - x1 + 3 x2 ≤ 10. So,the region in the plane which contain the origin represents the
solution set of the inequation - x1 + 3 x2 ≤ 10
Region represented by x1 + x2 ≤ 6:
The line x1 + x2 = 6 meets the coordinate axes at C(6,0) and D(0,6) respectively. By joining these points we obtain the
line x1 + x2 = 6 . Clearly (0,0) satisfies
the inequation x1 + x2 ≤ 6 . So, the region containing the origin represents the solution set of the inequation x1 + x2 ≤ 6
Region represented by x1 - x2 ≤ 2
The line x1 - x2 = 2 meets the coordinate axes at E(2,0) and F(0, - 2) respectively. By joining these points we obtain the
line x1 - x2 = 2. Clearly (0,0) satisfies the inequation x1 - x2 ≤ 2 . So,the region containing the origin represents the
solution set of the inequation x1 - x2 ≤ 2
Region represented by x1 ≥ 0 and x2 ≥ 0 since, every point in the first quadrant satisfies these inequations. So, the first
quadrant is the region represented by the inequations x1 ≥ 0 and x2 ≥ 0
The feasible region determined by subject to the constraints are- x1 + 3 x2 ≤ 10, x1 + x2 ≤ 6, x1 - x2 ≤ 2, and the non-
negative restrictions , x1 ≥ 0, and x2 ≥ 0, are as follows.

The corner points of the feasible region are O(0,0), E(2,0), H(4, 2) , G(2,4) and B(0, 3.33)
The values of objective function Z = - x1 + 2x2

At the corner points are as follows:

O(0, 0) :−1 × 0 + 2 × 0 = 0

E(2,0) :−1 × 2 + 2 × 0 = −2
H(4, 2) :−1 × 4 + 2 × 2 = 0
G(2, 4) :−1 × 2 + 2 × 4 = 6

: −1 × 0 + 2 ×
10 10 20
B (0, ) =
3 3 3

We see that the optimal value of the objective function Z is 20

3
which is at B (0, 10

3
) .

Copyright © [Link]. Mass distribution in any mode is strictly prohibited.

6/8
myCBSEguide
14. Maximise Z = 11x + 7y, subject to the constraints x ⩽ 3, y ⩽ 2, x ⩾ 0, y ⩾ 0 .

The shaded region as shown in the figure as OABC is bounded and the coordinates of corner points are (0, 0), (3, 0), (3,
2), and (0, 2), respectively.
Corner Points Corresponding value of Z
(0, 0) 0
(3, 0) 33

(3, 2) 47 (Maximum)
(0, 2) 14
Hence, Z is maximise at (3, 2) and its maximum value is 47.
15. Consider x − y ⩽ −1
Let x - y = -1⇒ x = y − 1
A B C D
x -1 0 2 3

y 0 1 2 4
If (0, 0) is the test point then x − y ⩽ −1 ⇒ 0 ⩽ −1 which is false and thus the required plane does not include (0, 0).
Again −x + y ⩽ 0
Let -x + y = 0⇒ y = x

O E F
x 0 1 2
y 0 1 2
For (1, 0) – 1 ⩽ 0 which is true, therefore the required half-plane include (1, 0).

It is clear that the two required half planes do not intersect at all, i.e., they do not have a common region.
Hence there is no maximum Z.
To practice more questions & prepare well for exams, download myCBSEguide App. It provides complete study
material for CBSE, NCERT, JEE (main), NEET-UG and NDA exams. Teachers can use Examin8 App to create similar
papers with their own name and logo.

Copyright © [Link]. Mass distribution in any mode is strictly prohibited.

7/8
myCBSEguide
16. Consider x ⩾ 3
Let x = 3 which is a line parallel to y-axis at a positive distance of 3 from it.

Since x ⩾ 3, therefore the required half-plane does not contain (0, 0).
Now consider x + y ⩾ 5

Let x + y = 5
x y
⇒ + = 1
5 5

Now (0, 0) does not satisfy x + y ⩾ 5 , therefore the required half plane does not contain (0, 0).
Again consider x + 2y ⩾ 6 .
Let x + 2y = 6
x y
⇒ + = 1
6 3

Here also (0, 0) does not satisfy x + 2y ⩾ 6 , therefore the required half plane does not contain (0, 0).
The corners of the feasible region are A (6, 0), B (4, 1) and C (3, 2).
At A (6, 0) Z = –6 + 2 × 0 = –6
At B (4, 1) Z = –4 + 2 × 1 = –2
At C (3, 2) Z = –3 + 2 × 2 = 1
Hence, maximum Z = 1 at x = 3, y = 2.

Copyright © [Link]. Mass distribution in any mode is strictly prohibited.

8/8