0% found this document useful (0 votes)
5 views

Linear Programming

The document presents solutions to several linear programming problems using the graphical method. Each problem involves maximizing or minimizing an objective function subject to a set of constraints, with detailed calculations of corner points and evaluations of the objective function at these points. The final results indicate the optimal values for the variables in each case, along with the maximum or minimum values of the objective function.

Uploaded by

shindejay024
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views

Linear Programming

The document presents solutions to several linear programming problems using the graphical method. Each problem involves maximizing or minimizing an objective function subject to a set of constraints, with detailed calculations of corner points and evaluations of the objective function at these points. The final results indicate the optimal values for the variables in each case, along with the maximum or minimum values of the objective function.

Uploaded by

shindejay024
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Solve the following L.P.P.

by graphical method :
1. Maximize :z=1lx+ 8y subiect to y<4. y<6.x+ys6,x2 0,y 20.
Solution:
Corner point method:
To draw the feasible region,
constuct 1able as follows:
Inequality xS4 ys6 xtys6
Corresponding equation (of line)
Intersection of line with X-axis
X=4 y=6 x ty=6
(4, 0) (6, 0)
Intersection of line with Y-axis (0, 6) (0, 6)
Region Origin side Origin side Origin side
Shaded portion OABC is the feasible region,
whose vertices are O(0, 0), A(4, 0), B
C0, 6). and
Bis the point of
intersection of the lines x = 4 y=6
and x + y=6 C(0, 6)
Substituting x= 4 in xty=6,we get
y=2 5
B=(4,2)
Here,the objective function is Z=1lx+ 8y
Zat O(0, 0) = 11(0) + 8(0) = 0 3
Zat A(4, 0) = 11(4) + 8(0) =44 B(4, 2)
Zat B(4, 2) = 11(4) + 8(2) = 44 + 16= 60
Z at C(0, 6) = 11(0) + 8(6) =48
Z has maximum value 60 at B(4, 2)
A(4, 0)
Zis maximum, when x=4 and y=2. 7

x=4 x+y=6

2. Maximize : z=4x+ 6y subject to 3x +2y s12,x +y24, x, y>0.


Solution:
The draw the feasible region, construct table as follows:

Inequality 3x+ 2y s 12 x+y>4


Corresponding equation (of line) 3x+2y =12 xty=4 B(0, 6)
Intersection of line with X-axis (4, 0) (4, 0)
Intersection of line with Y-axis (0, 6) (0,4)
C(0,
Region Origin side Non-origin side
3x+ 2y =12
Shaded portion ABCis the feasible region, 2
whose vertices are A(4, 0), B(0, 6), C(0, 4). xty=4
Here, the objective function is Z= 4x + 6y
Zat A(4, 0) = 4(4) + 6(0) = 16
X
1 2 3
A4,0)
5 Xi
7
Zat B(0, 6) = 4(0) + 6(6) = 36
Zat C(0, 4) = 4(0) + 6(4) = 24 Y
Z has maximum value 36 at B(0, 6)
Zis maximum. when x = 0 and y= 6
>0, y20.
3. Maximize:=7x + 11ysubject to 3r + 5y <26, 5x+ 3y< 30, x
Solution:
The draw the feasible region, construct table as follows:

3r +5y S 26 5x + 3ys 30
Inequality
3r +5y -26 5x +3y = 30
Corresponding cquation (of line)
(6, 0)
Intersection of line with X-axis

(0, 10)
Intersection of line with Y-axis

Origin side Origin side


Region
26
vertices are O(0, 0), A(6, 0), B and C|0,
Shaded portionOABC is the feasible region, whose 5

Bis the point of intersection of the lines


Sx + 3y =30 and 3x*+ 5y = 26.
Solving the above equations, we get
9
X=
9+

B=
(45, 2.5) 8

Here, the objective function is Z=7x+ 11y


