Example 4.5 Production Process Models. 4.14.1 | 4.2 | 4.3 | 4.4 | 4.6 | 4.74.24.34.44.64.7 Background Information n Repco produces three drugs, A, B and.

Slides:



Advertisements
Similar presentations
Dynamic Workforce Planning Models
Advertisements

Introduction to LP Modeling
A Multiperiod Production Problem
Static Workforce Scheduling Models
Solving LP Problems in a Spreadsheet
Example 2.2 Estimating the Relationship between Price and Demand.
Wyndor Example; Enter data Organize the data for the model on the spreadsheet. Type in the coefficients of the constraints and the objective function.
Optimization Models Module 9. MODEL OUTPUT EXTERNAL INPUTS DECISION INPUTS Optimization models answer the question, “What decision values give the best.
Example 5.6 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
Example 6.1 Capital Budgeting Models | 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Tatham Company is considering seven.
Example 14.3 Football Production at the Pigskin Company
Spreadsheet Simulation
Spreadsheet Demonstration
Example 4.7 Data Envelopment Analysis (DEA) | 4.2 | 4.3 | 4.4 | 4.5 | Background Information n Consider a group of three hospitals.
Example 6.4 Plant and Warehouse Location Models | 6.2 | 6.3 | 6.5 | 6.6 | Background Information n Huntco produces tomato sauce.
Project 7 Forecasting Values With What-If Analysis: Using Data Tables, Scenarios, Goal Seek, and Solver Jason C. H. Chen, Ph.D. Professor of Management.
Linear Programming Excel Solver. MAX8X 1 + 5X 2 s.t.2X 1 + 1X 2 ≤ 1000 (Plastic) 3X 1 + 4X 2 ≤ 2400 (Prod. Time) X 1 + X 2 ≤ 700 (Total Prod.) X 1 - X.
Example 6.2 Fixed-Cost Models | 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Great Threads Company is capable of manufacturing.
Example 5.3 More General Logistics Models | 5.2 | 5.4 | 5.5 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
Example 5.5 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
Example 11.1 Simulation with Built-In Excel Tools.
Example 7.1 Pricing Models | 7.3 | 7.4 | 7.5 | 7.6 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n The Madison.
Example 9.1 Goal Programming | 9.3 | Background Information n The Leon Burnit Ad Agency is trying to determine a TV advertising schedule.
Example 7.6 Facility Location Models | 7.2 | 7.3 | 7.4 | 7.5 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information.
Nonlinear Pricing Models
Example 4.4 Blending Models.
 Explore the principles of cost-volume-profit relationships  Perform a basic what-if analysis  Use Goal Seek to calculate a solution  Create a one-variable.
Example 15.2 Blending Oil Products at Chandler Oil
Example 14.1 Introduction to LP Modeling. 14.1a14.1a | 14.2 | Linear Programming n Linear programming (LP) is a method of spreadsheet optimization.
Linear Programming The Industrial Revolution resulted in (eventually) -- large companies, large problems How to optimize the utilization of scarce resources?
Transportation Models
Example 15.3 Supplying Power at Midwest Electric Logistics Model.
Example 15.4 Distributing Tomato Products at the RedBrand Company
COMPREHENSIVE Excel Tutorial 10 Performing What-If Analyses.
EXAMPLE: 3.1 ASSEMBLING AND TESTING COMPUTERS
Example 16.1 Ordering calendars at Walton Bookstore
Example 7.2 Pricing Models | 7.3 | 7.4 | 7.5 | 7.6 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n We continue.
Spreadsheet Modeling of Linear Programming (LP). Spreadsheet Modeling There is no exact one way to develop an LP spreadsheet model. We will work through.
Example 15.6 Managing Cash Flows at Fun Toys
Integer Programming Models
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc Chapter 3 Introduction to Optimization Modeling.
Example 15.1 Daily Scheduling of Postal Employees Workforce Scheduling Models.
Example 5.8 Non-logistics Network Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.6 | 5.7 | 5.9 | 5.10 | 5.10a a Background Information.
Linear Programming: Basic Concepts
We can make Product1 and Product2. There are 3 resources; Resource1, Resource2, Resource3. Product1 needs one hour of Resource1, nothing of Resource2,
Example 2.5 Decisions Involving the Time Value of Money.
1 Chapter 11 A number of important scheduling problems... require the study of an astronomical number of arrangements to determine which one is best....
Example 2.3 An Ordering Decision with Quantity Discounts.
Transportation and Assignment Problems
MBA7020_12.ppt/July 25, 2005/Page 1 Georgia State University - Confidential MBA 7020 Business Analysis Foundations Optimization Modeling July 25, 2005.
Optimization using LP models Repco Pharmaceuticals (Ex 4.6) Ravi Krishna Ravula Dsc 8240.
Example 15.7 Capital Budgeting at the Tatham Company Integer Programming Models.
 Review the principles of cost-volume-profit relationships  Discuss Excel what-if analysis tools 2.
