Scribd
Upload
90 views

EXERCISE NO 4 Transportation Problem

This document provides a transportation problem to solve using linear programming methods. It describes a manufacturing company with 2 factories supplying 3 customers, with given unit shipping costs. The objectives are to (1) formulate the linear programming model, (2) illustrate the transportation network, and (3) use different methods like the northwest corner rule, least cost method, and Vogel's approximation to solve the transportation tableau and find the optimal feasible solution.

Uploaded by

Eian chin mana-ay
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
90 views

EXERCISE NO 4 Transportation Problem

This document provides a transportation problem to solve using linear programming methods. It describes a manufacturing company with 2 factories supplying 3 customers, with given unit shipping costs. The objectives are to (1) formulate the linear programming model, (2) illustrate the transportation network, and (3) use different methods like the northwest corner rule, least cost method, and Vogel's approximation to solve the transportation tableau and find the optimal feasible solution.

Uploaded by

Eian chin mana-ay
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/ 2

EXERCISE NO 4

NAME: DATE:

Instruction: Put your solution on the ANSWER SHEET provided.

Transportation Problem:

A manufacturing company has 2 factories (m) that supply the needs of 3 customers (n). The unit
shipping cost from a factory to a customer depends on the distance

Unit shipping C1 C2 C3 Supply


cost ($/product)
F1 7 6 11 50
F2 4 8 6 50
Demand 35 35 30

x ij =number of products shipped ¿ F i ¿ C j

x ij ≥ 0, i = 1,2; j=1,2,3

a. Formulate a Linear Programming Model indicating the following: 1.) objective function;
and 2.) constraint functions
b. Illustrate a transportation network (diagram) showing the nodes, arrows, and values of
supply, demand, and transportation costs.
c. Make a transportation tableau using the following methods:
1) Northwest corner rule method
2) Least cost method
3) Vogels approximation method (VAM)
d. In item c, which among the methods is the least transportation cost? Do you think it is the
optimal solution? Why or why not?
e. Make a transportation tableau using either a stepping-stone method or modified
distribution method. What is the optimal feasible solution?
ANSWER SHEET

You might also like