Spreadsheet Modeling & Decision Analysis: A Practical Introduction to Business Analytics (MindTap Course List)
8th Edition
ISBN: 9781305947412
Author: Cliff Ragsdale
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
error_outline
This textbook solution is under construction.
Students have asked these similar questions
In 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.
Abu Dhabi municipality is given an assignment to ensure provision of enough water for residents of the Abu Dhabi city. The water is purified in a large water treatment plant (node
1) and then is sent via a water supply network to the Abu Dhabi city (node 14). As shown in the below water supply network, the capacity of each water pipeline (arc) is shown in million liters per hour. For example, the hourly water flow from node 1 to node 2 is four million liters, and from node 2 to node 1 is zero million liters.
a) The municipality is interested to find out how much water (in million liters per hour) can be sent from the water treatment plant to the Abu Dhabi city via this water supply network. Determine it.
b) Due to a maintenance problem both nodes 10 and 11 need to be taken offline.
Therefore, these nodes cannot flow any water in and out. How this problem impacts the network maximum flow capacity?
Please include algebraic method and excel solver.
Please help me with part b
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, management and related others by exploring similar questions and additional content below.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…arrow_forwardThe following network describes a transportation scenario in which there are four sources A, B, C, and D, and three destinations P, Q, and R. (The numbers next to each arrow represent the cost of transporting one unit from that particular source to the destination located at the other end of that arrow). Write the mathematical formulation of the problem. Use the Excel Solver to solve the problem. Generate the answer and sensitivity reports in Excel, and submit your Excel workbook as a separate attachment. Provide the solution obtained in the space provided. What is the optimal cost of transportation?arrow_forwardUsing NETWORK and ASSIGNMENT MODEL (Minimum-Spanning Tree) for Operation Management/Research please solve the attached problem. Show Solution. Thanksarrow_forward
- Briefly discuss the Nine dot problem. How did they come up with a solution?arrow_forwardThe plant engineer for the Bitco manufacturing plant is designing an overhead conveyor system that will connect the distribution/inventory center to all areas of the plant. The network of possible conveyor routes through the plant, with the length (in feet) along each branch, follows: Determine the shortest conveyor route from the distribution/inventory center at node 1 to each of the other six areas of the plant.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. 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_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. Set up the solution in Excel and solve with Solver. What are total costs?arrow_forwardIn this problem, we will consider problems of finding minimum cost paths in directed networks. You are performing logistics analysis for a company that distributes products from several distribution centers located around the US. You are considering adding a new distribution center to serve key cities in the Great Basin area. Currently, you operate single distribution center in Sacramento and serve all of the Great Basin cities from there. You are considering opening a new DC in Salt Lake City to improve service and reduce outbound transportation costs from the DC. See the map at the end of this assignment. Currently, your customers are located in all of the major and mid-sized cities represented by blue circles on the map. You have compiled data on the major highway routes that your truck fleet will use when traveling between your key customer areas and your distribution centers. Figure 1 summarizes the data. You have decided to collect both travel time and travel distance data.…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_forward
- George is camped deep in the jungle, and he wants to make his way back to the coast and civilization. Each of the paths he can take through the jungle has obstacles that can delay him, including hostile natives, wild animals, dense forests and vegetation, swamps, rivers and streams, snakes, insects, and mountains. Following is the network of paths that George can take, with the time (in days) to travel each branch: Determine the shortest (time) path for George to take and indicate the total time.arrow_forwardThe Hills County, Michigan, superintendent of education is responsible for assigning students to the three high schools in his county. He recognizes the need to bus a certain number of students, for several sectors, A - E, of the county are beyond walking distance to a school. The superintendent partitions the county into five geographic sectors as he attempts to establish a plan that will minimize the total number of student miles traveled by bus. He also recognizes that if a student happens to live in a certain sector and is assigned to the high school in that sector, there is no need to bus him because he can walk to school. The three schools are located in sectors B, C, and E. The accompanying table reflects the number of high-school-age students living in each sector and the distance in miles from each sector to each school: Distance to School Sector School in Sector School in Sector School in Sector B C E A B C D E Total 7 0 4 5 12 5 4 0 4 7 6 12 7 7 0 Number of Students 700 500…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_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Understanding BusinessManagementISBN:9781259929434Author:William NickelsPublisher:McGraw-Hill Education
Management (14th Edition)ManagementISBN:9780134527604Author:Stephen P. Robbins, Mary A. CoulterPublisher:PEARSON
Spreadsheet Modeling & Decision Analysis: A Pract...ManagementISBN:9781305947412Author:Cliff RagsdalePublisher:Cengage Learning
Management Information Systems: Managing The Digi...ManagementISBN:9780135191798Author:Kenneth C. Laudon, Jane P. LaudonPublisher:PEARSON
Business Essentials (12th Edition) (What's New in...ManagementISBN:9780134728391Author:Ronald J. Ebert, Ricky W. GriffinPublisher:PEARSON
Fundamentals of Management (10th Edition)ManagementISBN:9780134237473Author:Stephen P. Robbins, Mary A. Coulter, David A. De CenzoPublisher:PEARSON
Understanding Business
Management
ISBN:9781259929434
Author:William Nickels
Publisher:McGraw-Hill Education
Management (14th Edition)
Management
ISBN:9780134527604
Author:Stephen P. Robbins, Mary A. Coulter
Publisher:PEARSON
Spreadsheet Modeling & Decision Analysis: A Pract...
Management
ISBN:9781305947412
Author:Cliff Ragsdale
Publisher:Cengage Learning
Management Information Systems: Managing The Digi...
Management
ISBN:9780135191798
Author:Kenneth C. Laudon, Jane P. Laudon
Publisher:PEARSON
Business Essentials (12th Edition) (What's New in...
Management
ISBN:9780134728391
Author:Ronald J. Ebert, Ricky W. Griffin
Publisher:PEARSON
Fundamentals of Management (10th Edition)
Management
ISBN:9780134237473
Author:Stephen P. Robbins, Mary A. Coulter, David A. De Cenzo
Publisher:PEARSON