Practical Operations Management
2nd Edition
ISBN: 9781939297136
Author: Simpson
Publisher: HERCHER PUBLISHING,INCORPORATED
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 8, Problem 29P
(a)
Summary Introduction
Interpretation:
The candidate location that should be selected for the new warehouse is to be determined.
Concept Introduction:
To get the number of the shipped for new warehouse use the formula
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
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
1
0
0
1
0…
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
1
0
0
1
0…
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 8 Solutions
Practical Operations Management
Ch. 8 - Prob. 1DQCh. 8 - Prob. 2DQCh. 8 - Prob. 3DQCh. 8 - Prob. 1PCh. 8 - Prob. 2PCh. 8 - Prob. 3PCh. 8 - Prob. 4PCh. 8 - Prob. 5PCh. 8 - Prob. 6PCh. 8 - Prob. 7P
Ch. 8 - Prob. 8PCh. 8 - Prob. 9PCh. 8 - Prob. 10PCh. 8 - Prob. 11PCh. 8 - Prob. 12PCh. 8 - Prob. 13PCh. 8 - Prob. 14PCh. 8 - Prob. 15PCh. 8 - Prob. 16PCh. 8 - Prob. 17PCh. 8 - Prob. 18PCh. 8 - Prob. 19PCh. 8 - Prob. 20PCh. 8 - Prob. 21PCh. 8 - Prob. 22PCh. 8 - Prob. 23PCh. 8 - Prob. 24PCh. 8 - Prob. 25PCh. 8 - Prob. 26PCh. 8 - Prob. 27PCh. 8 - Prob. 28PCh. 8 - Prob. 29PCh. 8 - Prob. 1.1QCh. 8 - Prob. 1.2QCh. 8 - Prob. 1.3QCh. 8 - Prob. 1.4QCh. 8 - Prob. 2.1QCh. 8 - Prob. 2.2QCh. 8 - Prob. 2.3QCh. 8 - Prob. 3.1QCh. 8 - Prob. 3.2QCh. 8 - Prob. 3.3QCh. 8 - Prob. 3.4Q
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
- Four cargo ships must be used to transport goods from one port to four other ports (numbered 1, 2, 3, and 4). Any boat can be used to make any of the four trips. However, given some differences between ships and cargoes, the total cost of loading, transporting, and unloading goods from different combinations of ships and ports varies considerably. These costs are shown in the following table: The goal is to assign ships to ports in a one-to-one correspondence so that the total cost of the four shipments is minimized. a) Describe how this problem can be adapted to the general format of assignment problems. b) Obtain an optimal solution using Excel Solver step by steparrow_forwardAn electronics firm located near Phoenix, Arizona, is considering where to locate a new phone switch that will link five buildings. The buildings are located at (0, 0), (2, 6), (10, 2), (3, 9), and (0, 4). The objective is to locate the switch to minimize the cabling required to those five buildings.a. Determine the gravity solution.b. Determine the optimal location assuming a straight-line distance measure. (If you are solving this problem by hand, iterate the appropriate equations at least five times and estimate the optimal solution.)arrow_forwardBaseball umpiring crews are currently in four cities where three-game series are beginning. When these are finished, the crews are needed to work games in four different cities. The distances (miles) from each of the cities where the crews are currently working to the cities where the new games will begin are shown in the following table. The X indicates that the crew in Oakland cannot be sent to Toronto. Formulate as a linear programming problem to minimize the miles traveled. HINT: Since one assignment cannot be made, what are the options for that variable in the formulation? Solve using Excel solver. Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You will get up vote for sure.arrow_forward
- Due to increased sales, a company is considering building three new distribution centers (DCs) to serve four regional sales areas. The annual cost to operate DC 1 is $500 (in thousands of dollars). The cost to operate DC 2 is $600 (in thousands of dollars.). The cost to operate DC 3 is $525 (in thousands of dollars). Assume that the variable cost of operating at each location is the same, and therefore not a consideration in making the location decision. The table below shows the cost ($ per item) for shipping from each DC to each region. Region DC A B C D 1 1 3 3 2 2 2 4 1 3 3 3 2 2 3 The demand for region A is 70,000 units; for region B, 100,000 units; for region C, 50,000 units; and for region D, 80,000 units. Assume that the minimum capacity for the distribution center will be 500,000 units. Write the constraints for the three distribution centers.arrow_forwardConsider a supply chain network with three potential sites for warehouses and eight retailer regions. The fixed costs of locating warehouses at the three sites are given as follows: Site 1: $100,000 Site 2: $80,000 Site 3: $110,000 The capacities of the three sites are 100,000, 80,000, and 125,000 respectively. The retailer demands are 20,000 for the first four retailers and 25,000 for the remaining. The unit transportation costs ($) are given in Table below: a. Formulate a mixed integer linear program to determine the optimal location and distribution plan that will minimize the total cost. You must define your variables clearly, write out the constraints, explaining briefly the significance of each and write the objective function. Assume that the retailers can receive supply from multiple sites. Solve using any optimization software. Write down the optimal solution. b. Reformulate the optimization problem as a linear integer program, assuming dedicated warehouses, that is, each…arrow_forwardGrave City is considering the relocation of several police substations to obtain better enforcement inhigh-crime areas. The locations under consideration together with the areas that can be covered fromthese locations are given in the following table: a) Formulate an integer programming model that could be used to find the minimum number oflocations necessary to provide coverage to all areas.b) Solve the problem in part (a).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_forwardIn the original Gorman Construction Company problem, we found the shortest distance from the office (node 1) to the construction site located at node 6. Because some of the roads are highways and others are city streets, the shortest-distance routes between the office and the construction site may not necessarily provide the quickest or shortest-time route. Shown here is the Gorman road network with travel time rather than distance. Find the shortest route from Gorman’s office to the construction site at node 6 if the objective is to minimize travel time rather than distance.arrow_forwardA dispatcher for Citywide Taxi Company has six taxicabs at different locations and five customers who have called for service. The mileage from each taxi’s present location to each customer is shown in the following table: Determine the optimal assignment(s) that will minimize the total mileage traveled.arrow_forward
- he Midvale Sand and Gravel Company desires to allocate its products (load) to their three projects from their three warehouses. The three warehouses, designated as A, B, and C have a capacity of 51, 23, and 38 respectively. The three projects, designated as D, E, and F have a demand of 46, 40 and 26 respectively. The shipping costs per load to its destination are as follows: From A to its projects are 4, 9 and 2 respectively; From B to its projects are 3, 5 and 8 respectively; and From C to its projects are 6, 2 and 5 respectively. 1. Show the Network presentation of the company. 2. Formulate the objective functions and constraints only using the Linear Programming Model. The objective is to minimize the total transportation costs. 3. Find the optimal solution using the NWC and stepping stone method.arrow_forwardTMA manufactures 37-in. high definition LCD televisions in two separate locations, Locations I and II. The output at Location I is at most 6000 televisions/month, whereas the output at Location II is at most 5000 televisions/month. TMA is the main supplier of televisions to the Pulsar Corporation, its holding company, which has priority in having all its requirements met. In a certain month, Pulsar placed orders for 3000 and 4000 televisions to be shipped to two of its factories located in City A and City B, respectively. The shipping costs (in dollars) per television from the two TMA plants to the two Pulsar factories are as follows. To Pulsar Factories From TMA City A City B Location I $5 $3 Location II $6 $9 TMA will ship x televisions from Location I to city A and y televisions from Location I to city B. Find a shipping schedule that meets the requirements of both companies while keeping costs to a minimum. (x, y) =…arrow_forwardA salesman for Healthproof Pharmaceutical Company travels each week from his office in Atlanta to one of five cities in the Southeast where he has clients. The travel time (in hours) between cities along interstate highways is shown along each branch in the following network: A. Determine the shortest route from Atlanta to each of the other five cities in the network. B. Assume that the network now represents six different communities in a city and that the local transportation authority wants to design a rail system that will connect all six communities with the minimum amount of track. The miles between each community are shown on each branch. Develop a minimal spanning tree for this problem.arrow_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,