Data Tables for Sensitivity Analysis JCHP Break Even Analysis.
Chapter 4 Linear Programming Models. Example 4.1 – Advertising Model General Flakes Company advertises a low-fat breakfast cereal in a variety of 30 second.
Example 5.10 Project Scheduling Models | 5.2 | 5.3 | 5.4 | 5.5 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10a a Background Information.
DAY 9: MICROSOFT EXCEL – CHAPTER 6 Sravanthi Lakkimsetty Sept 16, 2015.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Example 3.1a Sensitivity Analysis and Solver Table Add-in.
Solver Feature Excel’s KY San Jose State University Engineering 10.
A Multiperiod Production Problem
Solver Feature Excel’s KY San Jose State University Engineering 10.
Project Scheduling Models
Microsoft Excel 2003 Illustrated Complete
Introduction to linear programming (LP): Minimization
Navya Thum February 13, 2013 Day 7: MICROSOFT EXCEL Navya Thum February 13, 2013.
Sensitivity.
Optimization Models Module 9.
Presentation transcript:

Example 4.5 Production Process Models

| 4.2 | 4.3 | 4.4 | 4.6 | Background Information n Repco produces three drugs, A, B and C, and can sell these drugs in unlimited quantities at unit prices $8, $70, and $100, respectively. n Producing a unit of A requires 1 hours of labor. n Producing a unit of B requires 2 hours of labor and 2 units of A. n Producing 1 unit of C requires 3 hours of labor and 1 unit of B.

| 4.2 | 4.3 | 4.4 | 4.6 | Background Information – continued n Any product A that is used to produce B cannot be sold, and any product B that is used to produce C cannot be sold. n A total of 40 hours of labor are available. n Repco wants to use LP to maximize its sales revenue.

| 4.2 | 4.3 | 4.4 | 4.6 | Solution n To model Repco’s operation we need to keep track of the following: –The number of units produced of each product –The number of units sold of each product –The number of units of A and B used to produce other products –The number of labor hours used –The revenue received

| 4.2 | 4.3 | 4.4 | 4.6 | Developing the Model n The key to developing the spreadsheet model is that everything that is produced must be used in some way. n Either it must be used as an input to the production of some other product, or it must be sold. Therefore, we have the “balance” equation for each product: Amount produced = Amount used to produce other products + Amount sold n We will implement this “balance” equation by designing both the amounts produced and the amounts sold as changing cells. Then we will impose a constraint that the above equation must be satisfied.

| 4.2 | 4.3 | 4.4 | 4.6 | REPCO.XLS n This file shows the spreadsheet model for this problem. n The spreadsheet figure on the next slide shows the model.

| 4.2 | 4.3 | 4.4 | 4.6 |

| 4.2 | 4.3 | 4.4 | 4.6 | Developing the Model n To proceed, carry out the following steps. –Inputs. Enter the number of labor hours needed to produce a unit of each product in the HrsReqd range and enter the number of units of each product needed to manufacture each other product in the range B7:D9. Then enter the unit selling prices for the products in the UnitPrices range and enter the available labor hours in the HrsAvailable cell. –Units produced. Enter any trial values for the number of units produced and sold in the UnitsProduced and UnitsSold ranges.

| 4.2 | 4.3 | 4.4 | 4.6 | Developing the Model – continued –Units used to make other products. In the range G16:I18 calculate the total number of units of each product that are used to produce other products. Begin by calculating the amount of A used to produce A in cell G16 with the formula =B7*B$16 and copy this formula to the range G16:I18 for the other combinations of products. Then calculate the row totals in column J with the SUM function. It is convenient to “transfer” these sums in column J to the B18:D18 range. Use Excel’s TRANSPOSE function, type the formula =TRANSPOSE(UnitsUsedAsInputs) and press Ctrl-Shift- Enter.

| 4.2 | 4.3 | 4.4 | 4.6 | Developing the Model – continued –Units used total. We want to force the units produced of each product to equal the units used total of each product. We do this in rows 23 and 25. For row 23, enter the formula =B16 in cell B23 and copy it to the range C23:D23. For row 25, enter the formula =B18 + B19 in cell B25 and copy it to the range C25:D25. –Labor hours used. Calculate the total number of labor hours used in the HrsUsed cell with the formula =SUMPRODUCT(HrsReqd,UnitsProduced). –Total revenue. Calculate Repco’s revenue from sales in the Revenue cell with the formula =SUMPRODUCT(UnitPrices,UnitsSold).

| 4.2 | 4.3 | 4.4 | 4.6 | Developing the Model – continued n Using Solver: To use Solver to maximize Repco’s revenue, proceed as follows. –Objective. Select the Revenue cell as the target cell to maximize. –Changing cells. Select the UnitsProduced and UnitsSold as the changing cells. –Labor availability constraint. Enter the constraint HrsUsed<=HrsAvailable. This ensures that at most 40 hours of labor are used. –Product balance constraint. Enter the constraint UnitsProduced=UnitsUsedTotal to ensure that production matches usage for each product.

| 4.2 | 4.3 | 4.4 | 4.6 | Developing the Model – continued –Specify nonnegativity and optimize. Under SolverOptions, check the nonnegativity box, and use the LP algorithm to obtain the optimal solution shown. n The Solver dialog should appear as shown here.

| 4.2 | 4.3 | 4.4 | 4.6 | Solution n We see that Repco obtains a revenue of $700 by producing 20 units of product A, which are then used to produce 10 units of product B. n All units of product B produced are sold. n Even though product C has the highest selling price, Repco produces non of the product C. n This is because of the large labor equipment for product C.

| 4.2 | 4.3 | 4.4 | 4.6 | Sensitivity Analysis n We saw that product C is not produced at all, even though its selling price is by far the highest. n How high would this selling price have to be to induce Repco to produce any of product C? n We use SolverTable to answer this, using product C selling price as the input variable, letting it vary from $100 to $200 in increments of $10, and keeping track of the total revenue, the units produced of each product, and the units used (row 18) of each product. The results appear on the next slide.

| 4.2 | 4.3 | 4.4 | 4.6 |

| 4.2 | 4.3 | 4.4 | 4.6 | Sensitivity Analysis – continued n As we see, until the product C selling price gets to $130, Repco uses the same solution as above. n However, when it increases to $130 and beyond, units of C are produced. n This in turn requires units of product B, which requires units of product A, but only product C is actually sold. n Of course Repco would like to produce even more of product C, but the labor hour constraint does not allow it.

| 4.2 | 4.3 | 4.4 | 4.6 | Sensitivity Analysis – continued n Therefore, further increases in selling price of product C have no effect on the solution – other than increasing revenue. n Because available labor imposes an upper limit on the production of product C, even when it is very profitable, it is interesting to see what happens when the selling price of product C and labor hour availability as the two inputs with appropriate values, and selecting the amount produced of product C as the single output. n The results appear on the next slide.

| 4.2 | 4.3 | 4.4 | 4.6 |

| 4.2 | 4.3 | 4.4 | 4.6 | Sensitivity Analysis – continued n This table shows that no product C is produced, regardless of labor hour availability, until the selling price of C is $130. n The effect of increases in labor hour availability is to let Repco produce more of product C. n Specifically, Repco will produce as much of C as possible, given that 1 unit of B, and hence 2 units of A, are required for each unit of C.

| 4.2 | 4.3 | 4.4 | 4.6 | Sensitivity Analysis – continued n Before leaving this example, we provide some further insight into the sensitivity behavior. n Specifically, why should Repco start producing product C when its unit selling price increases to some value between $120 and $130? n We can provide a straightforward answer to this question because there is a single resource constraint, the labor hour constraint.

| 4.2 | 4.3 | 4.4 | 4.6 | Sensitivity Analysis – continued n Consider the production of 1 unit of product B. It requires 2 labor hours plus 2 units of A, each of which requires 1 labor hour, for a total of 4 labor hours, and it returns $70 in revenue. n Therefore, revenue per labor hours when producing product B is $ n To be eligible as a “winner” product C has to beat this. To beat the $17.50 revenue per labor hour of product B, product C’s unit selling price must be at least $

| 4.2 | 4.3 | 4.4 | 4.6 | Sensitivity Analysis – continued n If its selling price is below this, such as $120, Repco will sell all products B and no product C. n If its selling price is above this, such as $130, Repco will sell all product C and no product B. n As this analysis illustrates, we can sometimes – but not always – unravel the information obtained by SolverTable.