Chapter 7

Question 1

Arc

Answer 1

line in network represent a path or route, connect nodes in network

Question 2

node

Answer 2

point/circle in network

Question 3

Sink

Answer 3

final node (demand)

Question 4

Sunk

Answer 4

beginning node (supply)

Question 5

Network

Answer 5

the whole diagram of arcs and nodes

Question 6

Minimal Spanning tree

Answer 6

objective of connecting all nodes with minimum distance

Question 7

shortest route problem

Answer 7

objective of finding shortest distance to another and all starting from the origin

Question 8

Permanent set

Answer 8

nodes for which shortest route has been found

Question 9

are loops allowed in MST or SRP problems

Answer 9

no loops allowed at all

Question 10

Assumptions for shortest route problem formulation

Answer 10

arc lengths non-negative, only can flow from low node to higher node

Question 11

what is Xij =1

Answer 11

1 if arc from node i to node j is on shortest route

Question 12

what is Xij = 0

Answer 12

0 if arc from node i to node j is not on shortest route

Question 13

What is the number in SRP is the same

Answer 13

just pick one

Question 14

Is the minimal spanning tree unique

Answer 14

no it is not always unique

Question 15

is the minimal spanning tree distance unique

Answer 15

yes this is always unique