tco, 26
Zat O(0, 0) =7(0) + 11(0) =0
5
Z at A(6, 0) = 7(6) + 11(0)= 42
63 + 55
Zat B
33)-13-)-: 286
= 59
B
9 5
2 2)
Zat ( c|a-70,+1 5
= 57.2 I
1
Z has mmaximum value 59 atB : .
1 2 3 4 5
SA6,0
6 7 10
’XI

i.e. at B(4.5, 2.5) 3x+ 5y = 26


9 5 5x + 3y = 30
Z is maximum, when x = and y =
2
i.e. when x = 4.5 and y = 2.5

4. Maximize : z= 10x +25y subject to 0sxs3, 0sys3,x+ys5 also find maximum value of z.
Solution:
To draw the feasible region, constructtable as follows:

Inequality xS3 ys3 Xtys5


Corresponding equation (of line) x=3 y=3 Xty=5
Intersection of line with X-axis (3, 0) (5, 0)
Intersection of line with Y-axis (0,3) (0,5)
Region Origin side Origin side Origin side
Shaded portion OABCD is the feasible region,
whose vertices are O(0, 0), A(3, 0), B, Cand D(O, 3)
the point of intersection of the lines x = 3and
Bis r=3
xty=5.
get
Substituting x = 3in x+y= 5, we
y=2
B=(3,2)
intersection of the lines y 3and
Cisthe point of
rty=5. C(23) +y=3
Substituting y =3inxty=5, we get D(0, 3)
r=2 B3,2)
C=(2, 3)
Z= 10x +25y
Here. the objective function is
0
Zat O(0. 0) = 10(0) + 25(0) = o2 4
Zat A(3.0) = 10(3)+ 25(0) =30
30 +.50 = 80
ZatB(3. 2) = 10(3) + 25(2)=
25(3)= 20 + 75 =95
ZatC(2. 3)= 10(2)+
Zat D(0, 3) = 10(0) + 25(3) = 75
Zhas maximum value 95 at C(2, 3).
Z is maximum, when x=2 and y =3.

maximum
5.
Maximize: z =3x + 5y subject to x+ 4y S 24, 3x +y<21, x+y<9, x>0, y>0 also find
value of z. [Mar 19; Jul 16]
Solution:
To draw the feasible region, construct table as follows:

Inequality x+ 4y s 24 3x +ys21 xtys9


Corresponding equation (of line) xt 4y = 24 3x+ y= 21 x+y=9
Intersection of line with X-axis (24, 0) (7,0) (9,0)
Intersection of line with Y-axis (0, 6) (0, 21) (0,9)
Region Origin side Origin side Origin side

Shaded portion OABCD is the feasible


