Operations Research (I) Final Exam Academic Year 109, Semester 1

NATIONAL CHIAO TUNG UNIVERSITY

COLLEGE OF MANAGEMENT

FINAL EXAMINATION FOR

(December 29th, 2020)

10:10am~noon

Operations Research (I)

Time Allowed: 110 minutes

_____________________________________________________________________
INSTRUCTIONS TO CANDIDATES:

1. 本次測驗計有九
本次測驗計有九題，共五頁。最末頁有 End of Paper 記號， 記號，試卷缺頁請立即反映。
試卷缺頁請立即反映。
This question paper contains NINE (9) questions and comprises FIVE (5) printed pages. The
last page is marked with “End of Paper”. In case of missing page, please report it as soon as
possible.

2. 回答所有問題，
回答所有問題，總分為一百分。
總分為一百分。
Answer ALL questions. The total mark for this question paper is 100.

3. 清楚標明題號，
清楚標明題號，並依序在答題本上作答。
並依序在答題本上作答。
Sequentially write down your answers in the answer book and clearly mark the question
number.

4. 作答於本試卷紙
作答於本試卷紙上部分
試卷紙上部分，上部分，不予計分。 不予計分。
Any answer written on this question paper will NOT be graded.

5. 本測驗採部份給分，
本測驗採部份給分，請以指定的方法作答， 請以指定的方法作答，並列出完整的計算過程。並列出完整的計算過程。
Follow the instruction and show ALL your work. Partial credits may be given.

6. 本測驗為關書測驗，
本測驗為關書測驗，不得使用計算機、 不得使用計算機、字典、 字典、電子字典、電子字典、手機、 手機、智慧型手機、
智慧型手機、電腦、 電腦、筆
記型電腦，
記型電腦，亦不得攜帶小抄。亦不得攜帶小抄。
This is a closed book exam. Calculator, dictionary, electronic dictionary, mobile phone, smart
phone, computer, and laptop are NOT allowed. Also, any cheat sheet is prohibited.
 2 Operations Research (I)
_______________________________________________________________________________
Question 1 MULTIPLE CHOICE [2 marks]
( ) What is “graph” (network)?
(A) a nest of birds
(B) a set of pictures
(C) a set of draws and paints
(D) a pair of sets
(E) a pair of nodes
(F) a pair of arcs
(G) none of the above

Question 2 MULTIPLE CHOICE [2 marks]

( ) In the flow network, what is “cut”?
(A) a bottleneck
(B) a gateway of flow
(C) a knife
(D) a wound made by knife
(E) a set of nodes
(F) a set of arcs
(G) none of the above

Question 3 MULTIPLE CHOICE [2 marks]

( ) Consider the following three methods: Northwest corner method, Vogel’s approximation
method, Russell’s approximation method. How many methods can we guarantee to find
the optimal solution for transportation problems?
(A) -1
(B) 0
(C) 1
(D) 2
(E) 3
(F) 4
(G) none of the above

Question 4 [Total 12 marks]

In transportation problems, a route with greater than 0 amount of shipment is called “used”.
Consider a balanced transportation problem with 10 sources, 10 destinations. Note that no supply
or demand is zero.
(a) Find the minimum possible number of routes “used” in optimal solution. [1 mark]
(b) Find the maximum possible number of routes “used” in optimal solution. [1 mark]

Consider a balanced transportation problem with 10 sources, 12 destinations. Note that no supply
or demand is zero.
(c) Find the minimum possible number of routes used in a feasible solution. [1 mark]
(d) Find the maximum possible number of routes used in a feasible solution. [1 mark]

Consider a balanced transportation problem with 6 sources and 12 destinations.

(e) How many possible routes are there for this problem? [2 marks]
(f) Set y as the maximum possible number of routes used in Northwest Corner method.
Find y . [2 marks]
(g) Is it possible to have y − 1 or less used routes in an optimal solution? (Yes/No) Explain
why in 2 sentences. [2 marks]
(h) Is it possible to have y + 1 or more used routes in an optimal solution? (Yes/No) Explain
why in 2 sentences. [2 marks]
 3 Operations Research (I)
_______________________________________________________________________________
Question 5 [Total 20 marks]
Consider the following transportation problem to minimize the total transportation costs. The unit
shipping cost associated with each route is shown in the cell. Due to the severe weather, the route
from Source 3 to Destination 2 is prohibited.
COSTS Dest. 1 Dest. 2 Dest. 3 Supply
Source 1 15 5 8 7
Source 2 6 12 13 6
Source 3 5 Prohibited 16 13
Source 4 10 17 14 7
Demand 12 8 15

(a) Use Vogel’s approximate method to find a solution. Calculate the total transportation cost.
[8 marks]
(b) Adopting the solution from (a) as an initial solution, use transportation simplex method to
find a solution. Remember to calculate all improvement indexes and the total transportation
cost. [10 marks]
(c) Can we guarantee that the solution in (b) is optimal? (Yes/No) Explain why in 2 sentence.
[2 marks]

