Practical Management Science
6th Edition
ISBN: 9781337406659
Author: WINSTON, Wayne L.
Publisher: Cengage,
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 6.5, Problem 24P
Summary Introduction
To modify: The model and find the optimal solution using solver.
Introduction: The variation between the present value of the
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
given the transportation problem, assume that the demands at the 4 destinations are 5, 5, 7, and 8 units, respectively, and the supplies at the 4 sources are 7, 3, 7 and 8 units, respectively.C₁₁=7ㅤ C₁₂=9ㅤ C₁₃ = 1ㅤ C₁₄ = 10
C₂₁= 22ㅤ C₂₂ = 25ㅤ C₂₃ = 16ㅤ C₂₄ = 26
С₃₁ = 28ㅤ C₃₂ = 32ㅤ C₃₃ = 24ㅤ Сз₄ = 32
C₄₁ = 12ㅤ C₄₂ = 14ㅤ C₄з = 6ㅤ C₄₄ = 16where m=4, n=4what is the optimal solution using vogel's approximation method, least-cost method, and northwest-corner rule?
Obtain the initial basic feasible solution using all the three methods.
PLEASE SHOW ALL FORMULA
PharmaCo wants to determine how to deploy sales representatives across its Western U.S. region to support a new drug for obesity. Sales representatives will be located in a "home city", which they serve, in addition to cities with feasible commuting distance, with the objective that all cities must be served by at least one sales representative. The feasible connections between each city in the region are listed below (1 indicates a feasible connection, potential home cities are shown in columns, and cities served in rows):
Potential Rep Home
City Served?
Albuquerque
El Paso
Denver
Phoenix
San Diego
Los Angeles
San Francisco
Portland
Seattle
Las Vegas
Salt Lake City
Albuquerque
1
1
1
1
0
0
0
0
0
0
0
El Paso
1
1
0
1
0
0
0
0
0
0
0
Denver
1
0
1
1
0
0
0
0
0
0
1
Phoenix
1
1
1
1
1
1
0
0
0
1
1
San Diego
0
0
0
1
1
1…
Chapter 6 Solutions
Practical Management Science
Ch. 6.3 - Prob. 1PCh. 6.3 - Prob. 2PCh. 6.3 - Solve Problem 1 with the extra assumption that the...Ch. 6.3 - Prob. 4PCh. 6.3 - Prob. 5PCh. 6.3 - Prob. 6PCh. 6.3 - Prob. 7PCh. 6.3 - Prob. 8PCh. 6.3 - Prob. 9PCh. 6.3 - Prob. 10P
Ch. 6.4 - Prob. 11PCh. 6.4 - Prob. 12PCh. 6.4 - Prob. 13PCh. 6.4 - Prob. 14PCh. 6.4 - Prob. 15PCh. 6.4 - Prob. 16PCh. 6.4 - Prob. 17PCh. 6.4 - Prob. 18PCh. 6.4 - Prob. 19PCh. 6.4 - Prob. 20PCh. 6.4 - Prob. 21PCh. 6.4 - Prob. 22PCh. 6.4 - Prob. 23PCh. 6.5 - Prob. 24PCh. 6.5 - Prob. 25PCh. 6.5 - Prob. 26PCh. 6.5 - Prob. 28PCh. 6.5 - Prob. 29PCh. 6.5 - Prob. 30PCh. 6.5 - In the optimal solution to the Green Grass...Ch. 6.5 - Prob. 32PCh. 6.5 - Prob. 33PCh. 6.5 - Prob. 34PCh. 6.5 - Prob. 35PCh. 6.6 - Prob. 36PCh. 6.6 - Prob. 37PCh. 6.6 - Prob. 38PCh. 6 - Prob. 39PCh. 6 - Prob. 40PCh. 6 - Prob. 41PCh. 6 - Prob. 42PCh. 6 - Prob. 43PCh. 6 - Prob. 44PCh. 6 - Prob. 45PCh. 6 - Prob. 46PCh. 6 - Prob. 47PCh. 6 - Prob. 48PCh. 6 - Prob. 49PCh. 6 - Prob. 50PCh. 6 - Prob. 51PCh. 6 - Prob. 52PCh. 6 - Prob. 53PCh. 6 - Prob. 54PCh. 6 - Prob. 55PCh. 6 - Prob. 56PCh. 6 - Prob. 57PCh. 6 - Prob. 58PCh. 6 - Prob. 59PCh. 6 - Prob. 60PCh. 6 - Prob. 61PCh. 6 - Prob. 62PCh. 6 - Prob. 63PCh. 6 - Prob. 64PCh. 6 - Prob. 65PCh. 6 - Prob. 66PCh. 6 - Prob. 67PCh. 6 - Prob. 68PCh. 6 - Prob. 69PCh. 6 - Prob. 70PCh. 6 - Prob. 71PCh. 6 - Prob. 72PCh. 6 - Prob. 73PCh. 6 - Prob. 74PCh. 6 - Prob. 75PCh. 6 - Prob. 76PCh. 6 - Prob. 77PCh. 6 - Prob. 78PCh. 6 - Prob. 79PCh. 6 - Prob. 80PCh. 6 - Prob. 81PCh. 6 - Prob. 82PCh. 6 - Prob. 83PCh. 6 - Prob. 84PCh. 6 - Prob. 85PCh. 6 - Prob. 86PCh. 6 - Prob. 87PCh. 6 - Prob. 88PCh. 6 - Prob. 89PCh. 6 - Prob. 90PCh. 6 - Prob. 91PCh. 6 - Prob. 92PCh. 6 - This problem is based on Motorolas online method...Ch. 6 - Prob. 94PCh. 6 - Prob. 95PCh. 6 - Prob. 96PCh. 6 - Prob. 97PCh. 6 - Prob. 98PCh. 6 - Prob. 99PCh. 6 - Prob. 100PCh. 6 - Prob. 1CCh. 6 - Prob. 2CCh. 6 - Prob. 3.1CCh. 6 - Prob. 3.2CCh. 6 - Prob. 3.3CCh. 6 - Prob. 3.4CCh. 6 - Prob. 3.5CCh. 6 - Prob. 3.6C
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.Similar questions
- Explain how to determine the number of variables and constraints that would be in a transportation problem simplyby knowing the number of sources and the number of destinations.arrow_forwardA person starting in Columbus must visit Great Falls, Odessa, and Brownsville, and then return home to Columbus in one car trip. The road mileage between the cities is shown. Columbus Great Falls Odessa Brownsville Columbus --- 102 79 56 Great Falls 102 --- 47 69 Odessa 79 47 --- 72 Brownsville 56 69 72 --- a)Draw a weighted graph that represents this problem in the space below. Use the first letter of the city when labeling each b) Find the weight (distance) of the Hamiltonian circuit formed using the nearest neighbor algorithm. Give the vertices in the circuit in the order they are visited in the circuit as well as the total weight (distance) of the circuit.arrow_forwardPlease show the solution to the corresponding answer stated in the problem.arrow_forward
- 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:…arrow_forwardAt 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.arrow_forwardA chain of home health care firms in Louisiana needs to locate a central office from which to conduct internal audits and other periodic reviews of its facilities. These facilities are scattered throughout the state, as detailed in the following table. Each site, except for Houma, will be visited three times each year by a team of workers, who will drive from the central office to the site. Houma will be visited five times a year. City Covington Donaldsonville X= Houma Monroe Natchitoches New Iberia Map Coordinates X 9.4 7.1 7.6 5.2 2.8 5.3 Y 3.2 2.5 Opelousas Ruston For the location of the new central office, the coordinates should be near: 5.2 3.6 1.7 8.1 6.8 2.1 3.3 8.5 y= c.) The center-of-gravity approach minimizes the distance traveled assuming straight lines. This approach ignores geographical features that would tend to violate the straight line constraint such as (select all that apply): A.) Rivers B.) Trips C.) Non-Straight Roads D.) Bridgesarrow_forward
- Suppose the company has received a proposal for setting up another warehouse (Warehouse E) with a capacity of 900 units. The location of the warehouse is such that the unit costs of transporting to the six cities are as follows: Hyderabad–45, Mysore– 75, Chennai–30, Kochi–65, Pune–90 and Vizag–80. The company would like to know how the allocation will change if the warehouse is made operational and the likely cost impact on the operation of the system.arrow_forwardConsider the following transportation problem (cost in rupees). Find the initial solution by using Vogel’sApproximation method and perform optimality test using MODI Methodarrow_forward1. True/FalseA company wants to hire 4 vendors for the sale of 4 products, they could only sell one type of product. The following table (image) indicates what each seller charges for selling each of the products. The company wants to assign each seller a product, find all possible optimal assignments by pinpointing their optimal cost. answer the following:a) It is an allocation model T() F()b) It is not a transportation model T() F()c) The model is not balanced T() F()d) The problem has exactly 24 feasible points T() F()arrow_forward
- Companies A, B, and C supply components to three plants (F, G, and H) via two crossdocking facilities (D and E). It costs $4 to ship from D regardless of final destination and $3 to ship to E regardless of supplier. Shipping to D from A, B, and C costs $3, $4, and $5, respectively, and shipping from E to F, G, and H costs $10, $9, and $8, respectively. Suppliers A, B, and C can provide 200, 300 and 500 units respectively and plants F, G, and H need 350, 450, and 200 units respectively. Crossdock facilities D and E can handle 600 and 700 units, respectively. Logistics Manager, Aretha Franklin, had previously used "Chain of Fools" as her supply chain consulting company, but now turns to you for some solid advice. What is the objective function? Group of answer choices Max Z = $3AD + $3AE + $4BD + $3BE + $5CD + $3CE + $4DF + $4DG + $4DH + $10EF + $9EG + $8EH Min Z = $3AD + $3AE + $4BD + $3BE + $5CD + $3CE + $4DF + $4DG + $4DH + $10EF + $9EG + $8EH Min Z = $3AD + $3BE + $5CD + $3CE…arrow_forwardCompanies A, B, and C supply components to three plants (F, G, and H) via two crossdocking facilities (D and E). It costs $4 to ship from D regardless of final destination and $3 to ship to E regardless of supplier. Shipping to D from A, B, and C costs $3, $4, and $5, respectively, and shipping from E to F, G, and H costs $10, $9, and $8, respectively. Suppliers A, B, and C can provide 200, 300 and 500 units respectively and plants F, G, and H need 350, 450, and 200 units respectively. Crossdock facilities D and E can handle 600 and 700 units, respectively. Logistics Manager, Aretha Franklin, had previously used "Chain of Fools" as her supply chain consulting company, but now turns to you for some solid advice. Set up the solution in Excel and solve with Solver. What are total costs?arrow_forwardCanning Transport is to move goods from three factories to three distribution centers. Information about the move is given below. Supply 200 Source Destination Demand 50 A 125 125 в 100 Y 150 Shipping costs are: Source 3 9 Destination Y 2 A в 10 6. (Source B cannot ship to destination Z) A. According to the Northwest Corner method, the initial solution would have a total transportation cost of B. According to the Vogel's Approximation Method, the initial solution would have a total transportation cost of C. According to the minimum cell cost method, the initial solution would have a total transportation cost of D. According to the Northwest Corner method, the initial solution would give to cell CIII a loading of E. According to the Vogel's Approximation Method, the initial solution would give to cell Cll a loading of F. According to the minimum cell cost method, the initial solution would give to cell BI a loading ofarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,