Description
attached the help sheets.
The actual problems needs to be complete are the attachment that say " Problems week 6"
Problems require that you use Excel QM, however some chapters will require you to use the Solver Add-In for Excel (regression) or simply type in formulas and make calculations. The answers must be submitted to D2L in a Microsoft Word or Microsoft Excel file.
You must state your answers within a complete sentence so that your understanding of applying the results of the computations can be observed. You should also include the work for your computation; this will assist in applying partial credit if your answers are
not correct.
the textbook:
Problems:
12 and 23. Using QM Excel.
39, 40, 41. Using QM Excel
Unformatted Attachment Preview
Purchase answer to see full attachment
Explanation & Answer
Hello there,As promised to you I finished your task. I am attaching to this message a Microsoft Word file entitled " Final version for Management Analysis " which contains your step by step guide and also a Microsoft Excel file entitled " Nodes Excel" which contains the excel problems (they are also available in the word file).There were a total of 5 problems: 12, 23, 39, 40, 41What is written in bold in the word file is the task's textWhat is in italic is the answer (step by step)What is highlighted in yellow is either a very important value or a final answerWhat is written in tables is a formula I applied.The last page contains a step by step guide on how to solve similar problem ( explaining each step and made several print screens for a better understanding)---The normal format didn't bother to put it in APA because I suppose you don't need it. All the steps of how I reached the answers are included.Number of pages: 24---Please take a look and tell me if this is what you needed (which i suppose it is haha)
A
B
C
D
E
F
G
H
I
J
K
1
2
3
Grey Construction
4
5
Least expensive
6
7
8
9
10 Data -Price Table
11 From\to
Node 1
Node 2
Node 3
Node 4
Node 5
Node 6
Node 7
Node 8
Node 9
12 Node 1
0
5
6
6
5
0
0
0
0
13 Node 2
0
0
0
0
0
7
0
0
0
14 Node 3
0
0
0
0
0
0
5
0
0
15 Node 4
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
7
0
1
0
0
0
4
0
0
0
0
0
0
6
2
16
17
18
19
Node 5
Node 6
Node 7
Node 8
A
B
20 Node 9
21
22 Start=1,Finish=-1
23
24 Flows
25
26
27
28
29
30
31
32
33
34
Node 1
Node 2
Node 3
Node 4
Node 5
Node 6
Node 7
Node 8
Node 9
35 Inflow
36 Outflow
37 Net Outflow
38
39 Minimum distance
From\to
C
D
E
F
G
H
I
J
K
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
-1
Node 1
Node 2
Node 3
Node 4
Node 5
1
Node 6
Node 7
Node 8
Node 9
1
1
1
1
1
11
1
1
1
1
Outflow
1
1
-1
1
L
M
N
O
P
Q
R
START
NODE
END
NODE
COST
($100s)
1
2
5
1
3
6
1
4
6
1
5
5
2
6
7
3
7
5
4
7
7
5
8
4
6
7
1
7
9
6
8
9
2
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
Data problem
BRAN
CH
Branch
1
Branch
2
Branch
3
Branch
4
Branch
5
Branch
6
Branch
7
Branch
8
Branch
9
Branch
10
Branch
11
A
B
C
D
E
F
G
H
I
J
K
1
2
3
BGrey Construction
4
5
Least expensive
6
7
8
9
10 Data - Price Table
11 From\to
Node 1
Node 2
Node 3
Node 4
Node 5
Node 6
Node 7
Node 8
Node 9
12 Node 1
0
5
1
1
1
0
0
0
0
13 Node 2
0
0
0
0
0
7
0
0
0
14 Node 3
0
0
0
0
0
0
5
0
0
15 Node 4
0
0
0
0
0
0
7
0
0
16 Node 5
0
0
0
0
0
0
0
4
0
17 Node 6
0
0
0
0
0
0
1
0
0
18 Node 7
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
6
2
19 Node 8
A
B
20 Node 9
21
22 Start=1,Finish=-1
23
24 Flows
25
26
27
28
29
30
31
32
33
34
From\to
C
D
E
F
G
H
I
J
K
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
-1
Node 1
Node 2
Node 3
Node 4
Node 5
1
Node 6
Node 7
Node 8
Node 9
Node 1
Node 2
Node 3
Node 4
Node 5
Node 6
Node 7
Node 8
Node 9
35 Inflow
36 Outflow
37 Net Outflow
1
1
38
39 Minimum distance
7
1
1
1
1
1
1
1
Outflow
1
1
-1
1
L
M
N
O
P
Q
R
START
NODE
END
NODE
COST
($100s)
1
2
5
1
3
1
1
4
1
1
5
1
2
6
7
3
7
5
4
7
7
5
8
4
6
7
1
7
9
6
8
9
2
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
Problem Data
BRAN
CH
Branch
1
Branch
2
Branch
3
Branch
4
Branch
5
Branch
6
Branch
7
Branch
8
Branch
9
Branch
10
Branch
11
A
B
C
D
E
F
G
H
I
J
1
2
3
AQuincy to Old Bainbridge
4
5
Shortest Path
6
7
8
9
10 Data - Distance Table
11 From\to
Nodes 1
Nodes 2
Nodes 3
Nodes 4
Nodes 5
Nodes 6
Nodes 7
Nodes 8
12 Nodes 1
0
3
2
0
0
0
0
0
13 Nodes 2
0
0
0
3
0
0
0
0
14 Nodes 3
0
0
0
0
3
0
0
0
15 Nodes 4
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
4
0
0
0
2
2
0
0
3
16 Nodes 5
17 Nodes 6
A
18
19
20
21
22
23
B
Nodes 7
Nodes 8
C
D
E
F
G
H
I
J
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
6
0
-1
Nodes 1
Nodes 2
1
Nodes 3
Nodes 4
Nodes 5
Nodes 6
Nodes 7
Nodes 8
Start=1,Finish=-1
Flows
24
25
26
27
28
29
30
31
32
Nodes 1
Nodes 2
Nodes 3
Nodes 4
Nodes 5
Nodes 6
Nodes 7
Nodes 8
33 Inflow
34 Outflow
35 Net Outflow
36
37 Minimum distance
From\to
1
1
1
1
1
1
13
1
1
1
1
1
1
Outflow
1
1
1
-1
1
K
L
M
N
O
P
START
NODE
END
NODE
D...