Ayodhya Nath Paikaray U408007

Assignment on

Operation Research

Submitted to:

Dr. Surya Prakash Singh

Assistant Professor, Operations Management & Decision Sciences

Submitted by:

Ayodhya Nath Paikaray

Roll No. : U408007
PGDM (PT-WK) 2008-2011

In all assignments, I have considered few assumptions, which are known as

XAVIER INSTITUTE OF MANAGEMENT,
“Decision Variables”. BHUBANESWAR
Ayodhya Nath Paikaray U408007

• Assignment No. 1 : 3.1-6

Decision Variables:

X1 – no. of wood-framed windows constructed per day

X2 – no. of Aluminum-framed windows constructed per day

Objective Function: (here the objective function is for maximization)

Maximize Z = 60 X1+ 30 X2. (here Z = profit)

Constraints:

6 X1 + 8 X2 <= 48 (Sq. ft. of Glass.)

X1<= 6 (wood-framed windows)

X2<= 4 (Aluminum-framed windows)

X1, X2 >= 0 (Non-Negativity Constraints)

So from above data I got the following LP Model formulation.

Maximize Z = 60 X1 + 30 X2

Subject to

6 X1 + 8 X2 <= 48
X1<= 6
X2 <= 4

X1, X2 >= 0

• Assignment No. 2 : 3.1-8 (a)

Decision Variables:

X1 – no. of units of special risk insurance issued

X2 – no. of units of mortgage insurance issued

Objective Function: (here the objective function is for maximization)

Maximize Z = X1+2 X2. (here Z = profit)

Constraints: (here constraints are the working hours of different dept.)

3 X1 + 2 X2 <= 2400 (Underwriting Dept.)

2 X1<= 1200 (Administration Dept.))

X2<= 800 (Claims)

X1, X2 >= 0 (Non-Negativity Constraints)

Ayodhya Nath Paikaray U408007

So from above data I got the following LP Model formulation.

Maximize Z = 5 X1 + 2 X2

Subject to

3 X1 + 2 X2 <= 2400
2 X1 <= 1200
X2 <= 800
X1, X2 >= 0

• Assignment No. 3 : 3.1-10 (a)

Decision Variables:

X1 – no. of units of product 1 produced

X2 – no. of units of product 2 produced
X3 – no. of units of product 3 produced

Objective Function: (here the objective function is for maximization)

Maximize Z = 50X1+ 20 X2+ 25X3 (here Z = profit)

Constraints:

9X1+ 3X2+ 5 X3 ≤ 500 (Time taken (in hour) by Milling Machine per week)

5X1+ 4X2 ≤350 (Time taken (in hour) by Lathe Machine per week)

3X1+ 2X3 ≤150 (taken (in hour) by Grinding Machine per week)

X3 ≤20 (Sales potential for product 3)

X1, X2, X3 >= 0 (Non-Negativity Constraints)

So from above data I got the following LP Model formulation.

Maximize Z = 50X1+ 20 X2+ 25X3

Subject to

9X1+ 3X2+ 5 X3 ≤ 500

5X1+ 4X2 ≤350
3X1+ 2X3 ≤150
X3 ≤20

X1, X2, X3 >= 0

Ayodhya Nath Paikaray U408007

• Assignment No. 4 : 3.4-15

Decision Variables:

X1 – Slice of Bread
X2 – Tbsp of peanut butter
X3 – Tbsp of Strawberry jelly
X4 – Cracker of Graham cracker
X5 – Cup of Milk
X6 – Cup of Juice

Objective Function: (here the objective function is for minimization)

Minimize Z = 5 X1+4 X2+7 X3+ 8 X4+15 X5+ 35 X6 (here Z = cost)

Constraints:

10 X1+75 X2+ 20 X4+ 70 X5 ≥ 120 (Calories from Fat)

60 X1+25 X2+50 X3+ 40 X4+ 80 X5+ 100 X6 ≥ 280 (Calories from Others)

10 X1+75X2+ 20X4+ 70X5 ≤ 180 (Calories from Fat)

60 X1+25 X2+50 X3+ 40 X4+ 80 X5+ 100 X6 ≤ 420 (Calories from Others)

3 X3+2 X5+ 120 X6 ≥ 60 (mg of Vitamins)

3 X1+4 X2+1 X4+8 X5+ 1 X6 ≥ 12 (grm of Proteins)

X1= 2 (Bread slice)

X5 ≥ 1 (Milk)

2 X2 = X3 (Peanut butter & Strawberry jelly)

X1, X2, X3, X4, X5, X6 >= 0 (Non-Negativity Constraints)

So from above data I got the following LP Model formulation.

Minimize Z = 5 X1+4 X2+7 X3+ 8 X4+15 X5+ 35 X6

Subject to

10 X1+75 X2+ 20 X4+ 70 X5 ≥ 120

60 X1+25 X2+50 X3+ 40 X4+ 80 X5+ 100 X6 ≥ 280
10 X1+75X2+ 20X4+ 70X5 ≤ 180
60 X1+25 X2+50 X3+ 40 X4+ 80 X5+ 100 X6 ≤ 420
3 X3+2 X5+ 120 X6 ≥ 60
3 X1+4 X2+1 X4+8 X5+ 1 X6 ≥ 12
X1= 2
X5 ≥ 1
2 X2 = X3
X1, X2, X3, X4, X5, X6 >= 0
Ayodhya Nath Paikaray U408007

• Assignment No. 5 : 4.1-1

Objective Function:

Maximize Z = X1 + 2X2
Contraints:

X1 <= 2
X2 <= 2
X1 + X2 <= 3

X1, X2 >= 0

a)

X2 (0,3)
(1,2)
(0,2)
(2,1) Feasible Region(a)

