Practical Management Science, Loose-leaf Version
5th Edition
ISBN: 9781305631540
Author: WINSTON, Wayne L.; Albright, S. Christian
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 5.4, Problem 24P
Summary Introduction
To expand: The Company R’s two-product spreadsheet model.
Introduction: In linear programming, unbounded solution would occur when the objective function is infinite. If no solution satisfied the constraints then it is said to be unfeasible solution.
Expert Solution & Answer
Trending nowThis is a popular solution!
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.
Travelling Salesman Problem (TSP); Given the following distance matrix, use the nearest neighbor
(NN) heuristic to find a route that starts from the warehouse (W), visits each customer only once,
and finishes at the warehouse to minimize the distance traveled. What is the route and the
corresponding distance?
Distances
W 1 2 3 4
in miles
18
57
27
50
18 0 65
29
61
57
65
0 36
99
3
27
29
36 0 76
4
50
61
99
76
Route=W-1-3-2-4, Distance=182 miles
Route=W-3-1-2-4-W, Distance=270 miles
Route = W-3-1-2-4, Distance=220 miles
Route=W-1-3-2-4-W, Distance=232 miles
Route=W-1-3-4-2, Distance=272 miles
1,
2.
Chapter 5 Solutions
Practical Management Science, Loose-leaf Version
Ch. 5.2 - Prob. 1PCh. 5.2 - Prob. 2PCh. 5.2 - Prob. 3PCh. 5.2 - Prob. 4PCh. 5.2 - Prob. 5PCh. 5.2 - Prob. 6PCh. 5.2 - Prob. 7PCh. 5.2 - Prob. 8PCh. 5.2 - Prob. 9PCh. 5.3 - Prob. 10P
Ch. 5.3 - Prob. 11PCh. 5.3 - Prob. 12PCh. 5.3 - Prob. 13PCh. 5.3 - Prob. 14PCh. 5.3 - Prob. 15PCh. 5.3 - Prob. 16PCh. 5.3 - Prob. 17PCh. 5.3 - Prob. 18PCh. 5.4 - Prob. 19PCh. 5.4 - Prob. 20PCh. 5.4 - Prob. 21PCh. 5.4 - Prob. 22PCh. 5.4 - Prob. 23PCh. 5.4 - Prob. 24PCh. 5.4 - Prob. 25PCh. 5.4 - Prob. 26PCh. 5.4 - Prob. 27PCh. 5.4 - Prob. 28PCh. 5.4 - Prob. 29PCh. 5.5 - Prob. 30PCh. 5.5 - Prob. 31PCh. 5.5 - Prob. 32PCh. 5.5 - Prob. 33PCh. 5.5 - Prob. 34PCh. 5.5 - Prob. 35PCh. 5.5 - Prob. 36PCh. 5.5 - Prob. 37PCh. 5.5 - Prob. 38PCh. 5 - Prob. 42PCh. 5 - Prob. 43PCh. 5 - Prob. 44PCh. 5 - Prob. 45PCh. 5 - Prob. 46PCh. 5 - Prob. 47PCh. 5 - Prob. 48PCh. 5 - Prob. 49PCh. 5 - Prob. 50PCh. 5 - Prob. 51PCh. 5 - Prob. 52PCh. 5 - Prob. 53PCh. 5 - Prob. 54PCh. 5 - Prob. 55PCh. 5 - Prob. 56PCh. 5 - Prob. 57PCh. 5 - Prob. 58PCh. 5 - Prob. 59PCh. 5 - Prob. 60PCh. 5 - Prob. 61PCh. 5 - Prob. 62PCh. 5 - Prob. 63PCh. 5 - Prob. 64PCh. 5 - Prob. 65PCh. 5 - Prob. 66PCh. 5 - Prob. 67PCh. 5 - Prob. 68PCh. 5 - Prob. 69PCh. 5 - Prob. 70PCh. 5 - Prob. 71PCh. 5 - Prob. 72PCh. 5 - Prob. 73PCh. 5 - Prob. 74PCh. 5 - Prob. 75PCh. 5 - Prob. 76PCh. 5 - Prob. 77PCh. 5 - Prob. 80PCh. 5 - Prob. 81PCh. 5 - Prob. 82PCh. 5 - Prob. 83PCh. 5 - Prob. 85PCh. 5 - Prob. 86PCh. 5 - Prob. 87PCh. 5 - Prob. 2C
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
- Greenstreets Recycling, Inc., collects used motor oil from several collection sites around the Greater Stanford area. To minimize the use, and thereby the cost, of its labor, vehicle, and energy resources, the company is interested in locating the shortest route that will allow its collection vehicle to visit each collection site exactly once. The following table provides the travel distances in miles between each site. Note that the company’s recycling facility is located at site A. From/To A B C D E F A (depot) – 25 50 48 41 60 B 25 – 35 22 23 43 C 50 35 – 25 47 65 D 48 22 25 – 24 40 E 41 23 47 24 – 21 F 60 43 65 40 21 – Provide an efficient route for the collection vehicle.arrow_forward7. The BD restaurant chain purchases materials from four different food suppliers. The company wants to construct a new central distribution center to process and package the materials before shipping them to their various restaurants. The suppliers transport items in 40-foot truck trailers, each with a capacity of 38,000 lbs. The locations of the four suppliers and the annual number of trailer loads that will be transported to the distribution center are shown in the following table (distance in miles). Using the center-of-gravity method, determine a possible location for the distribution center. A B с D X Y 200 200 100 500 250 600 500 300 Load 75 105 135 60 BD wants to evaluate three different sites it has identified for its new distribution center relative to the four suppliers identified. The coordinates of the three sites under consideration are as follows: Site 1: x1 = 360, y₁ = 180 Site 2: X2 = 420, y2 = 450 Site 3: X3 = 250, y3 = 400arrow_forwardis the following true / false ? " in transportation problem , shipments can occur between any two transshipment nodes.arrow_forward
- The network in the figure, shows the routes for shipping cars from three (3) plants (nodes, 1,2 and 3) to three (3) dealers (nodes, 6, 7, 8) by way of two (2) distribution centers (nodes 4and 5). The shipping costs per car (in $100) are shown on the arcs. Solve the problem as a transshipment model.1. Formulate the Linear Programming model 2. Choose one among the three methods for the starting/initial basic solution 3. Solve for the optimal solution using Method of Multipliersarrow_forwardThe next diagram depicts a system of aqueducts that originate at three rivers (nodes R1, R2, and R3) and terminate at a major city (node T), where the other nodes are junction points in the system. From R1 R2 R3 R1 R2 Το R3 A B Using units of thousands of acre feet, the tables below show the maximum amount of water that can be pumped through each aqueduct per day. To D ABC From 130 115 - A 70 90 110 B 140 120 C E F T DEF DEF From D 110 85 - 130 95 85 130 160 F To T 220 330 240 The city water manager wants to determine a flow plan that will maximize the flow of water to the city. a) Formulate this problem as a maximum flow problem by identifying a source, a sink, and the transshipment nodes, and then drawing the complete network that shows the capacity of each arc.arrow_forwardA bank has its head office in the financial district in the middle ofa city. A bank has six branches, three in the north of the city and threein the south all 5 km from the centre and spaced 3 km apart. The bankwishes to link all its branches via private leased lines but mustdecide between providing an individual line to each branch via anumber of inter-branch links and a smaller number of multiplexed linesto the centre. If a modem costs £100, a multiplexer/demultiplexercosts £200 and leased lines cost £100 per km per year to rent, suggesta design that will yield the most cost effective solution if theinstallation is to remain in operation for four years. 1st option is - link all branches by providing individual line to each branch via a number of inter branch links to the centre. 2nd option is - link all branches by providing smaller number of multiplexed lines to the centre Please calculate both options and choose the most cost effective solution for four years?arrow_forward
- Consider the following transshipment network for finding the shortest route from node 1 to node 7. Min s.t. Node 1 Flows X12 +*13 Node 3 Flows Node 4 Flows Node 5 Flows 18 Node 6 Flows Node 7 Flows w +x14 X Node 2 Flows -x12 - x32-x52 + x23+x25 = 0 3 4 (a) Formulate a linear programming model of the problem. (Express your answers using Xij, where each x¡¡ is either 0 or 1 for the arc from node i to node j.) 5 4 3 6 3 6 7arrow_forward4. The 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 120 160 80 50 210 140 4 190 40 130 50 6 Determine the shortest conveyor route from the distribution/inventory center at node 1 to each of the other six areas of the plant.arrow_forwardThe MidLands Trucking Company based in Louisvillehas eight trucks located throughout the Mideast that havedelivered their loads and are available for shipments. Through their Internet logistics site MidLands has re-ceived shipping requests from 12 customers. The follow-ing table shows the mileage for a truck to travel to a customer location, pick up the load, and deliver it. Determine the optimal assignment of trucks to customersthat will minimize the total mileage. Customers Truck A B C D E F G H I J K L1 500 730 620 410 550 600 390 480 670 710 440 5902 900 570 820 770 910 660 650 780 840 950 590 6703 630 660 750 540 680 750 810 560 710 1200 490 6504 870 1200 810 670 710 820 1200 630 700 900 540 6205 950 910 740 810 630 590 930 650 840 930 460 5606 1100 860 800 590 570 550 780 610 1300 840 550 7907 610 710 910 550 810 730 910 720 850 760 580 6308 560 690 660 640 720 670 830 690 880 1000 710 680arrow_forward
- Cars-to-Dealers Logistics Inc. is the exclusive logistics provider for the Summit Motor Co. and has responsibilityfor transporting cars from Summit’s 3 manufacturing plants in Toledo, OH; Charlotte, NC and Savannah, GA tothe 7 regional dealer locations as in the tables provided in your dataset. To do this, Cars-to-Dealers uses threetransshipment facilities and all cars in the distribution network pass through these transshipment facilities.Dataset also contains the information about the capacities of each of these transshipment facilities, the demandrequirement at each of the regional dealer locations and the unit cost to ship one car between the variouslocations.In addition to supply of cars (manufacturers) and demand for cars (dealers) there are two types of constraintsfor each transshipment facility:1. Balance flow constraints: dictate that all cars flowing into a transshipment facility should also flow out of thetransshipment facility – i.e. no inventory of cars should remain at…arrow_forwardSuppliers A, B, and C supply components to three plants -- F, G, and H via two transshipment facilities -- T1 and T2. It costs $4 to ship from T1 regardless of final destination and $3 to ship to T2 regardless of supplier. Shipping to T1 from A, B, and C costs $3, $4, and $5, respectively, and shipping from T2 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. The Logistics Manager has come to you for help. Answer the following question: Which of these is not an element of the objective function? Group of answer choices 4D-T1 600T1 9T2-G 3C-T2 Plz do fast asaparrow_forwardQ: When we solve the given transportation problem according to the lowest cost method, which warehouse and/or warehouses are suitable for shipment from f3 (F: Factory M: Customer)A) no needb) M1, M2, M3c) M1 and M2d) M3 and M1E) M3arrow_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,