Roman Keeney AGEC 352 12-03-2012.  In many situations, economic equations are not linear  We are usually relying on the fact that a linear equation.

Slides:



Advertisements
Similar presentations
Linear Programming Problem
Advertisements

Chapter 19 – Linear Programming
Linear Programming Problem
Chapter 11 Optimal Portfolio Choice
MS&E 211 Quadratic Programming Ashish Goel. A simple quadratic program Minimize (x 1 ) 2 Subject to: -x 1 + x 2 ≥ 3 -x 1 – x 2 ≥ -2.
Operations Management Linear Programming Module B - Part 2
Lecture Presentation Software to accompany Investment Analysis and Portfolio Management Seventh Edition by Frank K. Reilly & Keith C. Brown Chapter.
Non Linear Programming 1
Linear Programming Introduction. linear function linear constraintsA Linear Programming model seeks to maximize or minimize a linear function, subject.
AN INTRODUCTION TO PORTFOLIO MANAGEMENT
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.
Chapter 6 An Introduction to Portfolio Management.
More on Asset Allocation
FIN352 Vicentiu Covrig 1 Risk and Return (chapter 4)
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Linear Programming ISQA 459/559. Getting Started with LP Game problem Terms Algebraic & Graphical Illustration LP with Excel.
Lecture 9 – Nonlinear Programming Models
Linear-Programming Applications
AN INTRODUCTION TO PORTFOLIO MANAGEMENT
FORMULATION AND GRAPHIC METHOD
Expected Utility, Mean-Variance and Risk Aversion Lecture VII.
Chapter 3 Introduction to Optimization Modeling
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.
Chapter 19 Linear Programming McGraw-Hill/Irwin
© 2012 Cengage Learning. All Rights Reserved. May not scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part. Chapter.
Linear Programming Chapter 13 Supplement.
Version 1.2 Copyright © 2000 by Harcourt, Inc. All rights reserved. Requests for permission to make copies of any part of the work should be mailed to:
Portfolio Management-Learning Objective
Lecture Presentation Software to accompany Investment Analysis and Portfolio Management Seventh Edition by Frank K. Reilly & Keith C. Brown Chapter 7.
Finding the Efficient Set
Some Background Assumptions Markowitz Portfolio Theory
Investment Analysis and Portfolio Management Chapter 7.
1 1 Slide Linear Programming (LP) Problem n A mathematical programming problem is one that seeks to maximize an objective function subject to constraints.
Business Analytics with Nonlinear Programming
Chapter 3 Delineating Efficient Portfolios Jordan Eimer Danielle Ko Raegen Richard Jon Greenwald.
1 Chapter 4 Planning Models Operations Analysis Using MS Excel.
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.
EXPLORATION AND PRODUCTION (E&P) How to Choose and Manage Exploration and Production Projects Supat Kietnithiamorn Kumpol Trivisvavet May 9, 2001 Term.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Investment Analysis and Portfolio Management First Canadian Edition By Reilly, Brown, Hedges, Chang 6.
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.
Nonlinear Programming Models
Risk Analysis & Modelling
1 Multi-Objective Portfolio Optimization Jeremy Eckhause AMSC 698S Professor S. Gabriel 6 December 2004.
INTRODUCTION For a given set of securities, any number of portfolios can be constructed. A rational investor attempts to find the most efficient of these.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
Chapter 7 Nonlinear Optimization Models. Introduction The objective and/or the constraints are nonlinear functions of the decision variables. Select GRG.
How to Build an Investment Portfolio The Determinants of Portfolio Choice The determinants of portfolio choice, sometimes referred to as determinants of.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Chapter 7 An Introduction to Portfolio Management.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
Introduction to Integer Programming Integer programming models Thursday, April 4 Handouts: Lecture Notes.
Money and Banking Lecture 11. Review of the Previous Lecture Application of Present Value Concept Internal Rate of Return Bond Pricing Real Vs Nominal.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Supplementary Chapter B Optimization Models with Uncertainty
Chapter 5 Understanding Risk
An Introduction to Linear Programming
An Introduction to Linear Programming Pertemuan 4
Tools for Decision Analysis: Analysis of Risky Decisions
Principles of Investing FIN 330
投資組合 Portfolio Theorem
Chapter Five Understanding Risk.
2. Building efficient portfolios
Linear Programming Introduction.
Linear Programming Problem
Linear Programming Introduction.
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Presentation transcript:

