Example 4.4 Blending Models.

Slides:



Advertisements
Similar presentations
Dynamic Workforce Planning Models
Advertisements

Introduction to LP Modeling
A Multiperiod Production Problem
Network Models Robert Zimmer Room 6, 25 St James.
Example 7.3 Pricing Models | 7.2 | 7.4 | 7.5 | 7.6 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n Suits.
Static Workforce Scheduling Models
Solving LP Problems in a Spreadsheet
Example 2.2 Estimating the Relationship between Price and Demand.
Example 16.1 Forecasting Sales at Best Chips. Thomson/South-Western 2007 © South-Western/Cengage Learning © 2009Practical Management Science, Revised.
Example 2.1 Finding a Breakeven Point. Background Information n The Great Threads Company sells hand-knit sweaters. Great Threads is planning to print.
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 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.
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 8.7 Cluster Analysis | 8.2 | 8.3 | 8.4 | 8.5 | 8.6 | CLUSTERS.XLS n This file contains demographic data on 49 of.
Example 9.1 Goal Programming | 9.3 | Background Information n The Leon Burnit Ad Agency is trying to determine a TV advertising schedule.
Computational Methods for Management and Economics Carla Gomes Module 4 Displaying and Solving LP Models on a Spreadsheet.
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
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
 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.
3 Components for a Spreadsheet Linear Programming Problem There is one cell which can be identified as the Target or Set Cell, the single objective of.
Linear Programming The Industrial Revolution resulted in (eventually) -- large companies, large problems How to optimize the utilization of scarce resources?
Non-Linear Simultaneous Equations
Transportation Models
Example 15.3 Supplying Power at Midwest Electric Logistics Model.
Example 15.4 Distributing Tomato Products at the RedBrand Company
Chapter 3 Introduction to Optimization Modeling
EXAMPLE: 3.1 ASSEMBLING AND TESTING COMPUTERS
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
Example 12.6 A Financial Planning Model | 12.2 | 12.3 | 12.4 | 12.5 | 12.7 |12.8 | 12.9 | | | | | | |
Product Mix Problem Monet company makes four types of frames.
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
Example 4.5 Production Process Models | 4.2 | 4.3 | 4.4 | 4.6 | Background Information n Repco produces three drugs, A, B and.
Robert Delgado Chris Mui Amanda Smith Presented to: Dr. Sima Parisay Due: October 20 th, 2011 California State Polytechnic University, Pomona.
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.
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc Chapter 3 Introduction to Optimization Modeling.
Example 2.5 Decisions Involving the Time Value of Money.
Chapter © 2015 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or.
Example 2.3 An Ordering Decision with Quantity Discounts.
Example 16.6 Forecasting Hardware Sales at Lee’s.
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.
Goal Seek and Solver. Goal seeking helps you n Find a specific value for a target cell by adjusting the value of one other cell whose value is allowed.
Example 13.6a Houses Sold in the Midwest Exponential Smoothing.
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.
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.
A Multiperiod Production Problem
DECISION MODELING WITH Prentice Hall Publishers and
Project Scheduling Models
Solver & Optimization Problems
Presentation transcript:

Example 4.4 Blending Models

Background Information Chandler Oil has 5000 barrels of crude oil 1 and 10,000 barrels of crude oil 2 available. Chandler sells gasoline and heating oil. These products are produced by blending together the two crude oils. Each barrel of crude oil 1 has a “quality level” of 10 and each barrel of crude oil 2 has a quality level of 5. Gasoline must have have an average quality level of at least 8, while heating oil must have an average level of at least 6.

Background Information -- continued Gasoline sells for $25 per barrel and heating oil sells for $20 per barrel. The advertising cost to sell one barrel of gasoline is $0.20 and the advertising cost to sell one barrel of heating oil is $0.10. We assume that demand for heating oil and gasoline is unlimited, so that all of Chandler’s production can be sold. Chandler wants to maximize profits.

Solution To model Chandler’s problem, we must keep track of the following: The number of barrels of gasoline and heating oil produced (the outputs) The number of barrels of each crude oil (the inputs) used to produce each output The quality levels of the inputs used to make the outputs The total profit earned

BLENDING.XLS This file shows the spreadsheet model for this problem. The spreadsheet figure on the next slide shows the model.

Developing the Model To develop this model, proceed as follows. Monetary and quality inputs. Enter the unit profit contributions and advertising costs in the SellingPrices and UnitAdCosts ranges. Enter the quality levels for crude oils in the QualityLevels range and the quality standards for the outputs in the range B13:C13. Enter the barrels available in the Available range. Inputs blended into each output. Although it may not be immediately apparent, the quantities Chandler must choose to specify any solution are the barrels of each input used to produce each output. Therefore, enter any trial values for these values in the BlendPlan range. The BlendPlan range will be the changing cell range.

