Rebalance schedule optimization of a large scale portfolio under transaction cost

Rei Yamamoto, Hiroshi Konno

研究成果: Article査読

2 被引用数 (Scopus)

抄録

This paper is concerned with an optimization problem associated with a rebalancing schedule of a large scale fund subject to nonconvex transaction cost. We will formulate this problem as a 0-1 mixed integer programming problem under linear constraints using absolute deviation as the measure of risk. This problem can be solved by an integer programming software if the size of the universe is small. However, it is still beyond the reach of the state-of-the-art technology to solve a large scale rebalancing problem. We will show that we can now solve these problems almost exactly within a practical amount of time by using an elaborate heuristic approach.

本文言語English
ページ(範囲)26-37
ページ数12
ジャーナルJournal of the Operations Research Society of Japan
56
1
DOI
出版ステータスPublished - 2013
外部発表はい

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research

フィンガープリント 「Rebalance schedule optimization of a large scale portfolio under transaction cost」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル