A beer distributor needs to plan how to make deliveries from its warehouse (node 1) to a supermarket (node 7), as shown in the network below. A graph with 7 nodes and 9 arcs is shown. Node 1 is connected to node 2 by arc of value 3, to node 5 by arc of value 3, and to node 6 by arc of value 11. Node 2 is connected to node 3 by arc of value 4. Node 3 is connected to node 2 by arc of value 4 and to node 4 by arc of value 7. Node 4 is connected to node 3 by arc of value 7, to node 6 by arc of value 5, and to node 7 by arc of value 6. Node 5 is connected to node 6 by arc of value 7. Node 6 is connected to node 4 by arc of value 5, to node 5 by arc of value 7, and to node 7 by arc of value 3. Develop the LP formulation for finding the shortest route from the warehouse to the supermarket. (Let xij represent the flow from node i to node j.) Min s.t.Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows Node 7 Flows xij > 0 for all i and j
A beer distributor needs to plan how to make deliveries from its warehouse (node 1) to a supermarket (node 7), as shown in the network below. A graph with 7 nodes and 9 arcs is shown. Node 1 is connected to node 2 by arc of value 3, to node 5 by arc of value 3, and to node 6 by arc of value 11. Node 2 is connected to node 3 by arc of value 4. Node 3 is connected to node 2 by arc of value 4 and to node 4 by arc of value 7. Node 4 is connected to node 3 by arc of value 7, to node 6 by arc of value 5, and to node 7 by arc of value 6. Node 5 is connected to node 6 by arc of value 7. Node 6 is connected to node 4 by arc of value 5, to node 5 by arc of value 7, and to node 7 by arc of value 3. Develop the LP formulation for finding the shortest route from the warehouse to the supermarket. (Let xij represent the flow from node i to node j.) Min s.t.Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows Node 7 Flows xij > 0 for all i and j
Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter5: Network Models
Section: Chapter Questions
Problem 75P
Related questions
Question
A beer distributor needs to plan how to make deliveries from its warehouse (node 1) to a supermarket (node 7), as shown in the network below.
A graph with 7 nodes and 9 arcs is shown.
- Node 1 is connected to node 2 by arc of value 3, to node 5 by arc of value 3, and to node 6 by arc of value 11.
- Node 2 is connected to node 3 by arc of value 4.
- Node 3 is connected to node 2 by arc of value 4 and to node 4 by arc of value 7.
- Node 4 is connected to node 3 by arc of value 7, to node 6 by arc of value 5, and to node 7 by arc of value 6.
- Node 5 is connected to node 6 by arc of value 7.
- Node 6 is connected to node 4 by arc of value 5, to node 5 by arc of value 7, and to node 7 by arc of value 3.
Develop the LP formulation for finding the shortest route from the warehouse to the supermarket. (Let xij represent the flow from node i to node j.)
Min
s.t.Node 1 Flows
Node 2 Flows
Node 3 Flows
Node 4 Flows
Node 5 Flows
Node 6 Flows
Node 7 Flows
xij > 0 for all i and j
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 5 images
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question
I do appreciate the answer but that's not what the question was asking it's just asking for the equations for each one starting with the min x1+x2+x3 etc followed with nodes 1 through 7 with the same format please reassess the question and thank you I provided the model from the problem as an image If that helps.
Solution
by Bartleby Expert
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.Recommended textbooks for you
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,