Solution

LPP

Class 12 - Mathematics
1. Here,it is given that x + 2 y = 8 ...(1)
2x + y = 2 ...(2)
x - y = 1 ...(3)
Line (1) shaded area and origin lie on the same sides of x + 2 y = 8 Corresponding inequations is x + 2y ≤ 8 ,Now we have also
Line (2) shaded area and origin lie on the opposite side of 2x + y = 2
The corresponding inequation is 2x + y ≥ 2
Line (3) shaded area and origin lie on the same side of x - y =1
Corresponding inequation is x - y < 1
shaded area on right side of y - axis.
Corresponding inequation is y > 0
Therefore, the linear constraints are x ≥ 0, y ≥ 0, 2x + y ≥ 2, x − y ≤ 1 and x + 2y ≤ 8

2. we have minimise Z=400x + 200y subject to 5x + 2y⩾ 30.

2x + y ⩾ 15, x ⩽ y, x ⩾ 0, y ⩾ 0

On solving x-y=0 and 5x+2y=30, we get

30 30
y = ,x =
7 7

On solving x - y = 0 and 2x + y = 15 we get x = 5, y = 5

30 30
So, from the shaded feasible region it is clear that coordinates of corner points are (0,15) , (5,5) and ( 7
,
7
) .

Corner Points Corresponding value of X = 400x + 200y

(0, 15) 3000

(5, 5) 3000
30 30 30 30 18000
( , ) 400 × + 200 × =
7 7 7 7 7

= 2571.43 (minimum)
Hence, the minimum is Rs 2571.43.
3. We have linear constraints as
x + 2y ≥ 100

2x − y ≤ 0

2x + y ≤ 200

x ≥ 0, y ≥ 0

1 / 13
and objective function is min or max (Z) = x + 2y
Now, reducing the above inequations into equations and finding their point of intersections i.e.,
x + 2y = 100 ...(i)

2x − y = 0 ...(ii)
2x + y = 200 ...(iii)
x = 0, y = 0 ...(iv)

Equations Point of Intersection

(i) and (ii) x = 20 and y = 40

⇒ point is(20, 40)

(i) and (iii) x = 100 and y = 0

⇒ point is (100, 0)

(i) and (iv) whenx = 0 ⇒ y = 50

⇒ point is (0, 50)

when y = 0 ⇒ x = 100

⇒ point (100, 0)

(i) and (iii) x = 50, y = 100

⇒ point is (50, 100)

(i) and (iv) x = 0, y = 0

⇒ point is (0, 0)

(i) and (iv) when x = 0 ⇒ y = 200

⇒ point is (0, 200)

when y = 0, x = 100

⇒ point is (100, 0)
Now for feasible region, using origin testing method for each constraint
For x + 2y ≥ 100 , let x = 0, y = 0
⇒ 0 ≥ 100 i.e., true ⇒ the shaded region will be away from the origin
For 2x + y ≤ 200 , let x = 0, y = 0
⇒ 0 ≤ 200 i.e., true ⇒ The shaded region will be toward the origin.

Also, non-negative restrictions x ≥ 0, y ≥ 0 indicates that the feasible region will be exist in first quadrant.
Now, corner points are A(0, 50), B(20, 40), C (50, 100) and D(0, 200)

For optimal solution substituting the value of all comer points in Z = x + 2y

Corner points Z = x + 2y

A(0, 50) Z = 0 + 2 × 50 = 100 Minimum

2 / 13
 B(20, 40) Z = 20 + 2 × 40 = 100

C (50, 100) Z = 50 + 2 × 100 = 250

D(0, 200) Z = 0 + 2 × 200 = 400 → Maximum

Hence, minimum (Z) = 100 at all points on the line segment joining the points A(0, 50) and B(20, 40) : Maximum (Z) = 400 at (0,
200)
4. We have Z = 400x + 300y subject to
x + y ≤ 200, x ≤ 40, x ≥ 20, y ≥ 0
The comer points of the feasible region are
C(20, 0) D(40, 0), B(40, 160), A(20, 80)

Corner Points Z = 400x + 30y

C(20, 0) 8,000

D(40, 0) 16,000

B(40, 160) 64,000

A(20, 180) 62,000

Maximum profit occurs at x = 40 and y = 160 and the maximum profit = ₹ 64,000
5. 2x - y ≥ - 5
3x + y ≥ 3
2x - 3y ≤ 12
x ≥ 0, y ≥ 0
The feasible region of the system of inequations given in constraints is shown in a figure. We observe that the feasible region is
unbounded.

The values of the objective function Z at the comer points are given in the following table:
Corner point (x, y) Value of the objective function Z = -50x + 20y

