1 Mixed Integer Programming Approaches for Index Tracking and Enhanced Indexation Nilgun Canakgoz, John Beasley Department of Mathematical Sciences, Brunel.

Slides:



Advertisements
Similar presentations
Quantitative Techniques An Introduction
Advertisements

IENG313 Operation Research I
Chapter 8: The Solver and Mathematical Programming Spreadsheet-Based Decision Support Systems Prof. Name Position (123) University.
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Dragan Jovicic Harvinder Singh
Linear Programming Problem Formulation.
Operations Management Linear Programming Module B - Part 2
Inventory Control IME 451, Lecture 3.
1 Dynamic portfolio optimization with stochastic programming TIØ4317, H2009.
P.V. VISWANATH FOR A FIRST COURSE IN INVESTMENTS.
MBA & MBA – Banking and Finance (Term-IV) Course : Security Analysis and Portfolio Management Unit I : Introduction to Security analysis Lesson No. 1.2-
Quantitative Techniques for Decision Making M.P. Gupta & R.B. Khanna © Prentice Hall India LINEAR PROGRAMMING GRAPHIC METHOD 2 CHAPTER.
Options and Speculative Markets Hedging with Futures Professor André Farber Solvay Business School Université Libre de Bruxelles.
Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-1 Introduction to Nonlinear Programming (NLP)
Basic LP Problem McCarl and Spreen Chapter 2 LP problem is linear form of Mathematical Program This formulation may also be expressed in matrix notation.
B-1 Operations Management Linear Programming Module B.
Nonlinear Filtering of Stochastic Volatility Aleksandar Zatezalo, University of Rijeka, Faculty of Philosophy in Rijeka, Rijeka, Croatia
Lecture 3: Arrow-Debreu Economy
Fundamentals of Futures and Options Markets, 6 th Edition, Copyright © John C. Hull Hedging Strategies Using Futures Chapter 3.
Optimization I Operations -- Prof. Juran. Outline Basic Optimization: Linear programming –Graphical method –Spreadsheet Method Extension: Nonlinear programming.
1 OR II GSLM Outline  course outline course outline  general OR approach  general forms of NLP  a list of NLP examples.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Chapter 3 Introduction to Optimization Modeling
Classical portfolio theory a critique and new diretions Gautam Mitra Co-authors: Diana Roman Csaba Fabian Victor Zviarovich LQG Investment Technology Day.
Section 1.2 Linear Functions and Applications. o Domain of a function o Function notation review Function.
Index Tracking Yihan Li & Yang Liu. What is Index Tracking Index Tracking is a passive portfolio management method[1] It generates a certain portfolio.
Mathematical Programming Models for Asset and Liability Management Katharina Schwaiger, Cormac Lucas and Gautam Mitra, CARISMA, Brunel University West.
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc Chapter 3 Introduction to Optimization Modeling.
ENCI 303 Lecture PS-19 Optimization 2
Linear Programming: Basic Concepts
Mathematics. Session Differential Equations - 1 Session Objectives  Differential Equation  Order and Degree  Solution of a Differential Equation,
D Nagesh Kumar, IIScOptimization Methods: M1L3 1 Introduction and Basic Concepts (iii) Classification of Optimization Problems.
Mathematical Programming for Optimisation Mike Morgan and Vic Grout Centre for Applied Internet Research (CAIR) University of Wales NEWI Plas Coch Campus,
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.
7/2/2013Copyright R. Douglas Martin1 5. TRANSACTION COSTS AND MIP 5.1 Transaction costs constraints in MVO 5.2 Transaction costs penalty in quadratic utility.
1 Appendix 10 A: A Linear-Programming Approach to Portfolio- Analysis Models (Related to ) By Cheng Few Lee Joseph Finnerty John Lee Alice C Lee.
Adviser: Frank, Yeong-Sung Lin Presenter: Yi-Cin Lin.
Fundamentals of Futures and Options Markets, 7th Ed, Ch3, Copyright © John C. Hull 2010 Hedging Strategies Using Futures Chapter 3 1.
Optimization I. © The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran2 Outline Basic Optimization: Linear programming –Graphical.
Contingency-Constrained PMU Placement in Power Networks
Risk Analysis & Modelling
1 Chapter 20 Benching the Equity Players Portfolio Construction, Management, & Protection, 4e, Robert A. Strong Copyright ©2006 by South-Western, a division.
Chapter 1 Introduction n Introduction: Problem Solving and Decision Making n Quantitative Analysis and Decision Making n Quantitative Analysis n Model.
1 Multi-Objective Portfolio Optimization Jeremy Eckhause AMSC 698S Professor S. Gabriel 6 December 2004.
Mathematics.
Author: Tadeusz Sawik Decision Support Systems Volume 55, Issue 1, April 2013, Pages 156–164 Adviser: Frank, Yeong-Sung Lin Presenter: Yi-Cin Lin.
Primbs1 Receding Horizon Control for Constrained Portfolio Optimization James A. Primbs Management Science and Engineering Stanford University (with Chang.
Chapter 7 Nonlinear Optimization Models. Introduction The objective and/or the constraints are nonlinear functions of the decision variables. Select GRG.
CPS Computational problems, algorithms, runtime, hardness (a ridiculously brief introduction to theoretical computer science) Vincent Conitzer.
Options, Futures, and Other Derivatives 6 th Edition, Copyright © John C. Hull Long & Short Hedges A long futures hedge is appropriate when you.
LINEAR PROGRAMMING.
Inequalities for Stochastic Linear Programming Problems By Albert Madansky Presented by Kevin Byrnes.
MCCARL AND SPREEN TEXT CH. 2 T Y/MCCARL-BRUCE/BOOKS.HTM Lecture 2: Basic LP Formulation.
Fundamentals of Futures and Options Markets, 6 th Edition, Copyright © John C. Hull Hedging Strategies Using Futures Chapter 3.
EMGT 5412 Operations Management Science Nonlinear Programming: Introduction Dincer Konur Engineering Management and Systems Engineering 1.
GOOD MORNING CLASS! In Operation Research Class, WE MEET AGAIN WITH A TOPIC OF :
Tools for Decision Analysis: Analysis of Risky Decisions
McCarl and Spreen Chapter 2
Lecture 6 General Overview of Non-Linear Programming
Derivatives Hedging with Futures
Quantitative Techniques
A Mathematical Programming Language
Contingency-Constrained PMU Placement in Power Networks
Optimization I.
Linear Programming Introduction.
Linear Programming Introduction.
Dr. Arslan Ornek DETERMINISTIC OPTIMIZATION MODELS
Presentation transcript:

1 Mixed Integer Programming Approaches for Index Tracking and Enhanced Indexation Nilgun Canakgoz, John Beasley Department of Mathematical Sciences, Brunel University CARISMA: Centre for the Analysis of Risk and Optimisation Modelling Applications

2 Outline Introduction Problem formulation Index Tracking Enhanced Indexation Computational results Conclusion

3 Introduction Passive fund management Index tracking Full replication Fewer stocks Tracking portfolio (TP)

4 Problem Formulation Notation N : number of stocks K : number of stocks in the TP ε i : min proportion of TP held in stock i δ i : max proportion of TP held in stock i X i : number of units of stock i in the current TP V it : value of one unit of stock i at time t I t : value of index at time t R t : single period cont. return given by index

5 Problem Formulation C : total value of TP :be the fractional cost of selling one unit of stock i at time T :be the fractional cost of buying one unit of stock i at time T  : limit on the proportion of C consumed by TC x i : number of units of stock i in the new TP G i : TC incurred in selling/buying stock i z i = 1 if any stock i is held in the new TP = 0 otherwise r t : single period cont. return by the new TP

6 Problem Formulation Constraints (1) (2) (3) (4)

7 Problem Formulation (5) (6) (7) (8)

8 Problem Formulation Index Tracking Objective Single period continuous time return for the TP (in period t) is a nonlinear function of the decision variables To linearise, we shall assume Linear weighted sum of individual returns Weights summing to 1

9 Problem Formulation Hence the return on the TP at time t Approximate W it by a constant term which is independent of time Hence the return on the TP at time t

10 Problem Formulation Our expression for w i is nonlinear, to linearise it we first use equation (6) and then equation (5) to get (9) Finally we have a linear expression (approximation) for the return of the TP If we regress these TP returns against the index returns (10), (11)

11 Problem Formulation Ideally, we would like, for index-tracking, to choose K stocks and their quantities (x i ) such that we achieve We adopt the single weighted objective, user defined weights

12 Problem Formulation The modulus objective is nonlinear and can be linearised in a standard way (13) (14) (15) (16) (17)

13 Problem Formulation Our full MIP formulation for solving index- tracking problem is subject to (1)-(11) and (13)-(17) This formulation has 3N+4 continuous variables, N zero-one variables and 4N+9 constraints

14 Problem Formulation Two-stage approach Let and be numeric values for and when we use our formulation above Then the second stage is (19) subject to (1)-(11) and (13)-(17) and (20) (21)

15 Problem Formulation Enhanced indexation One-stage approach to enhanced indexation is: subject to (1)-(11),(13)-(17) and

16 Problem Formulation Two-stage approach is precisely the same as seen before, namely minimise (19) subject to (1)-(11), (13)-(17), (20), (21)

17 Computational Results Data sets Hang Seng, DAX, FTSE, S&P 100, Nikkei, S&P 500, Russell 2000 and Russell 3000 Weekly closing prices between March 1992 and September 1997 (T=291) Model coded in C++ and solved by the solver Cplex 9.0 (Intel Pentium 4, 3.00Ghz, 4GB RAM)

18 Computational Results The initial TP composed of the first K stocks in equal proportions, i.e.

19 Computational Results IndexNumber of stocks NNumber of selected stocks K Hang Seng3110 DAX FTSE S&P Nikkei S&P Russell Russell

20 Index Tracking In-Sample vs. Out-of-Sample Results

21 Systematic Revision To investigate the performance of our approach over time we systematically revise our TP a)Set T=150 b)Use our two-stage approach to decide the new TP [x i ] c)Set [X i ]=[x i ] (replace the current TP by the new TP) d)Set T=T+20 and if T 270 go to (b)

22 Index Tracking Systematic Revision Results

23 Enhanced Indexation In-Sample vs. Out-of-Sample Results

24 Enhanced Indexation Systematic Revision Results

25 Conclusion Good computational results Reasonable computational times in all cases

26 Thank you for listening!