ASSIGNMENT 2-OPERATIONS RESEARCH
1. A company has 3 plants A, B and C , 3 warehouses X,Y and
Z. The number of units available at the plants is 60, 70 and
80 and the demand at X,Y,and Z are 50, 80, 80 respectively.
The unit cost of the transportation is given in the following
matrix.
X Y Z
A 8 7 3
B 3 8 9
C 11 3 5
Find the allocation so that the total transportation cost is
minimum.
2. Find the optimum cost plan for the following
transportation problem.
Plants Warehouse Available
W1 W2 W3
A 25 17 25 300
B 15 10 18 500
Requirement 250 300 500
3. The CEO of a multinational company head quartered in
London for its European operations, wants his four
corporate directors visit and audit one of the assembly
plants during the first two weeks of June. The four
assembly plants are located in cities A, B, C and D in
different countries of Europe. The CEO has estimated the
cost of sending each director to each plant based on the
expertise, importance of specific problem areas in a plant,
time required to audit, the language ability etc. The
assignment costs for every director – plant combination
are given in the table below:
Plant A B C D
Director
Finance(F) 24 10 21 11
Marketing(M) 14 22 10 15
Operations(O) 15 17 20 19
Personnel(P) 11 19 14 13
Note: Costs are in thousands of rupees
Determine the optimal assignment of directors to plants so
as to minimise the total costs using Hungarian method.
4. Two competitors are competing for the similar product.
The pay-off matrix in terms of their advertising plan is as
below:
Competitor B
Large Medium Small
Large Advt. 70 80 50
Competitor A Medium 90 60 95
Advt.
Small Advt. 105 90 65
Find the optimal strategies and the value of the game.
5. For the following two-person zero sum game, find the
optimal strategies for the two players and the value of
game.
Competitor B
b1 b2 b3l
a1 5 9 3
Player A a2 6 -12 -11
a3 8 16 10
If the saddle point exists, determine it using the principle of
dominance.
6. Solve the following game problem using graphical
approach Playerr B
b1 b2
a1 3 4
Player A a2 -3 12
a3 6 -2
a4 -4 -9
a5 5 3