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, Problem 92P
a)
Summary Introduction
To determine: The cities where the centers should be located.
Introduction: The variation between the present value of the
b)
Summary Introduction
To determine: The cities where the centers should be located and the number of centers needed.
Introduction: The variation between the present value of the cash outflows and the present value of the cash inflows are known as the Net Present Value (NPV).
c)
Summary Introduction
To determine: The cities where the centers should be located and the number of centers needed.
Introduction: The variation between the present value of the cash outflows and the present value of the cash inflows are known as the Net Present Value (NPV).
d)
Summary Introduction
To determine: The cities where the 3 centers should be located.
Introduction: The variation between the present value of the cash outflows and the present value of the cash inflows are known as the Net Present Value (NPV).
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
A health Centre will be built to serve 7 communities. The geographical location of the communities and their population is shown in the table below.
Communities A, X =2.5 (km), Y=4.5(km), Population( 000's)=2
Communities B, X =2.5 (km), Y=2.5(km), Population( 000's)=5
Communities C, X =5.5 (km), Y=4.5(km), Population( 000's)=10
Communities D, X =5 (km), Y=2(km), Population( 000's)=7
Communities E, X =8 (km), Y=5(km), Population( 000's)=10
Communities F, X =7 (km), Y=2(km), Population( 000's)=20
Communities G, X =9 (km), Y=2.5(km), Population( 000's)=14
There is a possibility of building the Centre in two communities, community C and F. Based on the Demand-Distance criterion what is your recommendation for the site of the Centre. The distances to be measured based on Rectilinear method.
Based on…
A 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.
A retail store in Des Moines, Iowa, receives shipments of a particular product from KansasCity and Minneapolis.
Let x 5 number of units of the product received from Kansas City y 5 number of units of the product received from Minneapolisa. Write an expression for the total number of units of the product received by the retail store in Des Moines.
b. Shipments from Kansas City cost $0.20 per unit, and shipments from Minneapolis cost$0.25 per unit. Develop an objective function representing the total cost of shipments to Des Moines.
c. Assuming the monthly demand at the retail store is 5000 units, develop a constraint that requires 5000 units to be shipped to Des Moines.
d. No more than 4000 units can be shipped from Kansas City, and no more than 3000 units can be shipped from Minneapolis in a month. Develop constraints to model this situation.
e. Of course, negative amounts cannot be shipped. Combine the objective function and constraints developed to state a mathematical model…
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
- 2.) Your business provides technical support for very complex and specialized machinery used by companies throughout the country, and you currently have support centers at 5 locations. However, due to a poor market, you have been forced to close your centers in Houston and San Diego. You will have to relocate all of your technicians in these two centers to your other three centers in Cleveland, Seattle, and Charlotte. Due to the varying costs of living in each city, and travel and retraining times, the cost for relocating an employee varies depending on where the employee is moving. These costs are given in the following table: To: From: Cleveland Seattle Charlotte $5,000 | $7,000 $7,000 $4,000 $6,000 $8,000 Houston San Diego You currently have 40 employees in Houston and 55 employees in San Diego, which all need to be relocated. Cleveland is able to take in at most 35 relocated employees, Seattle can take in at most 32 employees, and Charlotte is able to take in at most 50 employees.…arrow_forwardDraw the network for this transportation problem. (Let xij represent the flow from node i to node j.) Min 2x13 + 4x14 + 6x15 + 8x23 + 11x24 + 9x25 s.t. x13 + x14 + x15 ≤ 500 x23 + x24 + x25 ≤ 400 x13 + x23 = 300 x14 + x24 = 300 x15 + x25 = 300 xij ≥ 0arrow_forwardNote:- 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
- 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_forwardA travelling salesman has to visit five cities. He wishes to start from a particular city, visit each city only once and then return to his starting point. The travelling cost of each city from a particular city is given below. To city A BC DE A x 2 5 7 1 B 6 x 3 8 2 From city C 8 7 x 4 7 D 12 4 6 x 5 E 1 3 28 x How should the jobs be allocated, one per employee, so as to minimize the total man-hours?arrow_forwardExplain 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_forward
- Which of the following is NOT a method to develop an initial solution to a transportation model? - Group of answer choices - None...all are methods to develop an initial solution - northwest corner method - linear programming - intuitive least cost methodarrow_forwardPlease help me with part barrow_forwardUse Kruskal's algorithm to find the minimum spanning tree path K₂. List all of the edges and list their weights in order in the chart below. In the third row of the table put YES is you are using the edge or NO if you are not. Edge Wt. Select 3 d a K3 Marbet 6 The total weight of the minimum spanning tree is: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,
Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education
Purchasing and Supply Chain Management
Operations Management
ISBN:9781285869681
Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...
Operations Management
ISBN:9781478623069
Author:Steven Nahmias, Tava Lennon Olsen
Publisher:Waveland Press, Inc.