/

Constrained quadratic optimisation

[this page | pdf | references | back links | custom searches]

Abstract

 

These pages set out the mathematics behind constrained quadratic optimisation, as implemented using a variant of the Simplex algorithm, and this sort of optimisation relates to traditional Markowitz (i.e. mean-variance) portfolio optimisation.

 

Contents

 

1.       The canonical problem

2.       Solving the canonical problem

3.       Setting up the ‘super’-problem

4.       Updating the tableau

5.       Finishing the algorithm

6.       Portfolio optimisation

 

Tools

References

 


NAVIGATION LINKS
Contents | Next


Desktop view | Switch to Mobile