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 25P
Summary Introduction
To determine: The change in 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
In the orginal Western set covering model in Figure 6.22, we assumed that each city must be covered by at least one hub. Suppose that for added flexibility in flight routing, Western requires that each city must be covered by at least two hubs. How do we model and optimal solution change?
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.
Solve 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.
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 manufacturer has two factories, located in Toronto and Winnipeg. Warehouses are located in Moncton, Montreal, and Calgary. Minimum requirements at the three warehouses are for at least 5 000, 8 000, and 7 000 units, respectively. The production capacities of the two factories are 9 000 and 11 000 units, respectively. Shipping costs per unit from each factory to each warehouse are given below: WAREHOUSE Moncton Montreal Calgary FACTORY Toronto $14 $6 $18 Winnipeg $22 $17 $9 The manufacturer wants to determine the optimal shipping schedule that will minimize transportation costs. Formulate the linear programming model for this problem.arrow_forwardTransportation Problem: A semi-products manufacturer has 3 production facilities (X, Y, Z) and distributes its products to 3 various customers (K, L, M) from these production facilities. The daily production capacity of each production facility and the daily distribution costs are given in the below table. Daily demands of customers are 42, 27, and 33, respectively. Namely, in a day, customer K requires 42 units of products, customer L requires 27 units of products, and customer M requires 33 units of products. (a) Formulate a balanced transportation problem that could be used to determine how to minimize the total cost of meeting the demand of customers. The formulation should be in open form and decision variables should be defined as integer amounts. (b) Use LINGO/OPL/EXCEL to solve your model. Write down the results of the decision variables and the objective function. Explain the value of the decision variables. What do they mean? (c) Use the Northwest Corner method to find a…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_forward
- Luminous 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_forwardA product is manufactured by four factories A, B, C and D. The unit production costs in them are ETB 2, ETB 3, ETB 1 and ETB 5 respectively. Their production capacities are 50, 70, 30 and 50 units respectively. These factories supply the product to four stories, demands of which are 25, 35, 105, and 20 units respectively. Unit transportation cost in ETB for each factory to each store is given in the table below. Stores 1 2 3 4 2 4 6 11 10 8 7 5 13 3 9 12 4 6 8 3 A Factories B C D Determine the transportation plan to minimize the total production-cum-transportation cost by using: Vogel’s Approximation Method (VAM)…arrow_forwardA firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced in the plants must be shipped to satisfy the demand of 3 customers. Customer 1 requires 75 units per day, customer 2 requires 100 units per day, and customer 3 requires 175 units per day. The shipping costs for each possible route are shown in the table below: Shipping Costs Customer per unit Plant 1 2 3 A $ 25 $ 35 $ 15 B $ 20 $ 30 $ 40 C $ 40 $ 35 $ 20 D $ 15 $ 20 $ 25 The firm needs to satisfy all demand each day, but would like to minimize the total costs. The firm’s problem falls within which classification? Multiple Choice Cost-benefit-trade-off Assignment problems Transshipment problems Transportation problems Resource-allocationarrow_forward
- A firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced in the plants must be shipped to satisfy the demand of 3 customers. Customer 1 requires 75 units per day, customer 2 requires 100 units per day, and customer 3 requires 175 units per day. The shipping costs for each possible route are shown in the table below: Shipping Costs Customer per unit Plant 1 2 3 A $ 25 $ 35 $ 15 B $ 20 $ 30 $ 40 C $ 40 $ 35 $ 20 D $ 15 $ 20 $ 25 The firm needs to satisfy all demand each day, but would like to minimize the total costs. Which of the following constraints is unnecessary for this problem (xi,j is the number of widgets shipped from factory i to customer j)? A firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced…arrow_forward“It is essential to constrain all shipments in a transportation problem to have integer values to ensure that the optimal LP solution consists entirely of integer-valued shipments.” Is this statement true or false? Why?arrow_forwardA product is produced by four factories F1, F2, F3, and F4. Their production capacities are: F1:47 units, F2:67 units, F3:27 units and F4:57 units. These factories supply the product to four stores, demand of which is 22, 32, 102, and 17 units respectively. Unit transportation cost in dollars from each factory to each store is given in the following table. Determine the extent of deliveries from each of the factories to each of the stores so that the total production and transportation cost is minimum. Factories Stores Supply S1 S2 S3 S4 F1 4 6 8 13 47 F2 14 12 10 8 67 F3 11 1 7 10 27 F4 10 12 14 9 57 Demand 22 32 102 17arrow_forward
- 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.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_forwardThe ABC Firefighting Equipment company has two assembly plants: Plant A in Atlanta and plant B in Buffalo. It has two distribution centers: Center I in Savannah and center II in Pittsburgh. The company can product at most 800 alarm valves per week at platn A and at most 1000 per week at plant B. Center I must have at least 900 alarm valves per week and center II must have at least 600 alarm valves per week. The costs per unit for transportation from the plants to the centers follow. Plant A to center I $8 Plant A to center II $12 Plant B to center I $16 Plant B to center II $4 Form the constraint inequalities that give the limits for the plants and distribution centers and form the total cost function that is to be minimized. Solve the mixed constraint problem for the minimum transportation cost. Determine whether any shipment route is unnecessary.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,