Practical Management Science
6th Edition
ISBN: 9781337406659
Author: WINSTON, Wayne L.
Publisher: Cengage,
expand_more
expand_more
format_list_bulleted
Question
Expert Solution
arrow_forward
Step 1: Introduce the question:
For this question, I will formulate the Linear programming model, and then, I will solve this LP using the 2 phase simplex method, There are a total of three decision variables and it is a cost minimization problem, from the REF of the last table, I can answer the rest questions,
Step by stepSolved in 5 steps with 15 images
Knowledge Booster
Similar questions
- Suppose 100,000 lamps are to be manufactured annually. It costs $1 to store a lamp for 1 year, $500 to set up the factory to produce a batch of lamps and $5 to produce each lamp. A. If all lamps are produced in one batch find the total cost? B. If all lamps are produced in two batches of equal size, find the total cost? C. If the number of units in each batch is q, then how many batches are there? D. Find the number of lamps in each batch to minmize the total cost? E. What is the minimum cost? [ i need all answer i will upvote]arrow_forward33 White & Becker Tools (W&B) requires 2,000 elec- tric motors next month for its product line of weed trimmers. Each motor is composed of three com- ponents: a coil, a shaft, and housing. W&B has the capability to produce these components or purchase them from an outside vendor. The costs of produc- ing them and purchasing them are shown in the following table. COMPONENT Coil Shaft Housing DEPART- MENT PRODUCTION COST PER UNIT Fabrication 0.5 Molding 0.4 Inspection 0.2 $2.60 $1.80 $1.40 The components that are produced by W&B must pass through three departments: fabrication, molding, and inspection. The number of hours each component requires in each department and the total number of hours available next month in each department are shown in the following table: 0.2 0.7 0.3 PURCHASE COST PER UNIT COIL SHAFT HOUSING AVAILABILITY (HR.) (HR.) (HR.) (HR.) $3.12 $2.16 $1.68 0.6 0.3 0.4 3,000 3,000 1,800 In order to determine the number of components that will be produced and the number…arrow_forwardallons of deionized water from each wholesaler to each distribution center is shown in the following table: Question Viewer a. Which of the following statements regarding setting up the tableau for the optimal solution for this problem is true? B. The sum of supply capacities is greater than the sum of demands, so a dummy distribution center is needed. C. The sum of supply capacities is less than the sum of demands, so a dummy wholesaler is needed. b. What is the total cost of the solution? The optimal cost is $ ((Enter your response rounded to the nearest dollar.)arrow_forward
- Problem 20-36 (Algo) Palin's Muffler Shop has one standard muffler that fits a large variety of cars. The shop wishes to establish a periodic review system to manage inventory of this standard muffler. Use the information in the following table to determine the optimal inventory target level (or order-up-to level). Annual demand standard deviation of daily demand Item cost Annual holding cost Review period 2, 240 6 $35.00 20 28 Optimal target level mufflers mufflers per working day per muffler % of item value working days Ordering cost Service probability Lead time Working days $60 per order 89 % 2 working days per year 280 a. What is the optimal target level (order-up-to level)? (Use Excel's NORMSINV() function to find the correct critical value for the given a-level. Do not round intermediate calculations. Round "z" value to 2 decimal places and final answer to the nearest whole number.)arrow_forwardJohn is travelling from home in Sydney to a hotel in Perth. Three stopovers on the way a number of choices of towns for each stop only one hotel to choose from in each town, except for Perth, where there are three hotels (J, K, and L) to choose from Each trip has a different distance resulting in a different cost (petrol) (cost is marked by each arc) Hotels have different costs (cost is marked by each node (town)) ● ● ● The goal is to select a route to and a hotel in Perth so that the overall cost of the trip is minimized. Use dynamic programming (forward recursion) to solve this problem by constructing the usual tables for each stage. Stage: 0 (Sydney) 1 Petrol cost start 22 8 12 Hotel cost 70 80 B 80 25 10 2 50 A E 70 30 10 18 8 7 3 50 F 70 70 H 60 8 10 10 4 (Perth) 50 13 K 10 15 L 60 70arrow_forwardexample 1a 1.plot all the corner points for the feasible area. 2. Find the optimum solution to X= Y= VALUE Z=arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill EducationOperations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
- Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage LearningProduction and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education
Purchasing and Supply Chain Management
Operations Management
ISBN:9781285869681
Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...
Operations Management
ISBN:9781478623069
Author:Steven Nahmias, Tava Lennon Olsen
Publisher:Waveland Press, Inc.