(0,5) Z = - 50 × 0 + 20 × 5 = 100

(0,3) Z = - 50 × 0 + 20 × 3 = 60

3 / 13
 (1,0) Z = - 50 × 1 + 20 × 0 = - 50

(6,0) Z = -50 × 6 + 20 × 0 = - 300

Clearly, - 300 is the smallest value of Z at the corner point (6, 0). Since the feasible region is unbounded, therefore, to check
whether - 300 is the minimum value of Z, we draw the line - 300 = -50x + 20y and check whether the open half plane -50 x + 20y
< -300 has points in common with the feasible region or not. From Fig., we find that the open half plane represented by - 50 x +
20y < - 300 has points in common with the feasible region. Therefore, Z = - 50x + 20y has no minimum value subject to the given
constraints.
6. We need to maximize Z = 4x + 3 y
First, we will convert the given inequations into equations, we obtain the following equations and solving we get the values are as
follows:
3x + 4 y = 24, 8x + 6 y = 48,x = 5, y = 6, x = 0 and y = 0
The line 3x + 4 y = 24 meets the coordinate axis at A(8,0) and B(0,6). Join these points to obtain the line 3x + 4 y = 24 Clearly, (0,
0) satisfies the inequation 3x + 4 y ≤ 24.50, the region in xy-plane that contains the origin represents the solution set of the given
equation.
The line 8 x+ 6 y = 48 meets the coordinate axis at C(6,0) and D(0,8). Join these points to obtain line 8 x+ 6 y = 48. 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
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 non negative restrictions ,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, 4

3
) , E( 24

7
,
24

7
) and B(0, 6), The values of objective function Z
at these corner 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 4
F (5, ) 4 × 5 + 3 × = 24
3 3

24 24 24 24 196
E( , ) 4 × + 3 = = 24
7 7 7 7 7

24 24 196
B(0, 6) 4 ×
7
+ 3
7
=
7
= 24

We see that the maximum value of the objective function z is 24 which is at F (5, 4

3
) and E ( 24

7
,
24

7
)

Thus, the optimal value of objective function z is 24.

7. First, we will convert the given inequations into equations, we obtain the following equations:
4x + y = 20, 2x + 3y = 30,x = 0 and y = 0
Region represented by 4x + y ≥ 20 :
The line 4x + y = 20 meets the coordinate axes at A(5,0) and B(0,20) respectively. By joining these points we obtain the line 4x +
y = 20
Clearly (0,0) does not satisfies the inequation 4x + y ≥ 20 .
So, the region in xy plane which does not contain the origin represents the solution set of the inequation 4x + y ≥ 20

4 / 13
 Region represented by 2x + 3y ≥ 30 :
The line 2x + 3y=30 meets the coordinate axes at C(15,0) and D(0,10) respectively. By joining these points we obtain the line 2x
+ 3y=30 .
Clearly (0,0) does not satisfies the inequation 2x + 3y ≥ 30 . So, the origin does not contain represents the solution set of the
inequation 2x + 3y ≥ 30.
Region represented by x ≥ 0 and y ≥ 0 : graph will be in first quadrant
since every point in the first quadrant satisfies these inequations. So, the first quadrant is the region represented by the in
equations x ≥ 0, and y ≥ 0 The feasible region determined by the system of constraints, 4x + y ≥ 20,2x + 3y ≥ 30,x ≥ 0, and y
≥ 0, are as follows.

The corner points of the feasible region are B(0,20), C(15,0), E(3,8) and C(15,0)
The values of Z at these corner points are as follows.
The value of objective function at the corner point : Z = 18x + 10y
B(0, 20) : 18 × 0 + 10 × 20 = 200
E(3, 8) : 18 × 3 + 10 × 8 = 134
C(15, 0) : 18 × 15 + 10 × 0 = 270
Therefore, the minimum value of Z is 134 at the point E(3,8) . Hence, x = 3 and y = 8 is the optimal solution of the given LPP.
Thus, the optimal value of objective function Z is 134.
8. 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 :
10
The line - x1 + 3 x2 = 10 meets the coordinate axes at A( - 10,0) and B (0, 3
) respectively. By joining these points we 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.

5 / 13
 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
B (0,
10

3
) : −1 × 0 + 2 × 10

3
=
20

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

3
which is at B (0, 10

3
) .

9.