Question 6 [Total 20 marks]

A production department that specializes in manufacturing a type of bag is able to produce 950
bags weekly using its production plant. There are four possible colors for the bags manufactured
by the department. These colors are black, blue, green and red with a respective production cost of
$8, $6, $5 and $9 for each bag when using its own production plant, and the department has just
received an order for 350, 200, 600 and 250 of the respective colored bags in the current week.
It is also able to outsource the production of an additional 650 bags weekly. But this would
cost $1 more per bag produced than when using its own production plant for black. For blue, green
and red, this would cost $2 more per bag produced than when using its own production plant.
Also, there is contractual agreement that any outsourced production of less than 650 bags would
incur a cost of $1 per bag of shortfall, such as an outsourced production of 605 bags would result
in a cost of $45 due to 45 bags of shortfall. The objective is to minimize the total production cost.

(a) Build a balanced transportation tabular to help the production department decide on its
production plan. [4 marks]
(b) Use the Russell’s approximation method to find a solution to the transportation tabular in (a).
[4 marks]
(c) Using the solution in (b) as an initial solution, find an optimal solution by transportation
simplex method. Show optimal value and optimal solution in terms of the production plan that
the production department should adopt. Remember to show all your work. [12 marks]
 4 Operations Research (I)
_______________________________________________________________________________
Question 7 [Total 10 marks]
Consider the assignment problem in which each job must be assigned to one machine and one
machine can only process one or less job. The goal is to minimize the total cost of assignments.
The numbers in the following table are the costs of assignments.

Machine Machine Machine Machine Machine

Cost
A B C D E
Job 1 7 8 13 5 14
Job 2 5 6 13 12 2
Job 3 9 3 9 8 7
Job 4 10 6 9 4 2

(a) Use the Hungarian method to find the optimal assignment. [8 marks]

(b) Compute the optimal total cost for the optimal assignment. [2 marks]

Question 8 [Total 12 marks]

Consider 6 nodes, named 1, 2, 3, 4, 5, and 6. There are 10 arcs connecting these nodes and the
weight for each arc is attached.

Arc (1,2) (1,3) (2,3) (2,4) (2,5) (3,4) (3,5) (4,5) (4,6) (5,6)
Weight 19 4 7 14 10 7 3 29 2 9

(a) Draw a network for the problem. [2 marks]

(b) Find the minimum spanning tree for the network and calculate the total weights.
Remember to show all your work. [5 marks]

(c) For each arc, consider the weight as the travel distance between two nodes. Find the
shortest path from Node 1 to Node 6 and calculate the travel distance. Remember to
show all your work. [5 marks]
 5 Operations Research (I)
_______________________________________________________________________________
Question 9 [Total 20 marks]
A natural gas company provides gas from its reservoir to the large storage tank of a town daily
through a network of pipelines. There are five intermediate storage tanks (A, B, C, D, E) in the
network of pipelines. The available pipes and their daily capacity in this network are summarized
below:

Daily Capacity
Pipes
(10,000 cubic meters)
Reservoir → A 3
Reservoir → B 1
A→C 3
B→C 5
B→D 4
D→E 2
C → Town’s storage tank 2
E → Town’s storage tank 3

(a) Draw the network of pipelines for the maximum flow problem. [2 marks]

(b) Formulate a Linear Programming model that can be used to determine the maximum amount
of gas from the reservoir to the town’s storage tank daily. [8 marks]

(c) Use the augmenting path method to find the maximum amount of gas that can be provided
from the reservoir to the town’s storage tank daily. Remember to show all your work.
[8 marks]

(d) Find a minimum cut for the network of pipelines. [2 marks]

- END OF PAPER -
 6 Operations Research (I)
_______________________________________________________________________________
Question 1:D
Question 2:F
Question 3:B

Question 4:
(a) 10 routes
(b) 100 routes.
(c) 12 routes
(d) 120 routes.
(e) 72 routes
(f) 17 routes. There are m+n constraints with one redundant. Totally, m+n-1 effective constraints
make sure at most m+n-1 basic variables.
(g) Yes, possible. Degenerate case.
(h) Yes, possible. There may be some stepping stone loops with improvement index of 0. We can
move some shipping amount on these loops to increase the number of used routes. (Multiple
optimal solution.)

(e) 寫寫寫寫寫 (2寫)

寫寫寫寫寫 (2寫)

答答yes寫0.5寫(答寫答寫寫寫)，理理1.5寫

(f)
(g)
答答yes寫0.5寫(答寫答寫寫寫)，理理1.5寫



(h)

Question 5:
(a) Not balanced. Add Supply 5 (dummy), supply amount 2.
Penalty