(0,0) (2,0) (3,0)

X1

(0,0), (2,0), (1,2), (2, 1), (0,2) are the CPF solutions

b) For (0,0) the pair of constraint boundary equations are, X1>=0 and X2>=0.
For (0,2) the pair of constraint boundary equations are, X1>=0, X2>=0 and X2 <= 2
For (1,2) the pair of constraint boundary equations are, X1>=0, X2>=0 and X1 + X2 <= 3.
For (2,1) the pair of constraint boundary equations are, X1>=0, X2>=0 , X1 + X2 <= 3.
For (2,0) the pair of constraint boundary equations are, X1>=0, X2>=0 , X1 <= 2 .

c) Z(0,0) = 0
Z(0,2) = 4
Z (1,2) = 5 : Maximum
Z(2,1) = 4
Z(2,0) = 2
Ayodhya Nath Paikaray U408007

d) For (0,0) the adjacent CPF solutions are (0,2) and (2,0)
For (2,0) the adjacent CPF solutions are (0,0) and (1,2)
For (1,2) the adjacent CPF solutions are (0,2) and (2,1)
For (2,1) the adjacent CPF solutions are (1,2) and (2,0)
For (0,2) the adjacent CPF solutions are (0,0) and (1,2)

e) For (0,0) the pair of constraint boundary equations are, X1>=0 and X2>=0.
For (0,2) the pair of constraint boundary equations are, X1>=0, X2>=0 and X2 <= 2
For (1,2) the pair of constraint boundary equations are, X1>=0, X2>=0 and X1 + X2 <= 3.
For (2,1) the pair of constraint boundary equations are, X1>=0, X2>=0 , X1 + X2 <= 3.
For (2,0) the pair of constraint boundary equations are, X1>=0, X2>=0 , X1 <= 2 .

• Assignment No. 7 : 4.1-2

Objective Function:

Maximize Z = 3X1 + 2X2

Contraints:

2X1+X2 <= 6
X1 + 2X2 <= 6

X1, X2 >= 0
a)

(0,6)

X2 (0,3)
(1,2) (2,2)

(2,1) Feasible Region(a)

(0,0) (3,0) (6,0)

X1

At (0,0) Z=0
at (0,3) Z=6
at (2,2) Z= 10 (Maximum)
at (3,0) = 9.
Ayodhya Nath Paikaray U408007

b) For (0,0) the pair of constraint boundary equations are,

X1, X2>=0.

For (0,3) the pair of constraint boundary equations are,

X1, X2>=0
X1 + 2X2 <= 6

For (2,2) the pair of constraint boundary equations are,

X1, X2>=0
2X1+X2 <= 6
X1 + 2X2 <= 6

For (3,0) the pair of constraint boundary equations are,

X1, X2>=0
X1 <= 2
2X1+X2 <= 6

c) For (0,0) the adjacent CPF solutions are (0,3), (3,0).

For (0,3) the adjacent CPF solutions are (0,0), (2,2)
For (2,2) the adjacent CPF solutions are (0,3), (3,0)
For (3,0) the adjacent CPF solutions are (2,2), (0,0)

d) at (0,0) Z=0
at (0,3) Z=6
at (2,2) Z= 10 (Maximum)
at (3,0) Z= 9

e) Graphical Interpretation of Simplex Method

Method Sequence Graphical Interpretation

---------------------- -----------------------------
Initialization Let (0, 0) be the initial CPF solution

Optimality Test Not Optimal, because Z increases along either edges

Iteration-1
Step-1 Move up along X2 axis, at (0,3), Z = 6.

Optimality Test Not Optimal, because Z increases along X2 from (0,3)

Iteration-2
Step-1 Move along the edge to the right along the feasible
Boundary at (2,2), Z=10

Optimality Test (2,2) is the Optimal Corner Point Solution because on either side
Value of Z decreases.
Ayodhya Nath Paikaray U408007

• Assignment No. 8 : 4.4-5

From the problem we have the following data

Maximize Z= 2X1+4X2+3X3

Subject to

3X1+2X2+2X3 <= 60
2X1+X2+2X3 <= 40
X1+3X2+2X3 <=80
X1, X2, X3>=0.

Now after standardization

Z- 2X1-4X2-3X3 = 0
3X1+4X2+2X3+ S1 = 60
2X1+X2+2X3 + S2 = 40
X1+3X2+2X3+ S3 = 80

Basic Z X1 X2 X3 S1 S2 S3 r.h.s Min

Variables ratios
Z 1 -2 -4 -3 0 0 0 0
S1 0 3 4 2 1 0 0 60 15
S2 0 2 1 2 0 1 0 40 40
S3 0 1 3 2 0 0 1 80 80/3

Basic Z X1 X2 X3 S1 S2 S3 r.h.s Min

Variables ratios
Z 1 3-2=1 0 -1 1 0 0 60
X2 0 ¾ 1 ½ ¼ 0 0 15
S2 0 2- 0 2- -¼ 1 0 25
3/4=5/4 ½=3/2
S3 0 1 0 2- -3/4 0 1 80-
3/2=½ 45=35

Basic Z X1 X2 X3 S1 S2 S3 r.h.s Min

Variables ratios
Z 1 11/6 0 0 5/6 2/3 0 60+50/3
=230/3
X2 0 ¾-5/12 1 0 1/4+1/12 0-2/6= 0 15-25/3
=4/12=1/3 =1/3 -1/3 =20/3
x2 0 5/6 0 1 -1/6 2/3 0 50/3
S3 0 -5/4-5/12= 0 0 -3/4+1/12 -1/3 1 35-25/3
-5/3 -8/12= -2/3 =80/3

Therefore the value of Z can be calculated: 2 x 0 +4 x 20/3 +3 x 50/3 = 76.67.