Correct graph
Value of z at corner points
z(A) = 3(0) + 9(20) = 180
z(B) = 0 + 90 = 90
z(C) = 15 + 45 = 60
z(D) = 45 + 45 = 180
Max(z) = 180 at any point on AD
10. First, we will convert the given inequations into equations, we obtain the following equations:
5x + y = 10, x + y = 6, x + 4y = 12, x = 0 and y = 0
Region represented by 5x + y ≥ 10 :
The line 5x + y = 10 meets the coordinate axes at A(2,0) and B(0,10) respectively. By joining these points we obtain the line 5x +
y = 10. Clearly (0,0) does not satisfies the inequation 5x + y ≥ 10 . So, the region in x y plane which does not contain the origin
represents the solution set of the inequation 5x + y ≥ 10 Region represented by x + y ≥ 6 :
The line x + y = 6 meets the coordinate axes at C(6,0) and D(0,6) respectively. By joining these points we obtain the line 2 x + 3 y
= 30. Clearly (0,0) does not satisfies the inequation x + y ≥ 6 . So, the region which does not contain the origin represents the
solution set of the inequation 2 x + 3 y ≥ 30 Region represented by x + 4y ≥ 12 The line x + 4y = 12 meets the coordinate axes at
E(12,0) and F(0,3) respectively. By joining these points we obtain the line
x + 4y = 12 . Clearly (0,0) does not satisfies the inequation x + 4y ≥ 12 . So, the region which does not contain the origin
represents the solution set of the inequation x + 4y ≥ 12 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 x ≥ 0, and y ≥ 0. The feasible region determined by subject to the constraints are 5x + y ≥ 10, x + y ≥ 6, x + 4y ≥
12, and the non-negative restrictions xx ≥ 0, and y ≥ 0, are as follows.

6 / 13
 The corner points of the feasible region are B(0,10), G(1,5), H(4,2) and E(12,0)
The values of objective function Z at these corner points are as follows.
Corner point Z = 3x + 2y
B(0, 10) : 3 × 0 + 3 × 10 = 30
G(1, 5) : 3 × 1 + 2 × 5 = 13
H(4, 2) : 3 × 4 + 2 × 2 = 16
B(12, 0) : 3 × 12 + 2 × 0 = 36
Therefore, the minimum value of Z is 13 at the point G(1,5) . Hence, x = 1 and y = 5 is the optimal solution of the given LPP.
The optimal value of objective function Z is 13.
11. We first convert the inequations into equations to obtain the lines 5x + y = 100, x + y = 60, x = 0 and y = 0.
The line 5x + y = 100 meets the coordinate axes at A1 (20, 0) and B1 (0,100). Join these points to obtain the line 5x + y = 100.
The line x + y = 60 meets the coordinate axes at A2 (60, 0) and B2 (0, 60). Join these points to obtain the line x + y = 60.
Also, x = 0 is the y-axis and y = 0 is the x-axis.
The feasible region of the LPP is shaded in a figure. The coordinates of the comer-points of the feasible region OA1PB2 are O (0,
0), A1 (20, 0), P (10,50) and B2 (0, 60).

Now, we take a constant value, say 300 (i.e. 2 times the l.c.m. of 50 and 15) for Z. Then,
300 = 50x + 15y
This line meets the coordinate axes at P1 (6, 0) and Q1 (0, 20). Join these points by a dotted line. Now, move this line parallel to
itself in the increasing direction i.e. away from the origin. P2Q2 and P3Q3 are such lines. Out of these lines locate a line that is
farthest from the origin and has at least one point common to the feasible region.
Clearly, P3Q3 is such line and it passes through the vertex P (10, 50) the convex polygon OA1PB2. Hence, x = 10 and y = 50 will
give the maximum value of Z.
The maximum value of Z is given by
Z = 50× 10 + 15× 50 = 1250.
12. Converting the given inequations into equations, we get
2x + 3y = 6, x - 2y = 2, 3x + 2y = 12, - 3x + 2y = 3, x = 0 and y = 0

7 / 13
 Region represented by - 2x - 3y ≤ - 6:
