UNIT-II-LINEAR PROGRAMMING EXTENSIONS

PART-A

1. What do you meant by transportation problem?

T.P is a special class of LPP in which we transport a commodity (single
product) from the source to a destination in such a way that the total
transportation cost is minimum.

2. How the problem of degeneracy arise in a transportation problem?

3. List any three approaches used with transportation problem, for determining the
starting solution.
(a) North west corner rule.
(b) Least cost method.
(c) Vogel’s approximation method.

4. What is the use MODI Method?

The purpose of MODI method is to get the optimal solution of a T.P.

5. Define degenerate and non-degenerate basic feasible solution of a transportation

problem.
If the number of occupied cells in a m n T.P is less than m+n-1, then it is
called a degeneracy in a T.P.

6. Define the optimal solution to a transportation problem.

The basic feasible solution to a T.P is said to be optimal if it minimizes the
total transportation cost.

7. What do you meant by degeneracy in a transportation problem?

8. Explain how degeneracy in a transportation problem may be resolved?

This degeneracy in a T.P can be resolved by adding one(more) empty cell
having the least cost and is of independent position with a non-negative
allocation( >0).
9. What is a balanced transportation problem?

10. What is transshipment problem?

11. What is unbalanced transportation problem? How to solve it?

12. List the merits and limitations of using North west corner rule.
Merits : This method is easy to follow because we need not consider the
transportation cost.
Limitations : The solution obtained may not be the best solution, as the
allocations have been made without considering the cost of transportation. While
performing optimality test, it may need more iterations to get the optimal solution.
13. How will you identify that a T.P has an alternate optimal solution?
While performing optimality test, if some of
for
empty (non basic) cell is zero, then it is the indicating of an alternative solution.

14. When do you say that the occupied cell is in independent position?
An occupied cell is in independent position, when no closed path can be
drawn from that allocations.

15. What do you mean by an unbalanced assignment problem?

16. Why can the transportation techinique or the simplex method not be used to solve
the assignment problem?
The transportation technique or simplex method cannot be used to solve
the assignment problem because of degeneracy.

17. What is the difference between transportation problem and transshipment

problem?

18. State the difference between the T.P and the A.P.

19. How is the presence of an alternate optimal solution established?

If the final cost matrix contains more than a required number of zeros at
independent positions, then it indicates the presence of an alternate optimal
solution.

20. What is the objective of the traveling salesman problem?

The objective of the travelling salesman problem is that the salesman has
to visit various cities, not visiting twice to the same place and return to the
starting place by spending minimum transportation cost.

21. How do you convert the maximization assignment problem into a minimization
one?

22. What is the name of the method used in getting the optimum assignment?

23. When is an Assignment problem said to be unbalanced? How do you make it a

balanced one?

24. How do you solve an Assignment problem if the profit is to maximized?

25. Explain why the transportation algorithm is not appropriate for solving the
assignment problem.

PART-B

1. Obtain the initial solution for the following TP using NWCR, LCM, VAM
Destination
A B C Supply
1 2 7 4 5
Source

2 3 3 1 8
3 5 4 7 7
4 1 6 2 14
Demand 7 9 18 34

2. Solve the TP where the cell entries denote the unit transportation costs.

Destination
A B C D Supply
Source

P 5 4 2 6 20
Q 8 3 5 7 30
R 5 9 4 6 50
Demand 10 40 20 30 100

3. Solve the following TP.

Destination
1 2 3 Capacity
Source

1 2 2 3 10
2 4 1 2 15
3 1 3 1 40
Demand 20 15 30

4. Find the minimum transportation cost.

Warehouse
D1 D2 D3 D4 Supply
Factory

F1 19 30 50 10 7
F2 70 30 40 60 9
F3 40 8 70 30 18
Demand 5 8 7 14
5. Find the optimal solution by using VAM.

Warehouse
A B C D E F Available
1 9 12 9 6 9 10 5
Factory

2 7 3 7 7 5 5 6
3 6 5 9 11 3 11 2
4 6 8 11 2 2 10 9
Requirement 4 4 6 2 4 2

6. Solve the TP.

Destination
A B C D Supply
Source

1 11 20 7 8 50
2 21 16 20 12 40
3 8 12 8 9 70
7. Demand 30 25 35 40 Solve the following
TP to maximize the
profit.

Destination
A B C D Supply
1 40 25 22 33 100
2 44 35 30 30 30
Source

3 38 38 28 30 70
Demand 40 20 60 30

8. Solve the following unbalanced TP.

TO
1 2 3 Supply
FROM

1 5 1 7 10
2 6 4 6 80
3 3 2 5 15
Demand 75 20 50

