Operations Research

Linear Programming Example:

_ Let the following LP problem
Maximize Z=25$ X+ 40$ Y
s.to:
2X + 3Y ≤ 240 Constraint A
5X + Y ≤ 450 Constraint B
X ≥ 40 Constraint C
X,Y ≥ 0
Solve the Problem using graphical method?
The Solution:
1- Graph all the constraints and find the feasible region :
Constraint A :
2X+3Y = 240 ….. (A)
X=0 2(0) +3Y = 240 3y =240 3y/3 = 240/3
Y = 80 (0,80)
Y=0 2x + 3(0) =240 2x=240 2x/2= 240/2
X=120 (120,0)
Y

(0,80) b c

a d X
(120,0)
Constraint B:
5X + Y = 450
X=0 5(0) +y =450 (0,450)
Y=0 5x + 0 = 450 5X/5 = 450/5 x=90 ( 90 , 0)
Constraint C:
X = 40
2- Find the corner points of feasible region:
a(40,0)
b(40,y)
c(x,y)
d(90,0)
b (40, 53.33)
2x+3y = 240
x=40
2(40)+3y=240
80+3y =240
80+3y-80=240-80
3y=160
Y=160/3=53.33
C: 2x+3y=240
-3×(5x+y=450)
-15x-3y=-1350
2x+3y=240 +
-13x+0= -1110 -13x/-13= -1110/-13
X =85.38
2(85.38)+3y= 240
170.76+3y=240
3y=69.24
Y=23.08
C(85.38,23.08)
3- Find the optimal solution(point that result maximum profit)
Point Profit x ( 25$) Profit y (40$) Total profit
a(40,0) 1,000 0 1,000$
b(40, 53.33) 1,000 2,133.2 3,133.2$ Max
Profit
C(85.38 , 23.08) 2,134.5 923.2 3,057.7 $
d(90,0) 2,250 0 2,250$

Maximum profit = 3,133.2$

X=40
Y=53.33