15 5 8 3
6 12 13 6
5 1000 16 11
10 17 14 4
0 0 0 0
penalty 5 5 8
Ship: S3-D1 with 12 units, cost 60

Penalty
5 8 3
12 13 1
1000 16 984
17 14 3
0 0 0
penalty 5 8
Ship: S3-D3 with 1 units, cost 16
 7 Operations Research (I)
_______________________________________________________________________________
Penalty
5 8 3
12 13 1

17 14 3
0 0 0
penalty 5 8
Ship: S5-D3 with 2 units, cost 0

Penalty
5 8 3
12 13 1

17 14 3

penalty 7 5
Ship: S1-D2 with 7 units, cost 35

Penalty

12 13 1

17 14 3

penalty 5 1
Ship: S2-D2 with 1 units, cost 12

Penalty

13

14

penalty 1
Ship: S2-D3 with 5 units, cost 65
Ship: S4-D3 with 7 units, cost 98

Ship: Total shipping cost 286

有有dummy 得得2寫。
Prohibited成成成成用M，或寫或或或或或或成成得得1寫。

Penalty要要要要成，有要要要成得得2寫。

Solution(運運運運)完完完完得得2寫。

成成計 total transportation cost得得1寫。

 8 Operations Research (I)
_______________________________________________________________________________
=======================================
(b)
v1 = 0 v1 = 0
x31 ≠ 0 u3 + v1 = 5 v2 = 10
x12 ≠ 0 u1 + v2 = 5 v3 = 11
x22 ≠ 0 u2 + v2 = 12 u1 = −5
x23 ≠ 0 => u2 + v3 = 13 => u2 = 2
x33 ≠ 0 u3 + v3 = 16 u3 = 5
x43 ≠ 0 u4 + v3 = 14 u4 = 3
x53 ≠ 0 u5 + v 3 = 0 u5 = −11

Improvement index:
S1-D1: c11 − u1 − v1 = 15 − ( −5) − 0 = 20
S2-D1: c21 − u2 − v1 = 6 − 2 − 0 = 4
S4-D1: 7
S5-D1: 11
S3-D2: infinity
S4-D2: 4
S5-D2: 1
S1-D3: 2

Sol: the same.

Total cost: the same.

總總10寫

根根complementary pair寫計7條ui + vj = cij，得 2寫(寫或條錯1寫，寫3條條條0寫)

令令令或或或ui或vj等等0， 得 1寫

成計算有ui和vj， 得 3寫(寫或條錯1寫，寫3條條條0寫)

成計算有運算或improvement indexes (cij - ui - vj) ，得3寫(寫或條錯1寫，寫3條條條0寫)

成計total transportation cost， 得 1寫
(c)
all improvement indexes >= 0  Yes, optimal

回答Yes，1寫，解解解解(all improvement index >= 0)，1寫
 9 Operations Research (I)
_______________________________________________________________________________
Question 6:
(a)
BK BL G R Dummy Supply
Regular 8 6 5 9 0
950
produce
9 8 7 11 1
outsource 650

Demand 350 200 600 250 200 1600

 Tabular 2 分， Balance 2 分

(b)
BK BL G R Dummy Supply
Regular 8 6 5 9 0
950
produce 350 200 400
9 8 7 11 1
outsource 650
200 250 200
Demand 350 200 600 250 200 1600
4分

(c)
u1 = 0
u1 + v1 = 8 v1 = 8
u1 + v2 = 6 v2 = 6
u1 = 0
u1 + v3 = 5 v3 = 5 列試算出 u_i & v_j  3 分
u2 = 2
u2 + v3 = 7 => v4 = 9
u2 + v4 = 11 v5 = −1
u2 + v5 = 1
improvement index
c21=9-2-8 = -1
c22=0
c14=0 算出所有非基本變數的 improvement index 3 分
c15=1

BK BL G R Dummy Supply
Regular 8 6 5 9 0
950
produce 150 200 600
9 8 7 11 1
outsource 650
200 250 200
Demand 350 200 600 250 200 1600
 10 Operations Research (I)
_______________________________________________________________________________
u1 = 0
u1 + v1 = 8 v1 = 8
u1 + v2 = 6 v2 = 6
u1 = 0
u1 + v3 = 5 v3 = 5
u2 = 1
u2 + v1 = 9 => v4 = 10
u2 + v4 = 11 v5 = 0
u2 + v5 = 1
improvement index
c22=1
c23=1
c14=9-0-10=-1
c15=0

BK BL G R Dummy Supply
Regular 8 6 5 9 0
950
produce 200 600 150
9 8 7 11 1
Outsource 650
350 100 200
Demand 350 200 600 250 200 1600

