Transportation

Problem

(Part-1)

Dr. Meenakshi Rana

Associate Professor
School Of Mathematics,
Thapar Institute of Engg. & Tech.,
Patiala
Transportation Problem
Example (Transportation Problem)
A dairy firm has two milk plants, daily milk production of 6 million litres and 9 million litres
respectively. Each day, the firm must fulfil the needs of its three distribution centres which have the
milk requirement of 7, 5, 3 million litres, respectively. Cost of transportation of 1 million litres of milk
from each plant to each distribution centre is given in hundreds of rupees below. Formulate the LP
model to minimize the transportation cost.

Plant\Distribution Centers D1 D2 D3 Supply

P1 2 3 11 6
P2 1 9 6 9
Demand 7 5 3
General Transportation Problem
Remarks:
1. Necessary and sufficient condition to have feasible solution
is total supply = total demand.

2. There is always an existence of Optimum Solution to

transportation problem.

3. The number of Basic variables are m+n-1.

 Transportation
Problem

(Part-2)

Dr. Meenakshi Rana

Associate Professor
School Of Mathematics,
Thapar Institute of Engg. & Tech.,
Patiala
Remarks:
1. Necessary and sufficient condition to have feasible solution
is total supply = total demand.

2. There is always an existence of Optimum Solution to

transportation problem.

3. The number of Basic variables are m+n-1.

Transportation Problem Part-3
Tuesday, 7 April 2020 9:39 PM

Transporta)
on Proble…
Vogel's Approximation Problem (VAM)
Monday, 13 April 2020 1:49 PM

Transporta)
on Proble…
Dual of a transportation Problem and its Application to Zj-Cj
Saturday, 11 April 2020 10:05 PM
UV method /Optimal Solution of a Transportation Problem
Saturday, 11 April 2020 11:00 PM

(UV-Method)
Unbalanced Transportation Problem
Saturday, 11 April 2020 9:18 PM
Loop in Transportation Problem
Tuesday, 14 April 2020 11:04 PM
Maximization Transportation Problem
Wednesday, 15 April 2020 6:50 AM
Alternative Optimal Solution in Transportation Problem
Wednesday, 15 April 2020 6:06 AM
 Restricted Transportation Problems
Monday, 20 April 2020 1:35 PM

Question: Consider the following minimization transportation problem, where per unit cost
corresponding to each source and destination is given in table.
D1 D2 D3 D4 D5 Supply
S1 20 19 14 21 16 40
S2 15 20 13 19 16 60
S3 18 15 18 20 10 70
Demand
30 40 50 40 60
Find an optimal solution of above transportation problem with following restrictions:
1. There is no transportation from Source S3 to Destination D5.
2. The Source S1 supplies exactly 20 units to Destination D4.
3. The Destination D2 receives at least 10 units from Source S2.
4. The Source S2 can supply at-most 30 units to Destination D3.

D1 D2 D3 D4 D5 Supply
S1 20 19 14 21 16 40
S2 15 20 13 19 16 60
S3 18 15 18 20 70
S4 0 0 0 0 0 50
30 40 50 40 60

D1 D2 D3 D4 D5 Supply
S1 20 19 14 21 16 40
S2 15 20 13 19 16 60
S3 18 15 18 20 70
S4 0 0 0 0 0 50
30 40 50 40 60

D1 D2 D3 D4 D5 Supply
S1 20 19 14 21 16 40
S2 15 20 13 19 16 60
S3 18 15 18 20 10 70
S4 0 0 0 0 0 50
30 40 50 40 60

D1 D2 D3 D4 D5 Supply
S1 20 19 14 M 16 20
S2 15 20 13 19 16 60
S3 18 15 18 20 10 70
S4 0 0 0 0 0 50
30 40 50 20 60

D1 D2 D3 D4 D5 Supply
S1 20 19 14 M 16 20
S2 15 20 13 19 16 60
S3 18 15 18 20 10 70
S4 0 0 0 0 0 50
30 40 50 20 60

