Practical Management Science
Practical Management Science
6th Edition
ISBN: 9781337406659
Author: WINSTON, Wayne L.
Publisher: Cengage,
bartleby

Concept explainers

Question
Chapter 6.5, Problem 24P
Summary Introduction

To modify: The model and find the optimal solution using solver.

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).

Blurred answer
Students have asked these similar questions
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.
Here is a problem to challenge your intuition. In the original Grand Prix example, reduce the capacity of plant 2 to 300. Then the total capacity is equal to the total demand. Run Solver on this model. You should find that the optimal solution uses all capacity and exactly meets all demands with a total cost of $176,050. Now increase the capacity of plant 1 and the demand at region 2 by 1 automobile each, and run Solver again. What happens to the optimal total cost? How can you explain this “more for less” paradox?
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.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
Operations Management
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) Write the dual of the following linear programming problem: Maximize       Ζ = 3x1 + 5x2 + 4x3, Subject to      2x1 + 3x2 ≤ 8, 2x2 + 5x3 ≤10 3x1 + 2x2 + 4x3 ≤15 x1 , x2 , x3 ≥ 0 (b) Find the optimal solution to the given problem in (a) above, using the simplex method. (c) From the final optimal table in (b) above, find the solution to the dual problem. (d) Give the economic interpretation to the solution in (c) above.
    solve with excel solver PharmaCo wants to determine how to deploy sales representatives across its Western U.S. region to support a new drug for obesity. Sales representatives will be located in a "home city", which they serve, in addition to cities with feasible commuting distance, with the objective that all cities must be served by at least one sales representative. The feasible connections between each city in the region are listed below (1 indicates a feasible connection, potential home cities are shown in columns, and cities served in rows):     Potential Rep Home City Served? Albuquerque El Paso Denver Phoenix San Diego Los Angeles San Francisco Portland Seattle Las Vegas Salt Lake City Albuquerque 1 1 1 1 0 0 0 0 0 0 0 El Paso 1 1 0 1 0 0 0 0 0 0 0 Denver 1 0 1 1 0 0 0 0 0 0 1 Phoenix 1 1 1 1 1 1 0 0 0 1 1 San Diego 0 0 0 1 1 1…
    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?
  • Two plants supply three customers with medical supplies. The unit costs of shipping from the plants to the customers, along with the supplies and demands, are given in Table below. The company’s goal is to minimize the cost of meeting customers’ demands.              From                                              To     Customer 1 Customer 2 Customer 3 Supply Plant 1 55 65 80 35 Plant 2 10 15 25 50 Demand 10 10 10      Formulate a linear programming (LP) model for this problem.    Use solver to find the optimal transportation rule                                    As a management science student, the MD of the company seeks your expert advice on ways in which to determine the optimal                     transportation rule. Advise the MD, providing detailed explanation            using your answer obtain in (b). Write your answer in a form of a report to the MD.
    Two poultry farms supply companies with chicken feeds. The unit costs of shipping from the farms to the companies are given on the table below. The farm's goal is to minimize the cost of meeting customer's demands.   For questions a and b; (a) Generate a mathematical model for finding the least cost way of shipping chicken feeds from the farms to the companies. (b) if the demand of company number 2 increased by 3 units. By how much would the costs increase? Show solution. (c). Solve the total cost using the solver add-in in excel.
    At 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.
  • General 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.
    A manufacturing company produces two types of products called X and Y. Each product uses four different machines like lathe, drilling, grinding & milling operations. The profit per unit of selling X and Y are 7 RO and 3 RO respectively. Formulate a linear programming model with the given constraints to determine the production volume of each product in order to maximize the total profit (in OR).  Solve the following linear programming model by using Graphical method.         Subject to, 6X + 4Y ≤ 24                                                             X + 2Y ≤ 6  -X +  Y ≤ 1            Y ≤ 2 and X,Y ≥ 0
    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.
  • Solve using the duality linear programming method of the following problem:Object Function: F = X1+X2+4X3Subjected to:X1+2X2+3X3 ≥ 1152X1+X2+8X3 ≥ 200X1+X3 ≥ 50X1,X2, X3 ≥ 0   Note: Please make sure to use the duality linear programming method.
    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:…
    A 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 thesolution
    • SEE MORE QUESTIONS
    Recommended textbooks for you
  • Practical Management Science
    Operations Management
    ISBN:9781337406659
    Author:WINSTON, Wayne L.
    Publisher:Cengage,
  • Practical Management Science
    Operations Management
    ISBN:9781337406659
    Author:WINSTON, Wayne L.
    Publisher:Cengage,