Abstract
We consider in this article a factor model in portfolio selection with roundlot constraints. Mathematically, this model leads to a quadratic integer programming problem. We exploit the separable structure of the model in order to derive Lagrangian bounds. A branch-and-bound algorithm based on Lagrangian relaxation and continuous relaxation is then developed for solving this model. Computational results are reported for test problems with up to 150 securities.
| Original language | English |
|---|---|
| Pages (from-to) | 305-318 |
| Journal | Optimization |
| Volume | 58 |
| Issue number | 3 |
| Online published | 18 Mar 2009 |
| DOIs | |
| Publication status | Published - Apr 2009 |
| Externally published | Yes |
Research Keywords
- Branch-and-bound method
- Continuous relaxation
- Factor model
- Lagrangian relaxation
- Portfolio optimization
- Roundlot constraints