Scribd
Upload
15 views

Linear Programming Problems

Uploaded by

allenjosephthomas
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
15 views

Linear Programming Problems

Uploaded by

allenjosephthomas
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Linear Programming Problems (Prepared by Jincy A J)

Questions and Answers

1. Minimise Z = −3x + 4y

subject to .

Solution:

The feasible region determined by the system of constraints,


is given below.

O (0, 0), A (4, 0), B (2, 3) and C (0, 4) are the corner points of the feasible region.

The values of Z at these corner points are given below.

Corner point Z = – 3x + 4y

O (0, 0) 0

A (4, 0) -12 Minimum


B (2, 3) 6

C (0, 4) 16

Hence, the minimum value of Z is – 12 at the point (4, 0).

2. Maximise Z = 5x + 3y

subject to .

Solution:

The feasible region determined by the system of constraints, 3x + 5y ≤ 15, 5x + 2y ≤


10, x ≥ 0, and y ≥ 0, is given below.

O (0, 0), A (2, 0), B (0, 3) and C (20 / 19, 45 / 19) are the corner points of the feasible
region. The values of Z at these corner points are given below.

Corner point Z = 5x + 3y

O (0, 0) 0
A (2, 0) 10

B (0, 3) 9

C (20 / 19, 45 / 19) 235 / 19 Maximum

Hence, the maximum value of Z is 235 / 19 at the point (20 / 19, 45 / 19).

3. Maximise Z = 3x + 2y

subject to .

Solution:

The feasible region determined by the constraints, x + 2y ≤ 10, 3x + y ≤ 15, x ≥ 0, and y ≥


0, is given below.

A (5, 0), B (4, 3), C (0, 5) and D (0, 0) are the corner points of the feasible region.

The values of Z at these corner points are given below.

Corner point Z = 3x + 2y
A (5, 0) 15

B (4, 3) 18 Maximum

C (0, 5) 10

Hence, the maximum value of Z is 18 at points (4, 3).

4. Solve the following linear programming problem graphically:

Minimise Z = 200 x + 500 y subject to the constraints:

x + 2y ≥ 10

3x + 4y ≤ 24

x ≥ 0, y ≥ 0

Solution:

Given,

Minimise Z = 200 x + 500 y … (1)

subject to the constraints:

x + 2y ≥ 10 … (2)

3x + 4y ≤ 24 … (3)

x ≥ 0, y ≥ 0 … (4)

Let us draw the graph of x + 2y = 10 and 3x + 4y = 24 as below.


The shaded region in the above figure is the feasible region ABC determined by the

system of constraints (2) to (4), which is bounded. The coordinates of corner point A,
B and C are (0,5), (4,3) and (0,6) respectively.

Calculation of Z = 200x + 500y at these points.

Corner point Value of Z

(0, 5) 2500

(4, 3) 2300← Minimum

(0, 6) 3000

Hence, the minimum value of Z is 2300 is at the point (4, 3).

5. Consider the linear programming problem;


Maximise; Z = x +y , 2x + y – 3>0, x – 2y + 1 <0, y < 3, x >0, y >0
(i) Draw its feasible region.
(ii) Find the corner points of the feasible region.
(iii) Find the corner at which Z attains its maximum.
Answer:
(ii) In the figure the shaded region ABC is the feasible region. Here the region is
bounded. The corner points are A(1, 1), B(5, 3), C(O, 3).
(iii) Given; Z = x + y

ADVERTISEMENT

Corner points Value of Z

A Z = (l)+(1) = 2

B Z = (5)+(3) = 8

C Z = (0)+(3) = 3

Since maximum value of Z occurs at B, the soluion is Z = (5) + (3) = 8.

6. Consider the LPP Minimise; Z = 200 x + 500y, x + 2y >10, 3x + 4y < 24, x > 0, y > 0
(i) Draw the feasible region.(ii) Find the co-ordinates of the comer points of the feasible
region.
(iii) Solve the LPP.
Answer:
(ii) In the figure the shaded region ABC is the fesible region. Here the region is bounded.
The corner points are 4(4, 3), 5(0, 6), C(0, 5)
(iii) Given; Z = 200x + 500y

ADVERTISEMENT

Corner
Value of Z
points

A Z = 200(4)+500(3) = 2300

B Z = 200(0)+500(6) = 3000

C Z = 200(0)+500(5) = 2500

Since minimum value of Z occurs at A, the soluion is Z = 200(4) + 500(3) = 2300.

7. Consider the linear inequalities 2x + 3y <6; 2x + y < 4; x, y > 0


(a) Mark the feasible region.
(b) Maximise the function z = 4x + 5y subject to the given constraints.
Answer:
(b) 2x + 3y = 6

X 0 2

Y 4 0

2x + y = 4

X 0 3

Y 2 0

Corner points z = 4x + 5y
0(0,0) z=0

A(2,0) 8+0=8

B(1.5, 1) 6 + 5 = 11

C(0, 2) 0 + 10 = 10

Maximum atx= 1.5, y =1


Maximum value is Z = 11

8. Consider the LPP


Maximise z = 3x + 2y
Subject to the constraints: x + 2y < 10, 3x + y <15; x, y >0
(a) Draw its feasible region
(b) Find the corner points of the feasible region
(c) Find the maximum value of Z.
Answer:

(b) The corner points 0(0,0), A(5,0), B(4,3), C(0, 5)


Z is maximum at B(4, 3), z = 18.
(c)

o (0,0) Z = 3(0)+ 2(0) = 0

A (5,0), Z= 3(5)+ 2(0) = 15

B (4,3), Z= 3(4)+ 2(3) = 18

C (0,5) Z= 3(0) + 2(5) = 10

9. Consider the linear programming problem: Maximum z = 50x + 40y


Subject to constraints:
x + 2y > 10; 3x + 4y < 24; x, y >0
(i) Draw the feasible region
(ii) Find the comer points of the feasible region
(iii) Find the maximum value of z.
Answer:

(ii) In the figure the shaded region ABC is the fesible region. Here the region is bounded. The
corner points are A(4, 3), B(0,6), C(0, 5)
(iii) Given; Z = 50x + 40y
Corner points Value of Z

A Z = 50(4)+ 40(3) = 320

B Z= 50(0)+ 40(6) = 240.

C Z= 50(0)+ 40(5) = 200

Since minimum value of Z occurs at A, the soluion is Z = 50(4) + 4(3) = 320.

10. Consider the linear programming problem: Maximum z = 4x + y


Subject to constraints: x + y < 50, 3x + y <90, y > 0
(a) Draw the feasible region
(b) Find the corner points of the feasible region
(c) Find the corner at which ‘z’ aftains its maximum value.
Answer:
(a) x + y = 50,

X 0 50

y 50 0

3x + y = 90
X 0 30

y 90 0

(b) Solving the equations we get the points as


O(0, 0) A(30, 0); B(20, 30); C(0, 50)

(c)

Vertices Z

0(0,0) 0

A(30,0) 120 maximum

B(20,30) 110
C(0,50) 50

Z attains maximum at A(30, 0)

You might also like