Scribd
Upload
7 views17 pages

Transpo Handout

Uploaded by

ML Creations
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
7 views17 pages

Transpo Handout

Uploaded by

ML Creations
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 17

LINEAR PROGRAMMING

Special Purpose Algorithm


method
TRANSPORTATION MODEL
- a linear programming problem in which a
product is to be transported from a number of
sources to a number of destinations at the
minimum cost or a maximum profit

• Concerned with selecting routes in a


product-distribution network
STEPS
1 Find the initial solution using
a) North-west Corner Rule (NCR)
b) Minimum Cost Method (MCM) or
Greedy Method
c) Vogel’ Approximation Method (VAM)
2 Determine the Optimal Solution using :
a) Stepping Stone Method (SSM) and
b) Modified Distribution Method (MODI)
Setting-up the Initial Tableau
DESTINATION

FROM PROJECT PROJECT B PROJECT PLANT


TO A C CAPACITY
PLANT A
PLANT B SUPPLY
PLANT C
PROJECT DEMAND/ 215
REQUIREMENT REQUIREMENT 215
SOURCES OF FOR EACH
SUPPLY PROJECT
Naming the Cells
FROM PROJECT PROJECT B PROJECT C PLANT
TO A CAPACITY
PLANT A C11
PLANT B C23
PLANT C C32
PROJECT 215
REQUIREMENT 215

1st value: row


2nd value: column
a) NORTHWEST CORNER RULE
(Transportation Model)
STEP 1
Initial Tableau:
1.Assign values using the NCR
2.Check stair-step appearance
3.Check rim requirement
• Used cell = R + K – 1
4. Compute transportation cost
• A systematic and logical procedure known as the
North-west Corner Rule has been developed for
setting up the initial solution. This rule offers the
advantage of being systematic rather than trial
and error.
• Starting at the upper-left-hand corner of the
tableau, the supply available at each row must
be exhausted before moving down to the next
row, and the rim requirement of any column
must be exhausted before moving right to the
next column.
• Check to see if the rim requirement have been
satisfied.
Variations in setting up the Initial Tableau

1. DEMAND = SUPPLY
2. DEMAND > SUPPLY
– Add Dummy Supply Row
3. SUPPLY > DEMAND
– Add Dummy Demand Column
4. CASE OF DEGENERACY
– Degeneracy is when Supply (row) and Demand
(column) are simultaneously satisfied at any
point before the end.
CASE 1: DEMAND = SUPPLY
TO BAGUIO ISABELA CABANA- PLANT
FROM TUAN CAPACITY
LAGUNA 1500
CAVITE 2000
BATANGAS 800
PROJECT 4300
REQUIREMENT 2000 1200 1100 4300
CASE 2: DEMAND > SUPPLY
TO BAGUIO ISABELA CABANA- PLANT
FROM TUAN CAPACITY
LAGUNA 1700
CAVITE 2200

PROJECT 3900
REQUIREMENT 2000 1200 1100 4300
CASE 3: DEMAND < SUPPLY
TO BAGUIO ISABELA CABANA PLANT
TUAN CAPACIT
FROM Y
LAGUNA 1700
CAVITE 2000
BATANGAS 800
PROJECT
REQUIREM 2000 1200 1000 4500
ENT
4200
CASE 4: DEGENERACY
TO BAGUIO ISABELA CABANA- PLANT
FROM TUAN CAPACITY
LAGUNA 25
CAVITE 9
BATANGAS 5
PROJECT 39
REQUIREMENT 17 17 5 39
TRANSPORTATION MODEL: NCR
Case1: AEON Construction Supply won a bidding to
supply cements to three road projects. Projects I, II,
and III require 100 bags , 170 bags, and 180 bags
respectively. There are three warehouses A, B, and C.
The available bags per warehouse are as follows: 120
bags for A, 180 bags for B and 150 bags for C. The
transportation cost per cement from each warehouse
to each project are as follows:
from I II III
A P5 P2 P4
B 3 5 4
C 4 3 2

How many cement should be transported to each road project?


TRANSPORTATION MODEL: NCR
Case2: Netopia sells desktop computers to universities in
the university belt and ship them from three
distribution warehouses. The firm is able to supply
the following numbers of desktop computers to the
universities by the beginning of the academic year.
Warehouse Supply Universities have ordered desktop
S 150 computers that must be delivered
A 200 and installed by the beginning of the
M 50 academic year University Demand
Total 400 The shipping cost per J 100
desktop are as follows:
O 80
from J O Y
Y 220
S P7 P5 P9
Total 400
A 10 12 10 Netopia wants to determine how many desktop computers
should be shipped from each warehouse to each
M 6 13 14 university.
STEPS:
1. Initial Tableau:
a. Assign values using the NCR
b. Check stair-step appearance
c. Check rim requirement and
– Used cell = R + K – 1
d. Compute transportation cost
STEPS:
2. Solution for Improvement using Modified Distribution
Method
a. Identify used cell – determine a set of values for each
row and column using the transportation cost per
unit.
» used cell = R + K where R1 is always equal to 0
b. Identify unused cells, then compute for the
improvement index ( unused cell – R – K)
c. Select the cell which has the most negative
improvement index
STEPS:
d. Traced closed-path.
» Assign positive and negative signs alternately to the
chosen path starting with a positive sign in unused cell
» Choose least value in the negative cell, transfer to empty
cell, add to all positive cell, and deduct to all negative cell
e. Check rim requirement and used cell
f. Compute transportation cost

Note: Repeat Step 2 until there is no more (-) negative


improvement index (optimal solution)

You might also like