9. Consider the following transshipment problem involving 4 sources and two

destinations. The supply values of the sources S1, S2, S3 and S4 are 200 units,
250 units, 200 units and 450 units respectively. The demand values of the
 destinations D1 and D2 are 550 units and 550 units, respectively. The
transportation cost per unit between different sources and destinations are
summarized in the following table. Solve the transshipment problem.

Destination
S1 S2 S3 S4 D1 D2
S1 0 6 24 7 24 10
S2 10 0 6 12 5 20
S3 15 20 0 8 45 7
S4 18 25 10 0 30 6
Source

D1 15 20 60 15 0 10
D2 10 25 25 23 4 0

10. A firm having 2 sources S1 & S2 wishes to ship its products to 2 destinations
D1 & D2. The number of units available at S1 & S2 are 5 & 25 resp. and the
product demanded at D1 & D2 are 20 & 10 units respectively. The firm
instead of shipping directly decides to investigate the possibility of
transshipment. The unit transportation costs (in rupees) are given in the
following table. Find the optimal shipping schedule.

Source Destination Available

S1 S2 D1 D2
Source S1 0 2 3 4 5
S2 2 0 2 4 25
Destination D1 3 2 0 1 -
D2 4 4 1 0 -
Demand - - 20 10

11. Solve the AP:

A B C D
I 1 4 6 3
II 9 7 10 9
III 4 5 11 7
IV 8 7 8 5

12. Solve the AP:

A B C D
I 10 25 15 20
II 15 30 5 15
III 35 20 12 24
IV 17 25 24 20
13. Solve the Assignment problem:

Men
A B C D E
I 1 3 2 8 8
Tasks

II 2 4 3 1 5
III 5 6 3 4 6
IV 3 1 4 2 2
V 1 5 6 5 4

14. Solve the Assignment problem:

Machine
1 2 3 4 5
A 11 17 8 16 20
Jobs

B 9 7 12 6 15
C 13 16 15 12 16
D 21 24 17 28 26
E 14 10 12 11 15

15. A company is faced with the problem of assigning 4 machines to different

jobs (one machine to one job only). The profits are estimated as follows.

Machine
A B C D
1 3 6 2 6
2 7 1 4 4
Job

3 3 8 5 8
4 6 4 3 7
5 5 2 4 3
6 5 7 6 4

Solve the problem to maximize the profit.

16. Determine the optimum assignment schedule for the following assignment
Problem. The cost matrix is given below.
 Machine
1 2 3 4 5 6
A 11 17 8 16 20 15

Job
B 9 7 12 6 15 13
C 13 16 15 12 16 8
D 21 24 17 28 2 15
E 14 10 12 11 15 6
If the job C cannot be assigned to machine 6, will the optimum solution change?

17. A company has four machines to do three jobs. Each job can be assigned to
one and only one machine. The cost of each job on each machine is given in
the following table.

1 2 3 4
A 18 24 28 32
B 8 13 17 19
C 10 15 19 22

What are job assignments which will minimize the cost.

18. Write the algorithm for Hungarian method.

19. There are four machines in a machine shop. On a particular day the shop got
Orders for executing five jobs (A, B, C, D & E). the expected profit for each
job on each job on machine is as follows:

1 2 3 4
A 32 41 57 18
B 48 54 62 34
C 20 31 81 57
D 71 43 41 47
E 52 29 51 50
Find the optimal assignment of job to machines to maximize the profit. Which
job should be rejected.

20. A marketing manager has five salesmen working under his control to be
assigned to five sales territories. Taking into account the sales potential of the
territories and the capabilities of the salesmaen, the marketing manager
estimated the sales per month(in thousands of Rs.) for each combination and is
presented as below. Find the assignment of salesmen to sales Territories to
maximize the sales value per month.
 Salesmen Sales Territories
A B C D E
1 32 38 40 28 40
2 40 24 28 21 36
3 41 27 33 30 37
4 22 38 41 36 36
5 29 33 40 35 39

21. Solve the following assignment problem using Hungerian method. The matrix
entries are processing times in hours.

Job Operator
1 2 3 4 5
1 20 22 35 22 18
2 4 26 24 24 7
3 23 14 17 19 19
4 17 15 16 18 15
5 16 19 21 19 25

22. Five wagons are available at five stations 1, 2, 3, 4 and 5. These are required
at five stations I, II, III, IV and V. the mileages between various stations are
given by

From To
I II III IV V
1 10 5 9 18 11
2 13 29 6 12 14
3 3 2 4 4 5
4 18 9 12 17 15
5 11 6 14 19 10

How should the wagons be transported so as to minimize the total mileage

covered?