Concept explainers
Find the repetitive nearest-neighbor tour (and give its cost) for the furniture truck TSP discussed in Exercise 29 and 37 (see Fig. 6-39)
A truck must deliver furniture to stores located in five different cities A, B, C, D, and E. The truck must start and end its route at A. The time (in hours) for travel between the cities is given in Fig. 6-39. Find an optimal tour for this TSP and give its cost in hours. (Hint: The edge AD is part of an optimal tour.)
This exercise refers to the furniture truck TSP introduced in Exercise 29 (see Fig. 6-39).
a. Find the nearest-neighbor tour starting at A.
b. Find the nearest-neighbor tour starting at B, and give the answer using A as the starting/ending city.
Want to see the full answer?
Check out a sample textbook solutionChapter 6 Solutions
Excursions in Modern Mathematics Plus MyLab Math -- Title-Specific Access Card Package (9th Edition)
- The Pimco New York Municipal Bond Fund (PNF) and the Fidelity Spartan Mass Fund (FDMMX) are tax-exempt municipal bond funds. In 2003, the Pimco fund yielded 6% while the Fidelity fund yielded 5%. You would like to invest a total of up to $70,000 and earn at least $3,600 in interest in the coming year (based on the given yields). Draw the feasible region that shows how much money you can invest in each fund. Find the corner points of the region.arrow_forwardIn 2015, the Phoenix/Zweig Advisors Zweig Total Return fund (ZTR) was expected to yield 5% and the Madison Asset Management Madison Strategic Sector Premium fund (MSP) was expected to yield 7%. You would like to invest a total of up to $60,000 and earn at least $3,500 in interest. Draw the feasible region that shows how much money you can invest in each fund (based on the given yields). Find the corner points of the region. Make sure you use a test point in your work. Shade the region(s) that is NOT the solution and label the region SOLUTION SET.arrow_forwardConsider an LP with the optimal tableau shown in table below. a)Does this LP have more than one BFS that is optimal?b)How many optimal solutions does this LP have? ( Hint: if the value of x3 increased, then how does this change the values of the basic variables and z-value?)arrow_forward
- we will be looking at the travels of a fictional circus with just a single touring unit. This Atlanta-based circus plans to visit 24 cities, listed in the table below. After visiting all of the cities, the circus will return to Atlanta. The goal of the circus is to find a good tour of all the cities; that is, to find a path that visits each city and then returns to its starting point. Of course, some tours are shorter than others, and the optimal tour is the one which covers the least total distance. Atlanta, GA Detroit, MI Lincoln, NE Phoenix, AZ Boston, MA Indianapolis, IN Minneapolis, MN Pittsburgh, PA Buffalo, NY Jacksonville, FL Nashville, TN Portland, OR Charlotte, NC Kansas City, MO New Orleans, LA Salt Lake City, UT Chicago, IL Las Vegas, NV Oakland, CA San Antonio, TX Cleveland, OH Lexington, KY Oklahoma City, OK San Diego, CA The raw city-to-city distance data (HW2data.xls) can be found in an Excel spreadsheet on Canvas. All distances are symmetric; the distance from city A…arrow_forwardConsider a maximization problem with the optimal tableauin the following table.z x1 x2 x3 x4 rhs1 2 1 0 0 100 3 2 1 0 30 4 3 0 1 5The optimal solution is obvious here, please determine the second best BFS to this LP.arrow_forwardScott and Associates, Inc., is an accounting firm that has three new clients. Project leaders will be assigned to the three clients. Based on the different backgrounds and experiences of the leaders, the various leader–client assignments differ in terms of projected completion times. The possible assignments and the estimated completion times in days are as follows: Requireda. Develop a network representation of this problem.b. Find the optimal solution using the Hungarian method. What is the total time required?arrow_forward
- Consider the LP Problem (attached image): (b) Write down the dual problem and find an optimal solution. Is it unique?arrow_forwardDraw a network showing the quantities obtained in the final iteration and the optimal value of z.arrow_forward1. What is the optimal value of x?2. What is the optimal value of y?arrow_forward
- A sales director who lives in city A is required to fly to regional offices in cities B, C, D, and E. The weighted graph shows the one-way airfares between any two cities. Use the Brute Force Method to find the optimal solution. Which Hamilton Circut is the most optimal? How much will the sales director make on the most optimal circut?arrow_forwardUse the minimum-entry and u-v methods to solve the following minimum-cost transportationproblem. Assuming there is no cost associated with the artificial warehouse or market.Use Bland’s rule to choose entering and leaving variables where variables/cells are ordered from topto bottom and left to right.arrow_forwardPlease help with iv v and vi with a step by step process on how we get the optimal tableauarrow_forward
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage