Chapter 9 Question 2 [Anisha Patel]

Slides:



Advertisements
Similar presentations
Finance 30210: Managerial Economics Optimization.
Advertisements

Lesson 08 Linear Programming
Question:- A company assembles four products (1, 2, 3, 4) from delivered components. The profit per unit for each product (1, 2, 3, 4) is £10, £15, £22.
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc. 1 Chapter 5 Sensitivity Analysis: An Applied Approach to accompany Introduction to.
Linear Programming Problem
Linear Programming Models & Case Studies
Session 3a Decision Models -- Prof. Juran.
Sherwood Furniture Company
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
Chapter 5 Linear Inequalities and Linear Programming
Learning Objectives for Section 5.3
Chapter 5 Linear Inequalities and Linear Programming Section 3 Linear Programming in Two Dimensions: A Geometric Approach.
Relevant Costs and Benefits
Aggregate Planning Ash Soni ODT Department Kelley School of Business.
© 2008 Prentice-Hall, Inc. Chapter 7 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created.
© The McGraw-Hill Companies, Inc., 2005 McGraw-Hill/Irwin 21-1 INCREMENTAL ANALYSIS Chapter 21.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Integer Programming.
Formulate each problem as a linear program Solve using Excel Solver
Finance 30210: Managerial Economics Optimization.
1 Chapter 6 Sensitivity Analysis and Duality PART 3 Mahmut Ali GÖKÇE.
WEEK 05A – CAPACITY PLANNING AND CONTROL (CHAPTER 7S) Definitions, capacity measurement, MRP II and capacity, utilization, efficiency, breakeven SJSU Bus.
EMGT 501 HW # Due Day: Sep 14.
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Rev. 11/30/03SJSU Bus David Bentley1 Chapter 5 – Capacity Planning and Control Definitions, capacity measurement, MRP II and capacity, utilization,
1 1 Slide Chapter 14: Goal Programming Goal programming is used to solve linear programs with multiple objectives, with each objective viewed as a "goal".
Chapter 5 – Capacity Planning and Control
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
INTRODUCTION TO LINEAR PROGRAMMING
Linear Programming ISQA 459/559. Getting Started with LP Game problem Terms Algebraic & Graphical Illustration LP with Excel.
QM B Lego Simplex. Scenario You manufacture tables and chairs. Tables and chairs are manufactured from small and large bricks. Small brick Large brick.
Chapter 12 (B) Transfer Pricing. The amount charged when one division sells goods or services to another division Battery DivisionVehicle Division Batteries.
Richard McDermott, Ph.D. Accounting 2020
Chapter 10. Resource Allocation
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Chapter Thirteen Short-Run Decision Making: Relevant Costing COPYRIGHT © 2012 Nelson Education Ltd.
Relevant Costs and Benefits
Product Mix Problem Monet company makes four types of frames.
Aggregate Planning and Resource Planning Chapters 13 and 14.
 $10.65 x 40 = $  $ x 50 = $21,
Production Management Application by Aparna Asha. v Saritha Jinto Antony Kurian.
Do the algebra required to find a simultaneous solutions to these two equations (from last class): 3x 1 + x 2  3 x 1 + 3x 2  5 1.
Strategic Production Planning Now showing at your local university.
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
1-1 1 Chapter 7 Manufacturing Processes Process Flow Structures Job shop (ex. Copy center making a single copy of a student term paper) Batch shop.
EMGT 501 Fall 2005 Midterm Exam Due Day: Oct 17 (Noon)
Aggregate Planning Chapter 13. MGMT 326 Foundations of Operations Introduction Strategy Managing Projects Quality Assurance Facilities & Work Design Products.
Short-Run Decision Making; Relevant Costing and Inventory Management Management Accounting: The Cornerstone for Business Decisions Copyright ©2006 by South-Western,
Differential Analysis and Product Pricing Chapter 12.
HW # Due:
Lecture 8 Integer Linear Programming
ACCT 2302 Fundamentals of Accounting II Spring 2011 Lecture 18 Professor Jeff Yu.
Entrepreneurship Chapter 10 - Economics of One Unit.
AAT Level 3 Limiting Factors. Objectives 1. Explain what production decisions are required when resources are scarce 2. State the steps to calculate limiting.
CHAPTER 11 and appendix RELEVANT COSTS With LINEAR PROGRAMMING.
Chapter 5 Decision Making: Relevant Costs and Benefits.
Linear Programming.
Engineering Economics (2+0)
MID-TERM EXAM/REVISION
Relevant Costs for Decision Making
Introduction to Linear Programs
Chapter 5 Linear Inequalities and Linear Programming
The use of linear programming for the allocation of scarce resources
Relevant Costs and Benefits
Duality Theory and Sensitivity Analysis
Constraint management
Widgets Problem Suppose a company produces two types of widgets, manual and electric. Each requires in its manufacture the use of three machines; A, B,
Linear Programming Mr. Carpenter Alg. 2.
Cost Accounting for Decision-making
Linear Programming.
Presentation transcript:

