Problem 15162.522,5342363522687Find the shortest(min cost) path FromNode 1 to Node 7. Possible answer is16. Try to solve it the same way wedid problem 1 and 2.

Network Flow Models- Consist of a network of sources and destinations. These are represented with…

Answered: 1 2.5 2 3 2.5 2 3 6 5 2 8 7 7 Find the…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter5: Network Models

Section5.5: Shortest Path Models

Problem 30P

See similar textbooks

Similar questions

(1) Find an optimal assignment of trucks to routes to minimize the total cost (using the Hungarian Method). B C 6 12 15 10 11 7 16 9 Truck / Route 1 2 3 4 Step la: Row subtraction (show your steps, e.g., see cell 1A) Truck / Route B 1 2 3 4 A 10 11 9 14 Step 1b: Column subtraction. Truck / Route 1 2 3 4 A 10-6=4 = = = = = B = с = C Step 2: Testing for optimal solution (show your lines covering the zero entries). What is the minimum number of lines required to cover all zeros? D 8 14 10 13 D = = D =
9-43. Northwest University is in the process of complet-ing a computer bus network that will connect com-puter facilities throughout the university. The prime objective is to string a main cable from one endof the campus to the other (nodes 1–25) throughunderground conduits. These conduits are shownin the network below; the distance between them isin hundreds of feet. Fortunately, these undergroundconduits have remaining capacity through which thebus cable can be placed.(a) Given the network for this problem, how long (inhundreds of feet) is the shortest route from node1 to node 25?(b) In addition to the computer bus network, a newphone system is also being planned. The phonesystem would use the same underground conduits. If the phone system were installed, the follow-ing paths along the conduit would be at capacity and would not be available for the computer busnetwork: 6–11, 7–12, and 17–20. What changes(if any) would you have to make to the pathused for the computer bus if the phone…
Consider the following transshipment network for finding the shortest route from node 1 to node 7. Min s.t. Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows (a) Formulate a linear programming model of the problem. (Express your answers using Xi where each X;; is either 0 or 1 for the arc from node i to node j.) Node 6 Flows Node 7 Flows 9 For all X₁, = 0, 1. 18 w 3 4 5 6 7
Suppose as many as 300 cars per hour can travelbetween any two of the cities 1, 2, 3, and 4. Set up amaximum-flow problem that can be used to determine howmany cars can be sent in the next two hours from city 1 tocity 4. (Hint: Have portions of the network represent t 0,t 1, and t 2.)
eBook Problem 10-31 A long-distance telephone company uses a fiber-optic network to transmit phone calls and other information between locations. Calls are carried through cable lines and switching nodes. A portion of the company's transmission network is shown here. The numbers above each arc show the capacity in thousands of messages that can be transmitted over that branch of the network. To keep up with the volume of information transmitted between origin and destination points, use the network to determine the maximum number of messages that may be sent from a city located at node 1 to a oty located at node 7. 3 Maximum number of messages -
please do it in excel BETTER PRODUCTS COMPANY has decided to start manufacturing four new products in three plants that currently have excess production capacity. The products require comparable production effort per unit, so the available production capacity in the plants is measured by the number of units of any product that can be manufactured per day. a)Formulate this problem as a transportation problem by constructing the appropriate parameter table. Note:One image is of the data and the other image is option 1 to solve the exercise.
Jk.335. Propiem 14-8 Rent'R Cars is a multisite car rental company in the city. It is trying out a new "return the car to the location most convenient for you" policy to improve customer service. But this means that the company has to constantly move cars around the city to maintain required levels of vehicle availability. The supply and demand for economy cars, and the total cost of moving these vehicles between sites, are shown below. From To A B C Demand D $9 9 5 50 From/To $8 Candidate solution A B C Total shipped Cost A - B C Total costs 8 3 60 $6 8 3 25 $5 D 0 10 a. Find the solution that minimizes moving costs using Microsoft Excel. (Leave no cells blank - be certain to enter "0" wherever required.) Supply 50 40 75 30 165 165 E F G Supply $
A company with a network of 10 pipelines transports mango juice according to the details shown in Table 1. Determine the maximum flow per hour. 1. Table/Jadual 1 Сарacity Node Node (m3/h) 140 100 120 100 120 80 110 100 100 100 Reverse Capacity |(m³/h) 60 20 40 40 40 20 30 40 60 60 Start End Pipeline 1 2 3 4 1 1 1 2 3 4 6 6 7 3 7 7 8 8 10
Consider the following network representation of a transportation problem. Let Min 40 s.t. 35 Supplies From Jefferson City From Omaha To Des Moines Jefferson City To Kansas City Omaha To St. Louis 14 9 8 X11 = amount shipped from Jefferson City to Des Moines X12 = amount shipped from Jefferson City to Kansas City X13 = amount shipped from Jefferson City to St. Louis X21 amount shipped from Omaha to Des Moines X22 = amount shipped from Omaha to Kansas City X23 = amount shipped from Omaha to St. Louis 8 11 24 The supplies, demands, and transportation costs per unit are shown on the network. (a) Develop a linear programming model for this problem; be sure to define the variables in your model. Des Moines Kansas City St. Louis 25 10 40 Demands
Please I want to solve the point 3
Maximization Problem: A taxi company has several ride requests from across the city. The company wants to dispatch the taxis in a way that makes the most money. Assign taxis to routes such that the profit is maximized. Taxi 1 2 3 4 Ride 1 11 9 10 1 2 1 9 3 13 3 5 8 5 12 4 8 1 10 11
Maximal flow problem. Determin the Maximal flow from node 1 to 7

SEE MORE QUESTIONS

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,

SEE MORE TEXTBOOKS

1 2.5 2 3 2.5 2 3 6 5 2 8 7 7 Find the shortest(min cost) path From Node 1 to Node 7. Possible answer is 16. Try to solve it the same way we did problem 1 and 2.