An exact algorithm for factor model in portfolio selection with roundlot constraints

X.L. Sun*, S.F. Niu, D. Li

*Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)305-318
JournalOptimization
Volume58
Issue number3
Online published18 Mar 2009
DOIs
Publication statusPublished - Apr 2009
Externally publishedYes

Research Keywords

  • Branch-and-bound method
  • Continuous relaxation
  • Factor model
  • Lagrangian relaxation
  • Portfolio optimization
  • Roundlot constraints

Fingerprint

Dive into the research topics of 'An exact algorithm for factor model in portfolio selection with roundlot constraints'. Together they form a unique fingerprint.

Cite this