u1 = 0
u1 + v2 = 6 v1 = 7
u1 + v3 = 5 v2 = 6
u1 = 0
u1 + v4 = 9 v3 = 5
u2 = 2
u2 + v1 = 9 => v4 = 9
u2 + v4 = 11 v 5 = −1
u 2 + v5 = 1
improvement index
c11=1
c22=0
c23=0
c15=1
all improvement indexes >= 0, optimal. Verify all improvement indexes >= 0 2分

Produce Blue 200 bags, Green 600 bags, red 150 bags.
Outsource Black 350 bags, Red 100 bags. ($9800) 生產計劃)
生產計劃
 Solution(生產計劃 2分
200 bags short for the Outsource contract. ($200)

Total cost = $10000  總成本 2分

 11 Operations Research (I)
_______________________________________________________________________________
Question 7:
(a) Not balanced! Add Job 5 (dummy) with zero costs.

Machine Machine Machine Machine Machine

Cost
A B C D E
Job 1 14
7 8 13 5
Job 2 5 6 13 12 2
Job 3 9 3 9 8 7
Job 4 10 6 9 4 2
Job 5 0 0 0 0 0

Machine Machine Machine Machine Machine

Cost
A B C D E
Job 1 7 8 13 5 14 5
Job 2 5 6 13 12 2 2
Job 3 9 3 9 8 7 3
Job 4 10 6 9 4 2 2
Job 5 0 0 0 0 0 0

Take minimum out from all rows and columns:

Machine Machine Machine Machine Machine

Cost E
A B C D
Job 1 2 3 8 0 9
Job 2 3 4 11 10 0
Job 3 6 0 6 5 4
Job 4 8 4 7 2 0
Job 5 0 0 0 0 0
Uncovered minimum = 2

Machine Machine Machine Machine Machine

Cost
A B C D E
Job 1 2 3 8 0 11
Job 2 1 2 9 8 0
Job 3 6 0 6 5 6
Job 4 6 2 5 0 0
Job 5 0 0 0 0 2
Uncovered minimum = 1
 12 Operations Research (I)
_______________________________________________________________________________
Machine Machine Machine Machine Machine
Cost
A B C D E
Job 1 1 3 7 0 11
Job 2 0 2 8 8 0
Job 3 5 0 5 5 6
Job 4 5 2 4 0 0
Job 5 0 1 0 1 3

總 寫，
(a) 8
增有Dummy (Job5) 寫)
每或每或每每每每每或每每每
(2
寫)

條每以以運每以以算有以,及令及及及
(2
寫)

每最最最
(2
寫)



(2

(b) Assignment cost = 5+5+3+2 =15 (2寫, 公公寫答公有寫 錯1寫)

 13 Operations Research (I)
_______________________________________________________________________________
Question 8:
(a)
14
2 4
10 2
1
7 29 6
7
4 9
3
5
3
圖完寫0寫
圖圖圖寫圖得1寫





圖完答得2寫
(b) Minimum Spanning tree (total weights = 23)

14
2 4
19 2
10
1
7 29 6
7
4 9
3
5
3
方方3寫(方方有要要寫圖得1寫，方方有每寫得2寫，方方完完3寫)
答答2寫( Minimum Spanning tree 1寫，total weights 1寫)

(c) Shortest path (total distance = 13)

14
2 4
19 10 2
1
7 29 6
7
4 9
3
5
3

方方3寫(方方有要要寫圖得1寫，方方有每寫得2寫，方方完完3寫)
答答2寫( Shortest Path 1寫，total distance 1寫)




 14 Operations Research (I)
_______________________________________________________________________________
Question 9:
(a)

A
3 3
Reservoir
5 C 2 Town
1 B
4 3
D E
2
圖完寫0寫
圖圖寫寫圖1寫

圖完答2寫

(b) Define xij as the flow volume from node i to j.

Max x RA + xRB
s.t.
x AC − x RA = 0,
xBC + x BD − xRB = 0,
xCT − x AC − x BC = 0,
xDE − x BD = 0,
xET − xDE = 0,
xRA ≤ 3,
xRB ≤ 1,
x AC ≤ 3,
或定定每 寫
目目公 寫

1 xBC ≤ 5,
流流流流公
2
寫


xBD ≤ 4,
Arc條流
2
寫

非非流流公
2
寫

xDE ≤ 2,

1
xCT ≤ 2,
xET ≤ 3,
xij ≥ 0
(c) R->A->C->T +2
R->B->D->E-> +1
Max amount of gas = 3 (30000 cube feet)

有有條運運，各4寫

每或運運3寫，每運運流流1寫

或或寫錯1寫錯得完

只有圖只只或只只只得流流 也寫答

(d) Minimum cut: {(R,B) , (C,T)}. Cut value = 3

cut內總有有或arcs，或或arc 1寫 (cut value寫成寫)
若 寫寫公寫有寫cut value=3,額額寫0.5寫

cut