Example 6.1 Capital Budgeting Models. 6.26.2 | 6.3 | 6.4 | 6.5 | 6.6 | 6.76.36.46.56.66.7 Background Information n The Tatham Company is considering seven.

Slides:



Advertisements
Similar presentations
Dynamic Workforce Planning Models
Advertisements

Introduction to LP Modeling
A Multiperiod Production Problem
Static Workforce Scheduling Models
BU Decision Models Integer_LP1 Integer Optimization Summer 2013.
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.
13b.1 Van Horne and Wachowicz, Fundamentals of Financial Management, 13th edition. © Pearson Education Limited Created by Gregory Kuhlemeyer. Chapter.
Example 14.3 Football Production at the Pigskin Company
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 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.
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
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.
Example 16.3 Estimating Total Cost for Several Products.
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 | | | | | | |
Chapter 19 Linear Programming McGraw-Hill/Irwin
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.
Spreadsheets in Finance and Forecasting Presentation 8: Problem Solving.
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.
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc Chapter 3 Introduction to Optimization Modeling.
McGraw-Hill/Irwin Copyright © 2013 by The McGraw-Hill Companies, Inc. All rights reserved. Net Present Value and Payback Module 2.2.
Example 15.1 Daily Scheduling of Postal Employees Workforce Scheduling Models.
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
Example 2.5 Decisions Involving the Time Value of Money.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Principles of Engineering Economic Analysis, 5th edition Chapter 15 Capital Budgeting.
Appendix B A BRIEF TOUR OF SOLVER Prescriptive Analytics
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.
 Review the principles of cost-volume-profit relationships  Discuss Excel what-if analysis tools 2.
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.
Supplementary Chapter B Optimization Models with Uncertainty
A Multiperiod Production Problem
DECISION MODELING WITH Prentice Hall Publishers and
Project Scheduling Models
Table of Contents Chapter 5 (What-If Analysis for Linear Programming)
Solver & Optimization Problems
Excel Solver IE 469 Spring 2017.
Excel Solver.
Excel Solver IE 469 Spring 2018.
Navya Thum February 13, 2013 Day 7: MICROSOFT EXCEL Navya Thum February 13, 2013.
Excel Solver IE 469 Fall 2018.
Excel Solver IE 469 Spring 2019.
Presentation transcript:

Example 6.1 Capital Budgeting Models

| 6.3 | 6.4 | 6.5 | 6.6 | Background Information n The Tatham Company is considering seven investments. The cash required for each investment and the net present value (NPV) each investment adds to the form are given in the table shown here. Data for Tatham Capital Budgeting Example Cash Required NPV Added Investment 1$5,000$16,000 Investment 2$2,500$8,000 Investment 3$3,500$10,000 Investment 4$6,000$20,000 Investment 5$7,000$22,000 Investment 6$4,500$12,000 Investment 7$3,000$8,000

| 6.3 | 6.4 | 6.5 | 6.6 | Background Information – continued n The cash available for investment is $15,000. n Tatham wants to find the investment policy that maximizes its NPV. n The crucial assumption here is that if Tatham wishes to take part in any of these investments, it must go “all the way”. n It cannot, for example, go halfway in investment 1 by investing $2500 and realizing an NPV of $8000.

| 6.3 | 6.4 | 6.5 | 6.6 | Solution n The solution of this problem is quite straightforward. Tatham must keep track of –Investments chosen –Total cash required for the chosen investments –Total NPV from the chose investments

| 6.3 | 6.4 | 6.5 | 6.6 | TATHAM.XLS n To keep track of which investments are chosen, we use a 0-1 variable for each investment. n If a particular investment is chosen, the 0-1 variable for this investment will equal 1; if it is not chosen, the 0-1 variable will equal 0. n This file contains the spreadsheet model. The spreadsheet is shown on the next slide.

| 6.3 | 6.4 | 6.5 | 6.6 |