Developing the Model -- continued Inputs used and outputs sold. We need to calculate the row sums and column sums of the BlendPlan range. Quality achieved. Keeping track of the quality level of gasoline and heating oil in the QualityObtained range is tricky. Begin by calculating for each output the number of quality points (QP) in the inputs used to produce this output: QP in gasoline = 10 * (Oil 1 in gasoline) + 5 * (Oil 2 in gasoline) QP in heating oil = 10 * (Oil 1 in heating oil) + 5 * (Oil 2 in heating oil) For the gasoline produced to have a quality level of at least 8, we must have QP in gasoline  8 * Gasoline sold For the heating oil produced to have a quality level of at least 6, we must have QP in heating oil  6 * Heating Oil sold

Developing the Model -- continued To implement the Inequalities, calculate the QP for gasoline in cell B23 with the formula =SUMPRODUCT(B17:B18,QualityLevels) then copy this formula to cell C23 to generate the QP for heating oil. Quality required. Calculate the required quality points for gasoline and heating oil in the QualityReqd range. Specifically, in cell B25 determine the required quality points for gasoline with the formula =B13*B19. Then copy this formula to cell C25 to calculate the required quality points for heating oil.

Developing the Model -- continued Revenue, cost and profit. Calculate the total revenue, total advertising cost, and total profit in the Revenue, AdCost, and Profit cells with the formulas =SUMPRODUCT(SellingPrices,Sold), =SUMPRODUCT(UnitAdCosts,Sold) and =Revenue- AdCost. Using Solver: To solve Chandler’s problem with Solver, proceed as follows. Objective. Maximize profit by choosing the Profit cell as the target cell. Changing cells. Select the BlendPlan range as the changing cells.

Developing the Model -- continued Crude oil availability constraint. Enter the constraint Used <=Available. This endures that no more of any oil is used than is available. Quality constraint. Enter the constraint QualityObtained>=QualityReqd. This ensures that the gasoline and heating oil produced are acceptable quality. Specify nonnegativity and optimize. Under SolverOptions, check the nonnegativity box, and use the LP algorithm to obtain the optimal solution shown. The Solver dialog should appear as shown on the next slide.

Solution The solution implies that Chandler should make 5000 barrels of gasoline with 3000 barrels of crude oil 1 and 2000 barrels of crude oil 2. It should also make 10,000 barrels of heating oil with 2000 barrels of crude oil 1 and 8000 barrels of crude oil 2. With this blend Chandler will earn a profit of $323,000.

Solution -- continued As stated earlier, we believe this problem is sufficiently complex to defy intuition. Clearly, gasoline is more profitable per barrel than heating oil, but given the crude availability and the quality constraints, it turns out that Chandler should sell twice as much heating oil as gasoline. This would have been very difficult to guess ahead of time.

Sensitivity Analysis We perform two typical sensitivity analyses on the Chandler blending model. In each, we see how profit and the amounts of the outputs produced vary. In the first analysis, we use the unit selling price of gasoline as the input and let it vary from $20 to $80 in increments of $5. The SolverTable results appear in the figure on the next slide.

Sensitivity Analysis -- continued Two things are of interest. First, as the price of gasoline increases, Chandler produces more gasoline and less heating oil, exactly as we would expect. Second, the profit never decreases, as the changes in column E indicate. In the second sensitivity analysis, we vary the availability of crude 1 from 2000 barrels to 20,000 barrels in increments of 1000 barrels.

Sensitivity Analysis -- continued The resulting SolverTable output appears here.

Sensitivity Analysis -- continued These results make sense if we analyze them carefully. First, the profit increases, but at a decreasing rate, as more crude 1 is available. This is a common occurrence in LP models. As more of a resource is made available, profit can only increase, but each extra unit of the resource produces less profit than the previous unit. Second, the amount of gasoline produced increases while the amount of heating oil produced decreases. Why? Crude 1 has higher quality than crude 2, and gasoline requires higher quality. Gasoline also sells for a higher price. Therefore, as more crude 1 is available, Chandler can produce more gasoline, receive more profit, and still meet quality standards.

Modeling Issues We used the inequality as the Quality constraint for gasoline. It might appear more natural to write this in terms of average quality points by dividing through by Gasoline sold: (QP in gasoline)/(Gasoline sold)  8 While this is logically correct, we prefer the Inequality for two reasons. First, it is conceivable that no gasoline should be sold. Second, is that the second inequality is technically nonlinear, as the Solver will inform you if you try to use the LP algorithm. The lesson, therefore, is to “clear denominators” in blending problem constraints.

Modeling Issues -- continued We have assumed that the quality level of a mixture is a linear function of the fraction of each input used in the mixture. For example, we have assumed that if gasoline is made with a fraction 3/5 of crude oil 1 and 2/5 of crude oil 2, then Quality Level of Gasoline = 3/5 * Quality Level of Oil 1 + 2/5 * Quality Level of Oil 2 If the quality level of the output is not a linear function of the fraction of each input used in the mixture, then we no longer have a linear model; we have a nonlinear model.

Modeling Issues -- continued In reality, a company using a blending model would run the model periodically and set production on the basis of the current inventory of inputs and the current demand forecasts. Then the forecasts and the input levels would be updated, and the model would run again to determine the next day’s production.