D1 D2 D3 D4 D5 Supply
S1 20 19 14 M 16 20
S2 15 20 13 19 16 60
S3 18 15 18 20 10 70
S4 0 0 0 0 0 50
30 40 50 20 60

D1 D2 D3 D4 D5 Supply
S1 20 19 14 21 16 40
S2 15 20 13 19 16 60
S3 18 15 18 20 10 70
S4 0 0 0 0 0 50
30 40 50 40 60

D1 D2 D3 D4 D5 Supply
S1 20 19 14 21 16 40
S2 15 20 13 19 16 50
S3 18 15 18 20 10 70
S4 0 0 0 0 0 50
30 30 50 40 60

D1 D2 D3 D4 D5 Supply
S1 20 19 14 21 16 40
S2 15 20 13 19 16 50
S3 18 15 18 20 10 70
S4 0 0 0 0 0 50
30 30 50 40 60

D1 D2 D3 D4 D5 Supply
S1 20 19 14 21 16 40
S2 15 20 13 19 16 50
S3 18 15 18 20 10 70
S4 0 0 0 0 0 50
30 30 50 40 60

D1 D2 D3 D4 D5 Supply
S1 20 19 14 21 16 40
S2 15 20 13 19 16 30
S2 15 20 M 19 16 30
S3 18 15 18 20 10 70
S4 0 0 0 0 0 50
30 40 50 40 60

D1 D2 D3 D4 D5 Supply
S1 20 19 14 21 16 40
S2 15 20 13 19 16 30
S2 15 20 M 19 16 30
S3 18 15 18 20 10 70
S4 0 0 0 0 0 50
30 40 50 40 60

D1 D2 D3 D4 D5 Supply
S1 20 19 14 21 16 40
S2 15 20 13 19 16 30
S2 15 20 M 19 16 30
S3 18 15 18 20 10 70
S4 0 0 0 0 0 50
30 40 50 40 60
 Assignment Problem
Thursday, 25 October 2018 6:54 PM

Consider n-jobs that is to be assigned to n-persons in one to one correspondence.

Mathematical Formulation of Assignment Problem:

Hungarian Method to Solve Assignment Problem
Friday, 17 April 2020 12:18 AM
Project Management
Thursday, 23 April 2020 7:55 AM

CPM
(Part-1)

CPM
(Part-1).pptx
How to draw a network in Project Management
Thursday, 23 April 2020 9:56 PM
Calculating Completion time of a project (Critical Path Analysis)
Sunday, 26 April 2020 8:15 AM
Float (or slack) of an Activity and Event
Thursday, 30 April 2020 7:00 AM
Optimizing Project/ Resource Analysis/Crashing in Project
Network
Tuesday, 28 April 2020 7:50 PM
Introduction to Non-Linear Programming Problem

Problem.
A manufacturing company produces two products: Radios and Tv sets. Sales price relationship for these
two products are given below:
Products Quantity Demanded Unit price
Radio 1500-5P P
Tv 3800-10P P

The total cost functions for these two products are given by 200x +0.1x and 300x + 0.1x respectively. The
production takes place on two assembly lines. Radio sets are assembled on Assebly line 1 and TV sets
are assembled on Assembly line II. Because of the limitations of the assembly line capacities, the daily
production is limited to nomore than 80 radio sets and 60 TV sets. The production of both types of
products require electronic components. The production of each of these sets requires five units and six
units of electronic equipment components respectively. The electronic components are supplied by
another manufacturer, and the supplyis limited to 600 units per day. The company has 160 employees,
the labor supply amounts to 160 man-days. The production of one unit of radio set requires 1 man-day
of labor, whereas 2 man-days of labor are required for a TV set. How many units of radio and TV sets
should the company produce in order to maximize the total profit. Formulate the problem as a non-
linear Programming problem.
Non-Linear Programming Problem ( Without Constraint)
Non-Linear Programming Problem ( With Equality Constraint)