Roman Keeney AGEC

 In many situations, economic equations are not linear  We are usually relying on the fact that a linear equation is a good approximation  Even when we assume linearity, sometimes the economics of interest are non-linear  Example: Revenue = Price x Quantity ▪ Quantity = f(Price) ▪ Revenue = Price x f(Price) ▪ dRev/dPrice = Price x df/dPrice + f(Price) ▪ Since this is not a constant, the revenue function when demand depends on price is not constant ▪ Recall our earlier Simon Pies model with the quantity demanded function

 Non-proportional relationships  Price increases may increase revenue to a point and then decrease it ▪ Depends on demand elasticity at any particular price  Non-additive relationships  E.g. Honey and fruit production  Efficiency of scale  Yield per worker may increase to some point and then decline  Non-linearity of problems results from physical, structural, biological, economic, or logical relationships  Linear models provide good approximations and are MUCH easier to solve

 The degree of non-linearity determines how likely we are to find a solution and have it be the true best choice  Non-linear problems can have local optima  These represent solutions to the problem, but only over a restricted space  Global optima are true best choices, the highest value over the entire feasible set  In LP, any local optima was guaranteed to be a global optima Local Global

 Quadratic programming turns out to be a non-linear problem that is closely related to LP  Quadratic objective equation and linear equality and inequality constraints and non-negativity of variables  The only difference is the functional form (squared terms) of the objective equation  Quadratic function examples  9X^2 + 4X + 7  3X^2 – 4XY + 15Y^2 + 20X - 13Y - 14

 Min Z = (x – 6)^2 + (y – 8)^2  s.t.  X <= 7  Y <= 5  X + 2Y <=12  X + Y <= 9  X, Y >= 0  Linear constraints, so we could draw them as we always have  Objective equation is quadratic, in fact it is a circle  The 6 and 8 give the coordinates of the center of the circle  Z represents the squared radius of the circle  So, this problem seeks to minimize the squared radius of the circle centered at (6,8) subject to x and y being found in the feasibility set

Feasible Space Objective Equation

 Setup is no different  Need a non-linear formula for the objective  Solver is equipped to solve non-linear problems, just don’t click “assume linear” in the options  Sensitivity  Reduced gradient and Lagrange multiplier replace objective penalties and shadow prices but they are exactly the same  These come from the calculus solution to the problem (Method of Lagrange)  No ranges (allowable increases/decreases)

 Non-linear functions significantly more complex  Solutions need not occur at corner points of the feasible space  Why is it so useful?  Several models, particularly models involving optimization under risk.  Portfolio model ▪ Minimize the variance of expected returns subject to meeting some minimum expected return

 An individual has 1000 dollars to invest  The 1000 dollars can be allocated a number of ways  Equal split between investments  All in a single investment  Any combination in between  The individual wants to earn high returns  The individual wants low risk

 Real world investments  Those with high expected returns are those with high risks of losing money ▪ Win big or lose big  Those with low expected returns are those with low risks of losing money ▪ Win small or lose small  Potential losses (downside risk) tend to be larger than upside ▪ Bad outcomes are really bad, Good outcomes are just pretty good

 Returns are defined by the proportionate gains above the initial investment  Final Amt = (1 + R)* Initial Amt  Risks are defined by the variability (variance) or returns  Given i possible outcomes  Variance is the sum over all i outcomes of ▪ (xi – xmean)^2  Higher variance means that a given investment produces greater deviations from its average (expected return)

 Investors want high returns  Investors want low risk  There are some combined objective equations that look at risk reward tradeoffs but they require knowledge of a decision maker’s risk aversion level  Risk aversion ▪ The concept that people do not like uncertainty about their expected returns/rewards, and in fact will take lower expected returns to avoid some amount of risk/uncertainty when they are making plans or decisions  Absent any knowledge of risk aversion levels we can minimize risk while ensuring a minimum return or maximize return while placing a ceiling on risk

 Two choices  1) Minimize risk (variance) of the investment strategy  Subject to meeting some minimally acceptable average return for the portfolio  2) Maximize returns  Subject to not exceeding some maximally acceptable average variance for the portfolio  In practice the second one has become more common  To be a quadratic program, we need to solve option 1 (want the quadratic equation in the objective)

 Definitions  R1 = returns from investment 1 ▪ Sigma1 = variance of investment 1  R2 = returns from investment 2 ▪ Sigma2 = variance of investment 2 ▪ Sigma12 = covariance of investments ▪ How much do they vary together?  B = Minimum acceptable return of portfolio  S1 = Maximum share of dollars invested in 1  S2 = Maximum share of dollars invested in 2

 Decision variables X1 and X2 are shares of the total investment  Min Var = X1*X1*sigma1 + X1*X2*sigma12 + X2*X2*sigma2  Subject to  X1 + X2 = 1(total investment)  R1*X1 + R2*X2 >= 0.03 (min return)  X1 <= 0.75(max X1 allocation)  X2 <= 0.90(max X2 allocation)  Non-negative X1 and X2

 Investment Shares  Inv 1 = 0.36  Inv 2 = 0.64  Expected Return   Variance   Sensitivity?  How do investment shares and risk change with changes in minimum expected return

 Risk problems are complex  Investment 1 drives returns up but increases risk  It drives mean returns faster than risk over some range (per last graph) but what is acceptable? ▪ Risk relative to mean is still high for all of these  Only two investments ▪ Adding more choices adds complexity but also adds more ability to mitigate risk ▪ Riskless Assets are often maintained in a portfolio for this reason