..
NORTH·WEST UNIVERSITY
YUNIBESITI YA BOKONE·BOPHIRIMA
NOORDWES·UNIVERSITEIT
MAFIKENG CAMPUS
EXAMINATION OFFICE
EXAMINATION 1st Opportunity NOVEMBER 2011
FACULTY Commerce and Administration
DEPARTMENT Statistics
COURSE TITLE Network Analysis
COURSE CODE STOM 222 I 229
TIME 3 Hours
MARKS 100
1st Examiner : Mr N.N. Maruma
2 nd Examiner: Mr L.D. Xaba
Instruction to Candidates
1. Answer ALL questions
CANDIDATES ARE NOT ALLOWED TO READ THE QUESTIONS UNTIL THEY
ARE TOLD TO DO SO BY THE CHIEF INVIGILATOR.
, •
QUESTION 1 [20 marks]
Consider the following transportation problem with cost data. The objective is to
minimize the total transportation cost.
Destination 1 Destination 2 Destination 3 Supply
Source I 42 30 36 810
Source 2 35 28 .26 300
Source 3 24 19 27 390
Demand 400 730 370 1500
Use the u-v method to find the optimal solution, starting with the initial feasible solution
produced by the north-west corner method.
QUESTION 2 [10 Marks)
Consider the following transshipment problem:
Formulate a linear programming problem to minimize the transportation cost.
NORTH·WEST UNIVERSITY
YUNIBESITI YA BOKONE·BOPHIRIMA
NOORDWES·UNIVERSITEIT
MAFIKENG CAMPUS
EXAMINATION OFFICE
EXAMINATION 1st Opportunity NOVEMBER 2011
FACULTY Commerce and Administration
DEPARTMENT Statistics
COURSE TITLE Network Analysis
COURSE CODE STOM 222 I 229
TIME 3 Hours
MARKS 100
1st Examiner : Mr N.N. Maruma
2 nd Examiner: Mr L.D. Xaba
Instruction to Candidates
1. Answer ALL questions
CANDIDATES ARE NOT ALLOWED TO READ THE QUESTIONS UNTIL THEY
ARE TOLD TO DO SO BY THE CHIEF INVIGILATOR.
, •
QUESTION 1 [20 marks]
Consider the following transportation problem with cost data. The objective is to
minimize the total transportation cost.
Destination 1 Destination 2 Destination 3 Supply
Source I 42 30 36 810
Source 2 35 28 .26 300
Source 3 24 19 27 390
Demand 400 730 370 1500
Use the u-v method to find the optimal solution, starting with the initial feasible solution
produced by the north-west corner method.
QUESTION 2 [10 Marks)
Consider the following transshipment problem:
Formulate a linear programming problem to minimize the transportation cost.
