OPTIMIZATION

TECHNIQUES
PRESENTED BY
HARSHA VARDHAN GB (12U218)
JANARANJANI P (12U219)
JEYASURIYAKANTH R (12U220)
JOTHI PRIYA B (12U221)
KARTHIKEYAN R (12U222)
KAVYA S (12U223)
MOHAMMED MUDASSER A (13U437)

1
PROBLEM 1







A fertilizer mixing plant produces two fertilizers A and B, by mixing two chemicals C1 and C2 in
different proportions. The contents and costs of two chemicals are as follows:




Fertilizer A should not contain more than 60% ammonia and B should contain atleast 50% of
ammonia. On the average, the plant can sell upto 1000 lb/hr and due to limitations on the
production facilities, not more than 600 lb of fertilizer A can be produced per hour. The
availability of chemical C1 is restricted to 500 lb/hr. assuming that the production are same for
both A and B, determine the quantities of A and B to be produced per hour for maximum return
if the plant sells A and B at the rates of $6 and $7 per pound, respectively.









Chemical Ammonia Phosphorus Cost ($/lb)
C1 0.70 0.30 5
C2 0.40 0.60 4
2
Modelling the LPP:
x
1
Amt of chemical C1 in fertilizer A
x
2
Amt of chemical C2 in fertilizer A
y
1
Amt of chemical C1 in fertilizer B
y
2
- Amt of chemical C2 in fertilizer B
x
1
+ x
2
- Total amt of A produced per hour
y
1
+ y
2
- Total amt of B produced per hour
Determining the objective function:
f = selling price cost of chemicals C1 and C2
= 6(x
1
+ x
2
) + 7(y
1
+ y
2
) 5(x
1
+ y
1
) 4(x
2
+ y
2
)
= x
1
+ 2x
2
+ 2y
1
+ 3y
2

3
Determining the constraints:
i. Total amount that can be sold,
(x
1
+ x
2
) + (y
1
+ y
2
) 1000
ii. Availability of C1,
x
1
+ y
1
500
iii. Production limitations of A,
x
1
+ x
2
600
iv. A should not contain more than 60% of ammonia,
0.7x
1
+ 0.4x
2
0.6 (x
1
+ x
2
)
x
1
-2x
2
0
v. B should contain atleast 50% ammonia,
0.7y
1
+ 0.4y
2
0.5 (y
1
+ y
2
)
-2y
1
+ y
2
0

4
By using simplex method to solve the LPP,
Maximize, f = x
1
+ 2x
2
+ 2y
1
+ 3y
2
subject to the constraints
(x
1
+ x
2
) + (y
1
+ y
2
) 1000
x
1
+ y
1
500
x
1
+ x
2
600
x
1
-2x
2
0
-2y
1
+ y
2
0, x
1
, x
2
, y
1
, y
2
0

By assigning slack and surplus variables inorder to remove the inequalities, the LPP becomes
Maximize, f = x
1
+ 2x
2
+ 2y
1
+ 3y
2
subject to the constraints
(x
1
+ x
2
) + (y
1
+ y
2
) + s
1
= 1000
x
1
+ y
1
+ s
2
= 500
x
1
+ x
2
+ s
3
= 600
x
1
-2x
2
+ s
4
= 0
-2y
1
+ y
2
+ s
5
= 0, x
1
, x
2
, y
1
, y
2
0

5
Initial table:
f = x
1
+ 2x
2
+ 2y
1
+ 3y
2
+ 0s
1
+ 0s
2
+ 0s
3
+ 0s
4
+ 0s
5















6
C
j
1 2 2 3 0 0 0 0 0
C
B
Basis b x
1
x
2
y
1
y
2
s
1
s
2
s
3
s
4
s
5
Min
ratio
(b/y
2
)
0 s
1
1000 1 1 1 1 1 0 0 0 0 1000
0 s
2
500 1 0 1 0 0 1 0 0 0
0 s
3
600 1 1 0 0 0 0 1 0 0
0 s
4
0 1 -2 0 0 0 0 0 1 0 0
0 s
5
0 0 0 -2 1 0 0 0 0 1 0
Z
j
0 0 0 0 0 0 0 0 0
C
j
- Z
j
1 2 2 3 0 0 0 0 0
Entering variable = y
2
Leaving variable = s
1
First iteration table: R
5
R
5
- R
1















