Scribd
Upload
170 views3 pages

Tutorial Questions Chapter 6: Transportation Problems

The document contains 4 tutorial questions on transportation problems. Each question provides supply and demand amounts for plants/mills and construction sites/cities. It also provides the unit transportation costs between each supply and demand location. The questions ask to 1) formulate the linear programming model, 2) find the initial solution using minimum cell cost or northwest corner method, and 3) find the optimal solution using the stepping stone method.

Uploaded by

ASYIQAH
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
170 views3 pages

Tutorial Questions Chapter 6: Transportation Problems

The document contains 4 tutorial questions on transportation problems. Each question provides supply and demand amounts for plants/mills and construction sites/cities. It also provides the unit transportation costs between each supply and demand location. The questions ask to 1) formulate the linear programming model, 2) find the initial solution using minimum cell cost or northwest corner method, and 3) find the optimal solution using the stepping stone method.

Uploaded by

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

Tutorial Questions

Chapter 6: Transportation Problems

Question 1

A concrete company transport three plants, 1, 2 and 3, to three construction sites, A, B and C.
The plants are able to supply the following numbers of tons per week:

Plant Supply (capacity)


1 300
2 300
3 100
The requirements of the sites, in numbers of tons per week, are:

Construction site Demand


(requirement)
A 200
B 200
C 300
The cost of transporting 1 ton of concrete from each plant to each site is shown in the figure
below in pounds per ton.

Plants Sites
A B C
1 4 3 8
2 7 5 9
3 4 5 5

i. Construct the linear programming model.


Min cost = 4X1A+3X1B+8X1C+7X2A+5X2B+ 9X2C+4X3A+5X3B+5X3C
Subject to:
X1A+X1B+X1C = 300
X2A+X2B+X2C = 300
X3A+X3B+X3C = 100
X1A+X2A+X3A = 200
X1B+X2B+X3B = 200
X1C+X2C+X3C = 300
ii. Find the initial solution using Northwest method.
$3900
iii. Using Stepping-stone method, find the optimal solution.
$3900 (no reduction cost)
Question 2

Consider the following transportation problem:

From To (cost) Supply


Z1 Z2 Z3
A 3 2 0 45
B 1 5 0 60
C 5 4 0 35
Demand 50 60 30 140

i. Find the initial solution using Minimum Cell Cost Method.


$210
ii. Using Stepping-stone method, find the optimal solution.
$200

Question 3

Steel mills in three cities produce the following amount of steel:

Location Weekly Production (tons)


1. Bethlehem 200
2. Birmingham 200
3. Gary 200
These mills supply steel to three cities, where manufacturing plants have the following demand:

Location Weekly Demand (tons)


A. Detroit 150
B. St. Louis 200
C. Chicago 250
The shipping costs per ton are as follows:

Mills Cities
A B C
1 6 9 16
2 11 10 7
3 16 12 10

i. Formulate this problem as a liner programming model


ii. Find the initial solution using Minimum Cell Cost Method.
$5200
iii. Using Stepping-stone method, find the optimal solution.
$5050
Question 4

Consider the following transportation problem:

From To (cost) Supply


A B C
1 4 8 8 56
2 16 24 16 82
3 8 16 24 77
Demand 72 102 41 215

i. Formulate this problem as a liner programming model


ii. Find the initial solution using Minimum Cell Cost Method.
$2968
iii. Using Stepping-stone method, find the optimal solution.
$2744

You might also like