The line - 2x - 3y = - 6 or, 2x + 3y = 6 cuts OX and OY at A1 (3, 0) and B1 (0, 2) respectively. Join these points to obtain the line
2x + 3y - 6 = 0.
Since O (0, 0) does not satisfy the inequation - 2x - 3y ≤ - 6.
So, the region represented by - 2x - 3y ≤ - 6 is that part of XOY-plane which does not contain the origin.
Region represented by x - 2y ≤ 2:
The line x - 2y = 2 meets the coordinate axes at A2 (2, 0) and B2 (0, -1 ).
Join these points to obtain x - 2y = 2. Since (0,0) satisfies the inequation x - 2y ≤ 2, so the region containing the origin represents
the solution set of this inequation.
Region represented by 3x + 2y ≤ 12:
The line 3x + 2y ≤ 12 intersects OX and OY at A3 (4, 0) and B3 (0, 6).
Join these points to obtain the line 3x + 2y = 12. Clearly, (0, 0) satisfies the inequation 3x + 2y ≤ 12.
So, the region containing the origin is the solution set of the given inequations.
Region represented by - 3x + 2y ≤ 3:
The line - 3x + 2y = 3 intersects OX and OY at A4 (- 1, 0) and B4 (0, 3/2). Join these points to obtain the line - 3x + 2y = 3.
Clearly, (0, 0) satisfies this inequation. So, the region containing the origin represents the solution set of the given inequation.
Region represented by x ≥ 0, y ≥ 0:
Clearly, XOY quadrant represents the solution set of these two inequations.
The shaded region shown in a figure represents the common solution set of the above inequations. This region is the feasible
region of the given LPP.

18 7 3 3 15
The coordinates of the corner-points (vertices) of the shaded feasible region P1 P2 P3 P4 are P1( 7
, 2

7
), P2( ,
2 4
), P3( ,
2 4
) and
P4( 3

13
, 24

13
).
These points have been obtained by solving the equations of the corresponding intersecting lines, simultaneously.
The values of the objective function at these points are given in the following table:
Point (x, y) Value of the objective function Z = 5x + 2y
18 2
P1( 7
, 7
) Z=5×
18

7
+2×
2

7
=
94

7 3
P2( , 2 4
) Z=5×
7

2
+2×
3

4
= 19
3 15
P3( , 2 4
) Z=5×
3

2
+2×
15

4
= 15
3 24
P4( 13
, 13
) Z=5×
3

13
+2×
24

13
=
63

13

3 24 7 3 63
Clealy, Z is minimum at x = 13
and y = 13
and maximum at x = 2
and y = 4
. The minimum and maximum values of Z are 13

and 19 respectively.
13. For plotting the graphs of x + 3y = 3 and x + y = 2, we have the following tables:
x 0 3

y 1 0

x 1 0

y 1 2

8 / 13
 The feasible portion represented by the inequalities
x + 3y ⩾ 3, x + y ⩾ 2 and x, y ⩾ 0 is represented by the shaded region ,

In the figure. The coordinates of point B are ( 3

2
,
1

2
)

Which can be obtained by solving x + 3y = 3 and x + y = 2.

At A(0, 2)
Z = 3 × 0 + 5 × 2 = 10

3 1
At B ( 2
,
2
)

3 1 9 5 14
Z = 3 × + 5 × = + = = 7
2 2 2 2 2

At C (3, 0)
Z = 3 × 3 + 5 × 0 = 9
3 1
Hence, Z is minimum is 7 when x = 2
and y = 2
.
14. Consider x + 2y ⩽ 120
Let x + 2y = 120
x y
⇒ + = 1
120 60

The half plane containing(0, 0) is the required half plane as (0, 0) makes x + 2y ⩽ 120 , true.
x 0 30 60

y 60 45 30

Again x + y ⩾ 60
Let x + y = 60
Also the half plane containing (0, 0) does not make x + y ⩾ 60 true.
Therefore, the required half plane does not contain (0, 0).
Again x − 2y ⩾ 0
Let x - 2y = 0 ⇒ x = 2y
Let test point be (30, 0).
x 0 30 60

y 0 15 30
⇒ x − 2y ⩾ 0 ⇒ 30 − 2 × 0 ⩾ 0 It is true.
Therefore, the half plane contains (30, 0).
The region CFEKC represents the feasible region.

9 / 13
 At C (60, 0) Z = 5 × 60 = 300
At F (120, 0) Z = 5 × 120 = 600
At E (60, 30)Z = 5 × 60 + 10 × 30 = 600
At K (40, 20) Z = 5 × 40 + 10 × 20 = 400
Hence, minimum Z = 300 at x = 60, y = 0 and maximum Z = 600 at x = 120, y = 0 or x = 60, y = 30.
15. 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.
16. We have,
Maximize, z = 5x + 2y
subject to the constraints:
x – 2y ≤ 2
3x + 2y ≤ 12
– 3x + 2y ≤ 3
x ≥ 0, y ≥ 0

Corner Points Values of z

3
(0,
2
) 3 ← Min. Value
3 15
(
2
,
4
) 15
7 3
(
2
,
4
) 19 ← Max. Value

10 / 13
 (2, 0) 10
7 3
Hence, the maximum value of z is 19 at ( 2
,
4
)

3
And, the minimum value of z is 3 at (0, 2
)

