Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.

Slides:



Advertisements
Similar presentations
Financial Analysis, Planning and Forecasting Theory and Application
Advertisements

Standard Minimization Problems with the Dual
EMGT 501 HW #1 Solutions Chapter 2 - SELF TEST 18
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
Linear Programming Using the Excel Solver
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Chapter 6 Linear Programming: The Simplex Method
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 99 Chapter 4 The Simplex Method.
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
Introduction to Management Science
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Introduction to Management Science
Chapter 4 The Simplex Method
Solving Equations with the Variable on Both Sides
Linear-Programming Applications
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Chapter 19 Linear Programming McGraw-Hill/Irwin
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
Linear Programming - Standard Form
Chapter 4: Modeling and Analysis
Linear Programming Chapter 13 Supplement.
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
Mathematical Programming Cht. 2, 3, 4, 5, 9, 10.
Introduction to Management Science
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
STDM - Linear Programming 1 By Isuru Manawadu B.Sc in Accounting Sp. (USJP), ACA, AFM
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Duality Theory LI Xiaolei.
1 Chapter 10 The primal linear program solution answers the tactical question when it tells us how much to produce. But the dual can have far greater impact.
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Chapter 6 Supplement Linear Programming.
Chapter 6 Linear Programming: The Simplex Method Section R Review.
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Mar 4, 2011.
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
1 1 Slide © 2005 Thomson/South-Western Simplex-Based Sensitivity Analysis and Duality n Sensitivity Analysis with the Simplex Tableau n Duality.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.3 The student will be able to formulate the dual problem. The student.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ 5.5 Dual problem: minimization.
OR Chapter 7. The Revised Simplex Method  Recall Theorem 3.1, same basis  same dictionary Entire dictionary can be constructed as long as we.
1 Management Science. 2 Chapter Topics The Management Science Approach to Problem Solving Model Building: Break-Even Analysis Computer Solution Management.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
GOOD MORNING CLASS! In Operation Research Class, WE MEET AGAIN WITH A TOPIC OF :
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Appendix A with Woodruff Edits Linear Programming Using the Excel Solver Copyright © 2010 by The McGraw-Hill Companies, Inc. All rights reserved.McGraw-Hill/Irwin.
Financial Analysis, Planning and Forecasting Theory and Application
Linear Programming for Solving the DSS Problems
Linear Programming: Sensitivity Analysis and Duality
Solving Absolute Value Equations
Financial Analysis, Planning and Forecasting Theory and Application
Solving Linear Equations and Inequalities
Financial Analysis, Planning and Forecasting Theory and Application
Financial Analysis, Planning and Forecasting Theory and Application
The Simplex Method: Standard Minimization Problems
Solving Linear Equations and Inequalities
Presentation transcript:

Financial Analysis, Planning and Forecasting Theory and Application By Alice C. Lee San Francisco State University John C. Lee J.P. Morgan Chase Cheng F. Lee Rutgers University Chapter 21 Elementary Applications of Programming Techniques in Working-Capital Management

Outline  21.1Introduction  21.2Linear programming  21.3Working-capital model and short-term financial planning  21.4Goal programming  21.5Programming approach to cash transfer and concentration  21.6Summary and conclusion remarks  Appendix 21A. The simplex algorithm for solving eq. (21.8)  Appendix 21B. Mathematical formulation of goal programming

21.1 Introduction

21.2 Linear programming (Objective function), (21.1)

21.3Working-capital model and short-term financial planning  Questions to be answered  Model specification and its solution  Which constraints are causing bottlenecks?  How much more profit is being lost because of constraints?  How do the constraints affect the solution?  Duality and shadow prices  Short-term financial planning

21.3Working-capital model and short-term financial planning TABLE 21.1 ToyMachine Time (hours)Assembly Time (hours) Krazie Kube Plastic Pistol Race Car

21.3Working-capital model and short-term financial planning

(21.2) (21.3) (21.4) (21.5)

21.3Working-capital model and short-term financial planning (21.6) (21.6a) (i = 1, 2, 3) (21.7)

21.3Working-capital model and short-term financial planning (21.8).

