Operations Research

Assignment No. 4
GROUP 16
PGDM A

UtsabBasu (10)
Aparna Dwivedi (23)
Ankita Nagar (43)
Rucha Shah (54)

Chapter 6
Problem 5:
a. Network Representation:

Let Xij be the no of hours from consultant i to client j

Max profit function:
100x11 + 125x12 + 115x13 + 100x14 + 120x21 + 135x22 + 115x23
+ 120x24 + 155x31 + 150x32 + 140x33 + 130x34
Constraints:
x11
x21
x31
x11
x12
x13
x14

+
+
+
+
+
+
+

x12
x22
x32
x21
x22
x23
x24

+
+
+
+
+
+
+

b. Screenshots:

x13
x23
x33
x31
x32
x33
x34

+
+
+
=
=
=
=

x14 160
x24 160
x34 140
180
75
100
85

The schedule of the hours is:

ALLOCATION MATRIX (Xij)
(hours)

Avery
Baker
Campbell

0
40
140

40
35
0

100
0
0

0
85
0

The total billing is: $57,925/c. If Avery does not work for Client B, his billing for client B is zero.
Solving for the new model, the revised schedule for hours is as follows:
ALLOCATION MATRIX (Xij) (hours)
Avery
Baker
Campbell

The total billing now is: $ 57,525/-

B
0
40
140

C
0
75
0

D
100
0
0

40
45
0

Problem 6:
a. Network Representation:

Let Xij be the demand at j and supply at i

Max profit:
32x11 + 32x13 + 34x12 + 40x14 +34x21 + 30x22 + 28x23
+38x24
Constraints:
x11 + x12 + x13 + x14 <= 5000
x21 + x22 + x23 + x24 <=3000
x31 + x32 +x33 + x34 <= 4000
x11 + X21 + x31 = 2000
x12 +x22 + x32 = 5000
x13 + x23 + x33 = 3000
x14 + x24 + x34 = 2000
b. Screenshots:

In order to maximize profits, each plant should produce as follows:

ALLOCATION MATRIX
(Xij)
Clifton Springs
Danville

D1

D2
0
2000

The profits earned are as follows:

D3
4000
0

D4
0
0

1000
1000

Profit

D1

Clifton Springs
Danville

$
$
68,000.0
0

D2
$
1,36,000.0
0

D3

$
-

$
-

$
-

D4
$
40,000.0
0
$
38,000.0
0

Total
$
1,76,000.
00
$
1,06,000.
00

The demands of customer D3 will not be met at all and customer D2s
demand has a shortfall of 1000 units.
Problem 7:
a) Network representation :

b) Screenshots :

Thus the number of motors to be produced and shipped from and to each
plant should be:

Thus maximum profit that can be achieved with this optimal solution is Rs
4240
Problem 8:
Let Xij be the cost of producing j product at i centre.
Minimize cost:
x1A + 1.2x1B +0.9x1C + 1.4x2B + 1.3x2A + 1.2x2C + 1.1x3A+ x3B
Constraints:
x1A + x1B + x1C <=1500
x2A + x2B + x2C <=1500
x3A + x3B + x3C <= 1000
x1A + x2A + x3A = 2000
x1B + x2B + x3B = 500

x1C + x2C + x3C = 1200

Screenshots:

Thus production schedule for various products is as follows:

Thus the minimum cost that will be incurred with the optimal distribution of
products across diff plants is Rs 3990.
Example 6:
a. Screenshots:

The amount that should be shipped from each plant to each warehouse to
minimize the total shipping cost:
ALLOCATION MATRIX
(Xij)
(units)
P1
P2
P3

W1

W2
0
0
3000

W3
0
4000
1000

W4
4000
0
0

W5
5000
0
1000

0
0
3000

Total Cost: 150,000/b. If warehouse 1 increased its requirement by 1000 units which was
supplied by plant 2, it will lead to a decrease in the total shipping costs to
141,000/-. The new allocation is as follows:
ALLOCATION MATRIX
(Xij)
(units)
P1
P2
P3

W1

W2
0
0
4000

W3
0
5000
0

W4
4000
0
0

W5
5000
0
1000

0
0
3000