7
C
j
1 2 2 3 0 0 0 0 0
C
B
Basis b x
1
x
2
y
1
y
2
s
1
s
2
s
3
s
4
s
5

3 y
2
1000 1 1 1 1 1 0 0 0 0
0 s
2
500 1 0 1 0 0 1 0 0 0
0 s
3
600 1 1 0 0 0 0 1 0 0
0 s
4
0 1 -2 0 0 0 0 0 1 0
0 s
5
-1000 -1 -1 -3 0 -1 0 0 0 1
Z
j
3 3 3 3 3 0 0 0 0
C
j
- Z
j
-2 -1 -1 0 -3 0 0 0 0
Since all the C
j
Z
j
are either negative or zero, the optimum solution is reached,
y
2
= 1000 y
1
= 0
s
2
= 500 x
1
= 0
s
3
= 600 x
2
= 0
s
4
= 0
s
5
= -1000
By substituting the obtained values in the objective function,
The maximum value is found to be 3000



8
PROBLEM 2
Ozark Farms uses at least 800 lb of special feed daily. The daily feed is a mixture of corn and soybean
with the following compositions:



The dietary requirements of the special feed stipulate at least 30% protein and at most 5% fiber.
(a) Determine the optimality range for the ratio of cost per pound of corn to the cost per pound of
soybean meal.





9
Feedstuff Protein Fiber Cost ($/lb)
Corn 0.09 0.02 0.30
Soybean meal 0.60 0.06 0.90
Modelling the LPP:
x
1
lb of corn in daily mix
x
2
lb of soybean meal in daily mix
Determining the objective function:
f = 0.3 x
1
+ 0.9 x
2
Determining the constraints:
i. Atleast 800 lb of special feed is used daily,
x
1
+ x
2
800
ii. At least 30% protein is required,
0.09x
1
+ 0.6x
2
0.3 (x
1
+ x
2
)
0.21x
1
0.3x
2
0
iii. At most 5% fiber is required,
0.02x
1
+ 0.06x
2
0.05 (x
1
+ x
2
)
0.03x
1
0.1x
2
0

10
After modelling, the LPP is,
Minimize f = 0.3 x
1
+ 0.9 x
2
subject to
x
1
+ x
2
800
0.21x
1
0.3x
2
0
0.03x
1
0.1x
2
0, x
1
, x
2
0

Graphical method is employed in solving the LPP,

11
12
The feasible region that is obtained is not bounded. The corner points are A(200,600) and B(470,329).
But since the problem is of minimization type, we consider only the corner points that yield the
minimum value for the objective function.
At A, the value of f is 600.
At B, the value of f is 437.
Therefore the optimal values are x
1
= 470 and x
2
= 329 with the minimum value of 437.
13
(b) If the cost per pound of corn is increased by 20% and that of soybean meal is decreased by 5%,
would the current solution remain optimal?

The changes in the cost of respective items are given below:
For corn, cost = 0.3 + 0.2 = 0.5
For soybean meal, cost = 0.9 0.05 = 0.85
Therefore the modified objective function is,
f = 0.5 x
1
+ 0.85 x
2

Since the constraints are independent of the cost of corn and soybean meal, they remain unaltered.
The graph also remains unaltered, containing the same corner points A(200,600) and B(470,329).
14
At A, the value of f is 610.
At B, the value of f is 514.6.
Therefore the optimal values are x
1
= 470 and x
2
= 329 with the minimum value of 437. the optimal
solution is again B(470,329). So the current solution remains unchanged.

(c) If the cost per pound of corn remains fixed at 30 cents and the cost per pound of soybean meal is
increased to $1.10, would the current solution remain optimum?

The changes in the cost of respective items are given below:
For corn, cost = 0.3
For soybean meal, cost = 1.10

15
Therefore the modified objective function is,
f = 0.3 x
1
+ 1.10 x
2
Since the constraints are independent of the cost of corn and soybean meal, they remain unaltered.
The graph also remains unaltered, containing the same corner points A(200,600) and B(470,329).

At A, the value of f is 720.
T B, the value of f is 503.

Therefore the optimal values are x
1
= 470 and x
2
= 329 with the minimum value of 437. the optimal
solution is again B(470,329). So the current solution remains unchanged.



16
THANK YOU
17