21.3Working-capital model and short-term financial planning

(21.9) (i = 1, 2, …, m), (j = 1, 2, …, n).

21.3Working-capital model and short-term financial planning (21.10) (j = 1, 2, …, n), (i = 1, 2, …, m).

21.3Working-capital model and short-term financial planning (i = 1, 2, 3, 4)

21.4Goal programming  Introduction  Application of GP to working-capital management  Summary and remarks on goal programming

21.4Goal programming (21.11a) (21.11b) (21.11c)

21.4Goal programming (21.11d) (21.11e) (21.11f)

21.4 Goal programming

*Profit has a much higher priority than the working capital goal. ** The working capital goals have a much higher priority than the profit goal. *** The priorities for all goals are similar.

21.4 Goal programming

21.5Programming approach to cash transfer and concentration  Transfer mechanisms  Cash-transfer Scheduling: contemporary practice  Weekend timing and dual balances  Limitations of the popular techniques  Mathematical-programming formulation  Relation of model formulation to current practice

21.5Programming approach to cash transfer and concentration

TABLE Managing about the target balance

21.5Programming approach to cash transfer and concentration

(21.12) (21.13) (21.14)

21.5Programming approach to cash transfer and concentration (21.15) (21.16) (21.17)

21.5Programming approach to cash transfer and concentration (21.18) (21.19) (21.20)

21.5 Programming approach to ash transfer and concentration

21.5 Programming approach to cash transfer and concentration

21.6Summary and conclusion remarks In this chapter, we have looked at a variety of financial-management problems and their solution through mathematical-programming techniques. As we have seen, linear-programming and goal- programming are very useful. We have also considered certain working-capital problems, including cash concentration and scheduling. In the next chapter we will again be using our linear- programming skills in long-range financial planning. We will use our knowledge gained from this chapter, in combination with other information, as inputs to our financial-planning models.

Appendix 21A. The simplex algorithm for solving eq. (21.8)

(21.A.2a) (21.A.2b) (21.A.2c) (21.A.2d)

Appendix 21A. The simplex algorithm for solving eq. (21.8)

Appendix 21B. Mathematical formulation of goal programming Following is a list of definitions of all variables used in the GP formulation of the working-capital problem:

Appendix 21B. Mathematical formulation of goal programming 2 This appendix is reprinted from Sartoris, W. L., and M. L. Spruill, “Goal programming and working capital management,” Financial Management (1974): 67-74, by permission of the authors and Financial Management.

Appendix 21B. Mathematical formulation of goal programming These weights are defined in Table 21.6 for ach of the three sets of priorities. Using these definitions, the GP problem is formulated as follows: Subject to:

Appendix 21B. Mathematical formulation of goal programming

The following list defines the constraint given by each row in the constraint matrix: Row 1: Profit plus downside deviation = $ ; Row 2: Time used in production at most 1000 hours; Row3: At most 60 units of Y drawn from inventory; Row 4: At most 30 units of Z drawn from inventory; Row 5: At most 150 units of Y sold for cash; Row 6: At most 100 units of Y sold on credit; Row 7: At most 175 units of Z sold for cash; Row 8: at most 250 units of Z sold on credit; Row 9: Total cash goals 9;*

Appendix 21B. Mathematical formulation of goal programming Row 10: Inventory loan constraint;* 3 Row 11: Current ratio goal;* † Row 12: Quick ratio goal; † Row 13: Constraint requiring cash to be nonnegative; Row 14: Sales of Y for cash plus sales of Y for credit must be greater than or equal to Y drawn from inventory; Row 15: Sales of Z for cash plus sales of Z for credit must be greater than or equal to Z dawn from inventory. *The numbers on the right-hand side include not only the goal but also constants carried to right-hand side of the equality from left-hand side. † Both ratio goals have been linearized by multiplying right-hand side by denominator of ratio.

Appendix 21B. Mathematical formulation of goal programming Cash: X 8 = 5X 1 -36X X 3 -47X (60- X 5 ) -4.5(30- X 6 )+0.95X 7 = 75; (21.B.1) Current ratio: (21.B. 2) Quick ratio: (21.B. 3)