| 6.3 | 6.4 | 6.5 | 6.6 | Developing the Model n To develop this model, proceed as follows. –Inputs. Enter the NPV for each investment in the NPVs range, the cost required by each investment in the Costs range, and the amount of available cash in the Budget cell. –0-1 values for investments. Enter any trial 0-1 values for the investments in the Investments range. (Even fractional values such as 0.5 can be entered in these cells. The Solve constraints will eventually force them to be 0 or 1. –NPV contributions. Calculate the NPV contributed by the investments in the TotNPV cell with the formula =SUMPRODUCT(Investments,NPVs). Note that this formula “picks up” the NPV only for those investments with 0-1 variables equal to 1.

| 6.3 | 6.4 | 6.5 | 6.6 | Developing the Model – continued –Cash invested. Calculate the total cash invested in the TotCost cell with the formula =SUMPRODUCT(Investments,Costs). Again, this picks up only the costs of investments with 0-1 variables equal to 1.

| 6.3 | 6.4 | 6.5 | 6.6 | Using the Solver n The Solver dialog box is shown here.

| 6.3 | 6.4 | 6.5 | 6.6 | Using the Solver – continued n We want to maximize the total NPV, subject to staying within the budget. n However, we also need to constrain the changing cells to be 0-1. n With the Solver for Excel 97/2000 this is simple, as shown in the dialog box here.

| 6.3 | 6.4 | 6.5 | 6.6 | Using the Solver – continued n We add a constraint with Investments in the left box and choose the “bin” option in the middle box. n The “binary” in the right box is added automatically. n Note that if all changing cells are binary, we do not need to check Solver’s Assume Non-Negative option, but we should still check the Assume Linear Model option if it applies, as it does here.

| 6.3 | 6.4 | 6.5 | 6.6 | Solution n The optimal solution that was shown indicates that Tatham can obtain a maximum NPV of $46,000 by selecting investments 1, 3, and 4. n These three investments use up only $14,500 of the available budget, with $500 left over. However this $500 is not enough – investing all the way is required – to invest in any of the remaining investments. n If we rank Tatham’s investments on the basis of NPV per dollar invested, the ranking from best to worst is 4, 1, 2, 5, 3, 6, 7.

| 6.3 | 6.4 | 6.5 | 6.6 | Solution – continued n Using your economic intuition, you might expect the investments to be chosen in this order, until the budget runs out. n However, the optimal solution does not do this. It selects investment 3 instead of 2 or 5. n To understand why this is the case, suppose Tatham invests in the three highest-ranking investments: 4, 1, and 2. n This uses up $13,500 of the budget, with $1500 left over and unusable.

| 6.3 | 6.4 | 6.5 | 6.6 | Solution – continued n A better solution is to choose investments 4, 1, and 3, which uses the budget more efficiently. n In general, the trick is to select a combination of investments that have “good” NPVs and use up all or almost all of the budget.

| 6.3 | 6.4 | 6.5 | 6.6 | Sensitivity Analysis n SolverTable can be used on models with binary variables exactly as we have used it in previous models. n Here we see the total NPV varies as the budget increases. n We select the Budget cell as the single input cell, allow it to vary from $15,000 to $25,000 in increments of $1000, and keep track of the total NPV, the amount of the budget used, and the binary variables.

| 6.3 | 6.4 | 6.5 | 6.6 | Sensitivity Analysis – continued n The results appear on the next slide.Clearly, Tatham can achieve a larger NPV with a larger budget, but as the numbers and the chart show, each extra $1000 of budget does not have the same effect on total NPV. n The first few $1000 increases to the budget each add $4000 to total NPV. Then the jumps from $18,000 to $19,000 and from $19,000 to $20,000 add only $2000 to total NPV, but the jump from $20,000 to $21,000 again adds $4000 to total NPV. n Note also how selected investments vary wildly as the budget increases. This somewhat strange behavior is due to the all-or-nothing nature of the problem.

| 6.3 | 6.4 | 6.5 | 6.6 |