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 35P
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
Trending nowThis is a popular solution!
Students have asked these similar questions
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.
In a 3 x 3 transportation problem, let xij be the amount shipped from source i to destination j and let cij be the corresponding transportation cost per unit. The amounts of supply at sources 1, 2, and 3 are 15, 30, and 85 units, respectively, and the demands at destinations 1, 2, and 3 are 20, 30, and 80 units, respectively. Assume that the starting northwest-corner solution is optimal and that the associated values of the multipliers are given us u1 = -2, u2 = 3, u3 = 5, v1 = 2, v2 = 5, and v3 = 10.
a) Find the associated optimal cost.
b) Determine the smallest value of cij for each nonbasic variable that will maintain the optimality of the northwest-corner solution.
The optimal solution to the original Grand Prix problem indicates that with a unit shipping cost of $132, the route from plant 3 to region 2 is evidently too expensive—no autos are shipped along this route. Use SolverTable to see how much this unit shipping cost would have to be reduced before some autos would be shipped along this route.
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
- A company supplies goods to three customers, who eachrequire 30 units. The company has two warehouses.Warehouse 1 has 40 units available, and warehouse 2 has 30units available. The costs of shipping 1 unit from warehouseto customer are shown in Table 7. There is a penalty for eachunmet customer unit of demand: With customer 1, a penaltycost of $90 is incurred; with customer 2, $80; and withcustomer 3, $110. Formulate a balanced transportationproblem to minimize the sum of shortage and shipping costs.arrow_forwardGeneral Ford produces cars in Los Angeles and Detroit and has a warehouse in Atlanta. The company supplies cars to customers in Houston and Tampa. The costs of shipping a car between various points are listed in the file P05_54.xlsx, where a blank means that a shipment is not allowed. Los Angeles can produce up to 1600 cars, and Detroit can produce up to 3200 cars. Houston must receive 1800 cars, and Tampa must receive 2900 cars.a. Determine how to minimize the cost of meeting demands in Houston and Tampa.b. Modify the answer to part a if no shipments through Atlanta are allowed.arrow_forwardA company has four warehouses and six stores. The warehouses altogether have a surplus of 22 units of a given commodity, divided among them as follows: Warehouses 1 2 3 4 Surplus 5 6 2 9 The six stores altogether need 22 units of the commodity. Individual requirements at b stores 1,2,3,4,5 and 6 are 4,4,6,2,4 and 2 units respectively. Cost of shipping one unit of commodity from warehouse i to store j in $ dollars is given in the matrix below. Stores Warehouses 1 2 3 4 5 6 1 9 12 9 6 9 10 2 7 3 7 7 5 5 3 6 5 9 11 3 11 4 6 8 11 2 2 10 Required Formulate the mathematical model for the problem How should the products be shipped from the warehouses to the stores so that the transportation cost is minimum?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_forwardThe following table shows the cost to ship goods from Factory 1,2,3 to Warehouse A,B,C: We will designate "F" as the variable for Factory. The constraint that represents the quantity supplied by Factory 1 should be written as: A)F1A+F1B+F1C=500 B)4F1A+6F1B+8F1C<=500 C)F1A+F1B+F1C<=500 D)F1A+F1B+F1C>=500 E)F1A+F2A+F3<=200arrow_forward
- Sinclair Plastics operates two chemical plants which produce polyethylene; the Ohio Valley plant which can produce up to 10,000 tons per month and the Lakeview plant which can produce up to 7,000 tons per month. Sinclair sells its polyethylene to three different auto manufacturing plants, Grand Rapids (demand = 3000 tons per month), Blue Ridge (demand = 5000 tons per month), and Sunset (demand = 4000 tons per month). The costs of shipping between the respective plants is shown in the table below: Grand Rapids Blue Ridge Sunset Ohio Valley 50 40 100 Lakeview 60 50 75 Implement the LP model in Solver and obtain the optimal shipping plan. What is the optimized cost?arrow_forwardOranges are grown, picked, and then processed and pack-aged at distribution centers in Tampa, Miami, and Fresno. These centers supply oranges to markets in New York,Philadelphia, Chicago, and Boston. The following tableshows the shipping costs per truckload ($100s), supply,and demand: Because of an agreement between distributors, ship-ments are prohibited from Miami to Chicago. Solve this problem. to Newfrom York Philadelphia Chicago Boston SupplyTampa $ 9 $14 $12 $17 300Miami 11 10 6 10 200Fresno 12 8 15 7 250Demand 160 210 130 180arrow_forwardSolve the following problems using Excel Solver or R Studio. A company produces cars in Atlanta, Boston, Chicago, and Los Angeles. The cars are then shipped to warehouses in Memphis,Milwaukee, New York City, Denver, and San Francisco. The number of cars available at each plant is given in Table 1. Eachwarehouse needs to have available the number of cars given in Table 2. The distance (in miles) between the cities is given inTable 3. Assuming that the cost (in dollars) of shipping a car equals the distance between two cities, determine an optimalshipping schedule.arrow_forward
- Federated Oil has refineries in Los Angeles and Chicago. The Los Angeles refinery can refine up to two million barrels of oil per year, and the Chicago refinery up to three million. After the oil is refined, it is shippedto two distribution points, Houston and New York City. Federated Oil estimates that each distribution point can sell up to five million barrelsper year. Because of differences in shipping and refining costs, the profit earned (in dollars) per million barrels of oil shipped depends on where the oil was refined and on the point of distribution. This information is listed in the file P04_69.xlsx. The company is considering expanding the capacity of each refinery.Each million barrels of annual refining capacity that isadded will cost $120,000 for the Los Angeles refinery and $150,000 for the Chicago refinery. Determine how Federated Oil can maximize its profit (including expansion costs) over a 10-year period.arrow_forwardA company has three manufacturing plants (in Atlanta,Tulsa, and Springfi eld) that produce a product that is then shipped to one of four distribution centers. Th e three plants can produce13, 18, and 12 truckloads of product each week, respectively. Eachdistribution center needs 10 truckloads of product each week. Th eshipping costs per truckload between the plants and distributioncenters are given in the table. Th e company needs to determinehow much to ship from each plant to each distribution center andwould like to minimize total shipping costs (a) Formulate an LP to minimize the total shipping costs.(b) Set up and solve the problem on a spreadsheet.(c) What is the optimal solution? Explain the rationale for thesolutionarrow_forwardLuminous lamps have three factories - F1, F2, and F3 with production capacity 30, 50, and 20 units per week respectively. These units are to be shipped to four warehouses W1, W2, W3, and W4 with requirements of 20, 40, 30, and 10 units per week respectively. The transportation costs (in Rs.) per unit between factories and warehouses are given below. Find an initial basic feasible solution.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,