region, whose vertices are O(0, 0),
A(7, 0), B, C and D0, 6)
B is the point of intersection of the 24
lines 3x +y= 21 andx+y=9.
Solving the above equations,we get 21
X=6,y =3 3xty=21
18
B= (6,3)
Cis the point of intersection of the 15
linesx + 4y = 24
and x+y =9. 12
Solving the above equations, we get
X=4, y=5
C=(4,5)
Here, the objective function is C4, 5)
Z= 3x + 5y AB6,3+
3
Zat O(0, 0) = 3(0) + 5(0) =0
Zat A(7, 0) = 3(7) + 5(0) =21 A(,0) + +
Z at B(6, 3) = 3(6) + 5(3) 3 6 12 15 18 21 24
- 18+ 15=33 x+4y =24
Zat C(4, 5)= 3(4) + 5(5)
= 12 + 25 =37 xty=9
Z.at D(0, 6) = 3(0) + 5(6) = 30
Zhas maximum value 37 at C(4, 5).
Zismaximum, when x=4, y=5
6. 18]
Minimize :z=7x+ysubject to 5r +y> 5, x+ty 23, x> 0, y20.
Solution:
To draw the feasible region, construct table as follows: xty23
Inequality 5x +y> 5
x+y=3
Corresponding equation (of line) 5x+ y= 5
Intersection of line with X-axis (1, 0) (3,0)
Intersection of line with Y-axis (0, 5) (0, 3)
Non-origin side Non-origin side
Region
Shaded portion XABCY is the feasible region, whose
vertices are A(3.0), B andC (0, 5).
Bisthe point of intersection of the lines x ty=3
and 5x ty=5
Solving the above equations, we get
1 5C(0, 5

B=
Here,the objective function is Z=7x+y 2t
Z at A(3. 0) =7(3) +0 =21
5
1t
Z at B
2 2
=6
X'+
2
A(3,0Ml
4 5 6
’X

Zat C(0, 5) =7(0)+ 5=5


Z has minimum value 5at C(0, 5).
Zis minimum, when x=0 and y=5. Y' 5xty=5 x+y =3
[Note:Answer given in textbook is Maximum at (0, 5), 5".
However. we found that Z has minimum value 5 at (0, 5)'.]

7. Minimize :z= 8x +10y subject to 2x+y>7,2x+ 3y >15,y 22, x>0,y 20. [July 19]
Solution:
Todraw the feasible region, construct table as follows:
Inequality 2r + y>7 2x +3v 15
Corresponding equation (of line) 2x ty=7 2x + 3y= 15 y=2
Intersection of line with X-axis

Intersection of line with Y-axis (0,7) (0, 5) (0,2)


Region Non-origin side Non-origin side Non-origin side
Shaded portion EABCY is the feasible region,
whose vertices are A, B and C(0, 7)
A is the point of intersection of the lines y = 2 and
2x +3y =15
Subtituting y=2 in 2x + 3y = 15, we get 7C(0, 7)
2r +6 = 15
9
X=
2

A=
34
Bis the point of intersection of the lines 2x ty =7 E,
and 2x + 3y = 15. y=2
Solving the above equations, we get 1
3 X<
x= =4 X

B--(1.5,) 2x +y=7
2r+3y |5 |
Solution: 52
value INote: atNote:
Z= C= To 5, atZB
Z Z Z Zat Here, Solving x+Cis x=2,Solving
=
y Shaded
the isB Intersection
Region Intersection
Inequality Minimize (1.Answer 7 has Z zat
is Zat AHere,
22.Answer
5 Zmc-6) is has at Corresponding draw
ZuA(4, 6x 2y= the 4)']minimum,minimum C(0, objectivethe
minimum,minimum D(0,
tthe = portion
B2)-62) the point thepoint the given
] at 3) 0)21y
objective and 3 2 1 G)-) 7)
given above6 above z=: =
= 12+ = = of of of feasible 8(0)+
6(0) 6(4) 3x+y=3. XABCDY of 6x inwhen
intersection intersection line line value
inwhen value
equations,
equation "Maximum
+textbook at
equations, function
textbook + 221 +
function with with region, 21ly x 10(7) +
x 21(0)
+ +
21(3) = 52 10(4)
10(2)=36
= 22.5 21 2 45 21 Y-axis subject 3
2 1 is
X-axis (of
is i.e at =
22-5 = B: construct B4]ie. is
at = 4) = is line) 70 =
is and 63 24 we of we ofthe 1.5 3 Z
ximum
-(-})
the the 12
get getfeasible to =
=: y 18 and + + 8x
2 1 lines lines 40
+ table +x 20 +
2y3,x y
= = 10y
126 region,x
Non-origin side at 52 =
+ x+
=3
Zyx+
2y3 as 4.(1.5, 56
at 4y (1.5,
(2, =4
(30)
, follows:
144 4)
5 whose (o2) + 4),
0.5), 4y
=
and However, 52".
22.5". 28.8 2
>
3KD(0, 3) vertices x+ 4,3x
2y
wever, =3
Non-origin
side +y3,
ty=3 3x
c3 are
3'3) x+
=4
xt4y
4y>4
6 A(4, (0,1)(4, 0) we
x found
we 0), >0,y>0.
2
found B, that
and C it
that A(4; is
=3
x+
2y Non-origin
D(0, side
it 3x
3 Z
+y=3 3x+y has
is 3). (0,3)(1,0)
Z
minimum
has
imum x+
4y
4
+X value

You might also like