Chapter 9 Question 2 [Anisha Patel] The management of Hartman Company is trying to determine the amount of each of two products to produce over the coming planning period. The following information concerns labor availability, labor utility, and product profitability. Product (hours/unit) Department 1 2 Labour-Hours Available A 1.00 0.35 100 B 0.30 0.20 36 C 0.20 0.50 50 Profit contribution/unit $30.00 $15.00 Develop a linear programming model of the Hartman Company problem. Solve the model to determine the optimal production quantities of products 1 and 2. In computing the profit contribution per unit, management doesn’t deduct labor costs because they are considered fixed for the upcoming planning period. However, suppose that overtime can be scheduled in some of the departments. Which departments would you recommend scheduling for overtime? How much would you be willing to pay per hour of overtime in ach department? Suppose that 10, 6, and 8 hours if overtime may be scheduled in departments A, B, and C, respectively. The cost per hour of overtime is $18 in department A, $22.50 in department B, and $12 in department C. Formulate a linear programming model that can be used to determine the optimal production quantities if overtime is made available. What are the optimal production quantities, and what is the revised total contribution to profit? How much overtime do you recommend using in each department? What is the increase in the total contribution to profit if overtime is used?

Chapter 9 Question 2 Solution X = 77.89, Y = 63.16; $3,284.21 Department A $15.78947; Department B $47.36842  X = 87.21, Y = 65.12, $3341.34 Department A 10 hours; Department B 3.2 hours

Chapter 9 Question 17 [Anisha Patel] 2. Frandec Corporation manufactures, assembles, and rebuilds material handling equipment used in warehouses and distribution centers. One product, called a Liftmaster, is assembled from four components: a frame, a motor, two supports, and a metal strap. Frandec’s production schedule calls for 5,000 Liftmasters to be made next month. Frandec purchases the motors from an outside supplier, but the frames, supports, and straps may either be manufactured by the company or purchased from an outside supplier. Manufacturing and purchase costs per unit are shown. Component Manufacturing Cost Purchase Cost Frame $38.00 $51.00 Support $11.50 $15.00 Strap $6.50 $7.50 Three departments are involved in the production of these components. The time (in minutes per unit) required to process each component in each department and the available capacity (in hours) for the three departments are as follows: Department Component Cutting Milling Shaping Frame 3.5 2.2 3.1 Support 1.3 1.7 2.6 Strap 0.8 0.0 1.7 Capacity (hours) 350 420 680 a. Formulate and solve a linear programming model for this make-or-buy application. How many of each component should be manufactured and how many should be purchased? b. What is the total cost of the manufacturing and purchasing plan? c. How many hours of production time are used in each department? d. How much should Frandec be willing to pay for an additional hour of time in the shaping department? e. Another manufacturer has offered to sell frames to Frandec for $45.00 per unit. Could Frandec improve its position by pursuing this opportunity? Why or why not?

Chapter 9 Question 17 Solution Minimize 38.00xf + 11.50xu + 6.50xt + 51.00yf + 15.00yu + 7.50yt Demand Capacity xf + yf = 5000 3.5xf + 1.3xu + 0.8xt ≤ 350 キ 60 x+ y= 10000 2.2x+ 1.7x+ 0.0x≤ 420 キ 60 x+ y= 5000 3.1x+ 2.6x+ 1.7x≤ 680 キ 60       

Chapter 9 Question 17 Solution Cont.

Chapter 9 Question 17 Solution Cont. The optimal solution is to manufacture 5,000 frames, 2,692.31 supports, and 0 straps; and to purchase 0 frames, 7307.69 supports, and 5,000 straps. The total cost is $368076.9  The solution calls for 350 hours of cutting time, 259.62 hours of milling time, and 375 hours of shaping time  Because this last requirement is not binding, Frandec should not pay anything for an additional hour of time in the shaping department.  The shadow price of the frame constraint is $47. Therefore, Frandec would benefit from purchasing frames if they are available for $45. That would be true up to a maximum purchase of 2714:3 units, which is the allowable decrease on that shadow price.