Shortest Path Model (Learn under DR. TAN CHIN LUNG).xlsx

	B	C	D	E	G	H	I	J
1
2	Shortest path model
3
4	Network structure and flows				Flow balance constraints
5	Origin	Destination	Distance	Flow	Node	Net outflow	Sign	Required net outflow
6	1	2	70	0	1	1	=	1
7	1	3	63	0	2	0	=	0
8	1	4	56	1	3	0	=	0
9	2	3	25	0	4	0	=	0
10	2	4	19	0	5	0	=	0
11	2	5	73	0	6	0	=	0
12	2	6	50	0	7	0	=	0
13	2	7	79	0	8	0	=	0
14	3	2	25	0	9	0	=	0
15	3	4	29	0	10	-1	=	-1
16	3	5	69	0
17	3	6	61	0
18	4	2	19	0
19	4	3	29	0
20	4	5	67	0
21	4	6	45	1
22	4	9	85	0
23	5	6	18	0
24	5	7	67	0
25	5	8	69	0
26	5	9	54	0
27	5	10	87	0
28	6	5	18	0
29	6	7	72	0
30	6	8	52	0
31	6	9	51	0
32	6	10	97	1
33	7	8	17	0
34	7	9	31	0
35	7	10	72	0
36	8	7	17	0
37	8	9	15	0
38	9	7	31	0
39	9	8	15	0
40	9	10	69	0
41
42	Objective to minimize
43	Total distance	198
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100