4/19/23, 1 1:08 PM Quiz 2: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANAL YTICS (OPTIMIZA TION)
https://dlsu.instructure.com/courses/1 19651/quizzes/317567 1/33Quiz 2
Due Mar 21 at 10:45am Points 40 Questions 40
Available Mar 21 at 9:15am - Mar 21 at 10:50am 1 hour and 35 minutes
Time Limit 90 Minutes
Instructions
This quiz was locked Mar 21 at 10:50am.
Attempt History
Attempt Time Score
LATEST Attempt 1 53 minutes 38 out of 40
Score for this quiz: 38 out of 40
Submitted Mar 21 at 10:07am
This attempt took 53 minutes.Choose the correct answer . pts Question 1
Which of the following will have negative net flow in a minimum cost flow
problem? Arc capacities Demand nodes Correct!Correct! Transshipment nodes Storage nodes Course Chat 4/19/23, 1 1:08 PM Quiz 2: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANAL YTICS (OPTIMIZA TION)
https://dlsu.instructure.com/courses/1 19651/quizzes/317567 2/ pts Question 2
The figure below shows the possible routes from city A to city M as well as
the cost (in dollars) of a trip between each pair of cities (note that if no arc
joins two cities it is not possible to travel non-stop between those two
cities). A traveler wishes to find the lowest cost option to travel from city A
to city M.
What is the cost of the connection between nodes K and I? 16 21 11 Correct!Correct! 9 pts Question 3
In a minimum cost flow problem there can be only one supply node and
only one demand node.
S e n d 4/19/23, 1 1:08 PM Quiz 2: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANAL YTICS (OPTIMIZA TION)
https://dlsu.instructure.com/courses/1 19651/quizzes/317567 3/33 No answer text provided. No answer text provided. True False Correct!Correct! pts Question 4
A manufacturing firm has three plants and wants to find the most ef ficient
means of meeting the requirements of its four customers. The relevant
information for the plants and customers, along with shipping costs in
dollars per unit, are shown in the table below: Customer (requirement)
Factory
(capacity)Customer 1
(25)Customer 2
(50)Customer 3
(125)Customer 4
(75)
A (100) $ 15 $10 $20 $17 B (75) $ 20 $12 $19 $20 C (100) $ 22 $20 $25 $14 Which type of network optimization problem is used to solve this problem? 4/19/23, 1 1:08 PM Quiz 2: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANAL YTICS (OPTIMIZA TION)
https://dlsu.instructure.com/courses/1 19651/quizzes/317567 4/33 Minimum-Cost Flow problem Correct!Correct! Assignment Problem Minimum Flow Problem Maximum-Cost Flow problem pts Question 5
A manufacturing firm has three plants and wants to find the most ef ficient
means of meeting the requirements of its four customers. The relevant
information for the plants and customers, along with shipping costs in
dollars per unit, are shown in the table below: Customer (requirement)
Factory
(capacity)Customer 1
(25)Customer 2
(50)Customer 3
(125)Customer 4
(75)
A (100) $ 15 $10 $20 $17 B (75) $ 20 $12 $19 $20 C (100) $ 22 $20 $25 $14 How many supply nodes are present in this problem? 4 2
https://dlsu.instructure.com/courses/1 19651/quizzes/317567 1/33Quiz 2
Due Mar 21 at 10:45am Points 40 Questions 40
Available Mar 21 at 9:15am - Mar 21 at 10:50am 1 hour and 35 minutes
Time Limit 90 Minutes
Instructions
This quiz was locked Mar 21 at 10:50am.
Attempt History
Attempt Time Score
LATEST Attempt 1 53 minutes 38 out of 40
Score for this quiz: 38 out of 40
Submitted Mar 21 at 10:07am
This attempt took 53 minutes.Choose the correct answer . pts Question 1
Which of the following will have negative net flow in a minimum cost flow
problem? Arc capacities Demand nodes Correct!Correct! Transshipment nodes Storage nodes Course Chat 4/19/23, 1 1:08 PM Quiz 2: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANAL YTICS (OPTIMIZA TION)
https://dlsu.instructure.com/courses/1 19651/quizzes/317567 2/ pts Question 2
The figure below shows the possible routes from city A to city M as well as
the cost (in dollars) of a trip between each pair of cities (note that if no arc
joins two cities it is not possible to travel non-stop between those two
cities). A traveler wishes to find the lowest cost option to travel from city A
to city M.
What is the cost of the connection between nodes K and I? 16 21 11 Correct!Correct! 9 pts Question 3
In a minimum cost flow problem there can be only one supply node and
only one demand node.
S e n d 4/19/23, 1 1:08 PM Quiz 2: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANAL YTICS (OPTIMIZA TION)
https://dlsu.instructure.com/courses/1 19651/quizzes/317567 3/33 No answer text provided. No answer text provided. True False Correct!Correct! pts Question 4
A manufacturing firm has three plants and wants to find the most ef ficient
means of meeting the requirements of its four customers. The relevant
information for the plants and customers, along with shipping costs in
dollars per unit, are shown in the table below: Customer (requirement)
Factory
(capacity)Customer 1
(25)Customer 2
(50)Customer 3
(125)Customer 4
(75)
A (100) $ 15 $10 $20 $17 B (75) $ 20 $12 $19 $20 C (100) $ 22 $20 $25 $14 Which type of network optimization problem is used to solve this problem? 4/19/23, 1 1:08 PM Quiz 2: [1222_LBOMGTS_K46] - PRESCRIPTIVE ANAL YTICS (OPTIMIZA TION)
https://dlsu.instructure.com/courses/1 19651/quizzes/317567 4/33 Minimum-Cost Flow problem Correct!Correct! Assignment Problem Minimum Flow Problem Maximum-Cost Flow problem pts Question 5
A manufacturing firm has three plants and wants to find the most ef ficient
means of meeting the requirements of its four customers. The relevant
information for the plants and customers, along with shipping costs in
dollars per unit, are shown in the table below: Customer (requirement)
Factory
(capacity)Customer 1
(25)Customer 2
(50)Customer 3
(125)Customer 4
(75)
A (100) $ 15 $10 $20 $17 B (75) $ 20 $12 $19 $20 C (100) $ 22 $20 $25 $14 How many supply nodes are present in this problem? 4 2
