WebSpider
member
offline  |
| |
| posts: |
147 |
| joined: |
06/29/2006 |
| from: |
Seattle, WA |
|
|
 |
|
|
| Portfolio Management |
The ultimate goal of any trading algorithm is to hold the “best” possible portfolio at each point in time. Algorithms vary in their definition of “best”, the most popular one is to maximizes returns while maintaining a specific structure defined by a set of rules or constraints. This is usually referred to as a portfolio optimization problem.
Mathematically, the portfolio optimization problem can be expressed as:
Given an objective function, F(w), and a list of inequality constraints, Ci ≤ hi, find a vector {w} of portfolio weights that maximizes F while satisfying each of the constraints.
By solving this portfolio optimization problem, Harry Markowitz won the 1990 Nobel Prize in Economic Sciences.
|
|
|
|
|
|
Email To Friend | 
Set Alert To This Topic
New Topic | 
Post Reply 
posted on: 05/03/2019 12:39:58 AM
Edit
Quote
Report
Profile
Reply