17. First, we will convert the given inequations into equations, we obtain the following equations:
2x + 3y = 13, 3x + y = 5, x = 0 and y = 0
Region represented by 2 x + 3 y ≤ 13 :
The line 2 x + 3 y=13 meets the coordinate axes at
A(
13

2
, 0) and B (0, 13

3
) respectively. By joining these points we obtain the line 2x + 3y = 13
Clearly (0,0) satisfies the inequation 2 x + 3 y ≤ 13 . So, the region containing the origin represents the solution set of the
inequation 2 x + 3 y ≤ 13
Region represented by 3 x + y ≤ 5 :-
The line 3x +y = 5 meets the coordinate axes at
C (
5

3
, 0) and D(0, 5) respectviely. By joining these points we obtain the line 3x + y = 5
Clearly (0,0) satisfies the inequation 3x + y ≤ 5 . So, the region containing the origin represents the solution set of the inequation
3x + y ≤ 5
Region represented by x ≥ 0 and y ≥ 0 is the 1st quadrant.
The feasible region determined by the system of constraints, 2 x + 3 y ≤ 13,3 x + y ≤ 5, x ≤ 0, and y ≤ 0, are shown in the
shaded portion of the graph.

The corner points of the feasible region are O(0,0)

C (
5

3
, 0) E (
2

7
,
29

7
) and B (0, 13

3
)

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

We see that the maximum value of the objective function Z is 15 which is at C
Corner point Z = 9x + 3y

O(0, 0) 9×0+3×0=0
5 5
C ( , 0) 9 × + 3 × 0 = 15
3 3

2 29 2 29
E( , ) 9 × + 3 × = 15
7 7 7 7

13 13
B (0, ) 9 × 0 + 3 × = 113
3 3

5 2 29
(
3
, 0) and E ( 7
,
7
) Thus, the optional value of z is 15.
18. Consider x + 2y ⩽ 10
Let x + 2y = 10
x y
⇒ + = 1
10 5

11 / 13
 Since, (0, 0) satisfies the inequation, therefore the half plane containing (0, 0) is the required plane.
Again 3x + 2y ⩽ 15
Let 3x + y = 15
x y
⇒ + = 1
5 15

It also satisfies by (0, 0) and its required half plane contains (0, 0).
Now double shaded region in the first quadrant contains the solution.
Now OABC represents the feasible region.
Z = 3x + 2y
At O (0, 0) Z = 3 × 0 + 2 × 0 = 0
At A (5, 0) Z = 3 × 5 + 2 × 0 = 15
At B (4, 3) Z = 3 × 4 + 2 × 3 = 18
At C (0, 5) Z = 3 × 0 + 2 × 5 = 10

Hence, Z is maximum i.e., 18 at x = 4, y = 3.

19. Given equation : 3x + 5y = 15
Let's draw the graph for this.
15−5y
⇒ x =
3

Take y = 3, x = 0
And take y = 0, x = 5
x 0 5

y 3 0
The same way for equation 5x + 2y = 10 , the points will be (2, 0) and (0, 5).
x 2 0

y 0 5
As (0, 0) satisfies both the inequations and also x ⩾ 0, y ⩾ 0, hence the feasible required equation contains the half-plane
containing (0, 0).
∴ the feasible portion is OABC. This is shown as shaded in the graph.

12 / 13
 20 45
Co-ordinates of point B will be obtained by solving 3x + 5y = 15 and 5x + 2y = 10 and it is B( 19
,
19
) .
20 45
Thus, co-ordinates of O, A, B and C are (0, 0), (2, 0), ( 19
,
19
) and (0, 3).
Z = 5x + 3y = 0 (if x = 0, y = 0)
Z = 5 × 2 + 3 × 0 = 10 (if x = 2, y = 0)
Z = 5 ×
20

19
+ 3 ×
45
=
19
235

19
(if x = , y =
20

19
45

19
)
Z = 5 × 0 + 3 × 3 = 9 (if x = 0, y = 3)
Hence, Z = 235

19
is maximum when x = 20

19
,y =
45

19
..
20. Given,
Objective function, Maximize z = 3x + 5y
subject to the constraints
x + 2y ≤ 2000, x + y ≤ 1500, y ≤ 600, x ≥ 0 and y ≥ 0
Now, draw the line x + 2y = 2000, x + y = 1500, and y = 600

and shaded region is the feasible region satisfied by above inequalities. Here, the feasible region is bounded.
Now,
Corner points (x,y) Z =3x+5y
(0,0) 0
(1500,0) 3.1500+5.0=4500
(1000,500) 3.1000+5.500=5500
(0,500) 0+500.5=2500
Hence the maximum value of z is 5500, which occurs at A(1000, 500)

13 / 13