A traveler is trying to determine the fastest way to travel from city A to city Z. The possible travel routes, with the time required foreach segment, is shown below.T4T3T6T2TSTimeT1T2T3T4T5T6T7Duration495275635657What is the shortest path and what is the shortest possible time to travel from A to Z? (Round your answer to the nearest wholenumber.)Shortest pathShortest durationA,

Introduction with Critical Path During product development, the critical path is the greatest series…

Answered: A traveler is trying to determine the…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter6: Optimization Models With Integer Variables

Section6.5: Set-covering And Location-assignment Models

Problem 29P

See similar textbooks

Similar questions

A travelling salesman, named Magan Shah plans to visit five cities 1, 2, 3, 4 and 5. The travel time (in hours) between these cities is shown below. To city 1 2 3 4 5 From city 1 x 5 8 4 5 2 5 x 7 4 5 3 8 7 x 8 6 4 4 4 8 x 8 5 5 5 6 8 x How should he schedule his touring plan in order to minimize the total travel time, if he visits each city once a week?
The distance between two cities in the United States can be approximated by the following formula, where lat1 and long1 are the latitude and longitude of city 1 and lat2 and long2 are the latitude and longitude of city 2. 69 (lat1 − lat2)2 + (long1 − long2)2 Ted's daughter is getting married, and he is inviting relatives from 15 different locations in the United States. The file Wedding gives the longitude, latitude, and number of relatives in each of the 15 locations. Ted would like to find a wedding location that minimizes the demand-weighted distance, where demand is the number of relatives at each location. Assuming that the wedding can occur anywhere, find the latitude and longitude of the optimal location. (Hint: Notice that all longitude values given for this problem are negative. Make sure that you do not check the option for Make Unconstrained Variables Non-Negative in Solver. Round your answers to three decimal places.) latitude of the optimal wedding location:…
We illustrated how a machine replacement problem can be modeled as a shortest path problem. This is probably not the approach most people would think of when they first see a machine replacement problem. In fact, most people would probably never think in terms of a network. How would you model the problem? Does your approach result in an LP model?
For the following linear programming problem, determine the optimal solution using the graphical solution method. Max −X + 2Y s.t. 6X − 2Y ≤ 3 −2X + 3Y ≤ 8 X + Y ≤ 3 X, Y ≥ 0 (X, Y) =
At the end of a cycle of schedules, a trucking firm has a surplus of one vehicle each in cities A, B, C, D, E, and F and a deficit of one vehicle each in cities 1, 2, 3, 4, 5, and 6. The distances between cities with a surplus and the cities with a deficit are shown below. Find an assignment of surplus vehicles to deficit cities that will result in a minimum total distance. What is the total distance? -Solve the following transportation models using Excel Solver. -Find the optimal solution for the transportation problem having the cost and requirement tablebelow.
Instructions: Solve using Excel Solver. Create the linear programming model and get the optimal solution to the problem. (Follow the steps and format in the photo below) 1. A company manufactures two products X1 and X2 on three machines A, B, and C. X1 requires 1 hour on machine A and 1hour on machine B and yields a revenue of Php 30. Product X2 requires 2 hours on machine A and 1 hour on machine B and 1 hour on machine C and yields revenue of PhP 50. In the coming planning period the available time of three machines A, B, and C are 2000 hours, 1500 hours and 600 hours respectively. Find the optimal product mix.
A minimum-cost flow problem has 8 supply nodes, 0 transshipment nodes, and 3 demand nodes. If each supply node can ship to every demand node, how many arcs will be included in the model?
The Sav-Us Rental Car Agency has six lots in Nashville, and it wants to have a certain number of cars available at each lot at the beginning of each day for local rental. The agency would like a model it could quickly solve at the end of each day that would tell it how to redistribute the cars among the six lots in the minimum total time. The times required to travel between the six lots are as follows: To (min.) From 1 2 3 4 5 6 1 12 17 18 10 20 2 14 10 19 16 15 3 14 10 12 8 9 4 8 16 14 12 15 5 11 21 16 18 10 6 24 12 9 17 15 The agency would like the following number of cars at each lot at the end of the day. Also, shown is the number of available cars at each lot at the end of a particular day. Determine the optimal reallocation of rental cars. Lot (cars) Cars 1 2 3 4 5 6 Available 37 20 14 26 40 28…
A company imports goods at two ports: Philadelphia and New Orleans. Shipments of one product are made to customers in Atlanta, Dallas, Columbus, and Boston. For the next planning period, the supplies at each port, customer demands, and shipping costs per case from each port to each customer are as follows: Customers Port Atlanta Dallas Columbus Boston Port Supply Philadelphia 2 6 6 2 5,000 New Orleans 1 2 5 7 3,000 Demand 1,400 3,200 2,000 1,400 Develop a network representation of the distribution system. Develop the objective function and the constraints.
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. Which type of network optimization problem is used to solve this problem? Multiple Choice: Minimum Flow Problem Average-Cost Flow problem Maximum Flow Problem Shortest Path Problem Maximum-Cost Flow problem
Transeast Airlines flies planes on the following route:L.A.–Houston–N.Y.–Miami–L.A. The length (in miles) ofeach segment of this trip is as follows: L.A.–Houston, 1,500miles; Houston–N.Y., 1,700 miles; N.Y.–Miami, 1,300miles; Miami–L.A., 2,700 miles. At each stop, the planemay purchase up to 10,000 gallons of fuel. The price of fuelat each city is as follows: L.A., 88¢; Houston, 15¢; N.Y.,$1.05; Miami, 95¢. The plane’s fuel tank can hold at most12,000 gallons. To allow for the possibility of circling overa landing site, we require that the ending fuel level for eachleg of the flight be at least 600 gallons. The number ofgallons used per mile on each leg of the flight is1 (average fuel level on leg of flight/2,000)Review Problems 123To simplify matters, assume that the average fuel level onany leg of the flight isFormulate an LP that can be used to minimize the fuel costincurred in completing the schedule
How would you write the optimal solution for these?

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