Professional Documents
Culture Documents
1.operations Research
1.operations Research
1.operations Research
Research
Linear Programming
Problems (LPP)
determine.
Objective
optimize.
Constraints
Maximize F = 2X +
Objective function
4Y
subject to:
Constraints
X+Y5
2X - 3Y 10
Quantity of
resources
X,Y 0
Decision variables
Example
1:
Type of
work
Time
reqd. for
type A
Time
reqd. for
type B
Available
time
Cutting
104
Finishing
76
Profit/unit
Rs60/=
Rs110/=
Example
2:
Example
3:
A person requires a minimum of 10, 12
and 12 units of chemicals A, B and C
respectively for his garden. A liquid
product contains 5, 2 and 1 units of A,B
and C respectively in a jar. A dry
product contains 1, 2 and 4 units of A, B
and C respectively per carton.
10
12
12
Cost
Rs 300/=
Rs 200/=
Graphical Method
Example 1:
Maximize Z = 3X + 5Y
Subject to:
X 4
2Y 12
3X + 2Y 18
X,Y 0.
X =4
Y=6
3X + 2Y = 18
3X
+
2Y
=
X=4
18
(2,6)
Y=6
Example
2:
M1
M2
Profit per
ton (Rs
1000)
6
1
5
4
2
4
24
6
X,Y 0.
3X +2Y=12
-X +Y=1
(3,1.5)
Y=2
X +2Y=6
Example
3:
Kg per kg of feed
Protein
Fiber
Cost
(Rs/kg)
Corn
0.09
0.02
30
Soybean
0.6
0.06
90
Subject to:
Subject to:
X + Y 800
0.21X 0.3Y 0
0.03X 0.01Y
0
X,Y 0
X + Y 800
7X 10Y 0
3X Y 0
X,Y 0
3X-Y=0
7X-10Y=0
X+Y=800
Home Work
Question 1:
Maximize Z = 2000X + 300Y
Subject to:
400X + 600Y 6000
400X + 200Y 4000
X,Y 0.
Question 2:
Question 3:
Maximize Z = X +
Minimize Z = -4X + 6Y
2Y
Subject to:
Subject to:
-X + 6Y 24
X+Y 5
2X - Y 7
X - 2Y 2
X + 8Y 80
X,Y 0.
X,Y 0.
Unbounded Solution
Example:
Maximize Z = 2X + 3Y
Subject to:
-2X + Y 1
X - 2Y 3
X+Y 2
X,Y 0.
Unbounded
Solution