Rebalance schedule optimization of a large scale portfolio under transaction cost

Rei Yamamoto, Hiroshi Konno

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)26-37
Number of pages12
JournalJournal of the Operations Research Society of Japan
Volume56
Issue number1
DOIs
Publication statusPublished - 2013 Jan 1
Externally publishedYes

Fingerprint

Transaction costs
Rebalancing
Schedule
Optimization problem
Deviation
Mixed integer programming
Software
Measure of risk
Heuristics
Integer programming

Keywords

  • 0-1 Integer programming
  • Absolute deviation
  • Finance
  • Gradual rebalance
  • Market impact cost
  • Rebalance schedule
  • Transaction cost

ASJC Scopus subject areas

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

Cite this

Rebalance schedule optimization of a large scale portfolio under transaction cost. / Yamamoto, Rei; Konno, Hiroshi.

In: Journal of the Operations Research Society of Japan, Vol. 56, No. 1, 01.01.2013, p. 26-37.

Research output: Contribution to journalArticle

@article{12cc906582f4469d90305c40b3c0e0cb,
title = "Rebalance schedule optimization of a large scale portfolio under transaction cost",
abstract = "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.",
keywords = "0-1 Integer programming, Absolute deviation, Finance, Gradual rebalance, Market impact cost, Rebalance schedule, Transaction cost",
author = "Rei Yamamoto and Hiroshi Konno",
year = "2013",
month = "1",
day = "1",
doi = "10.15807/jorsj.56.26",
language = "English",
volume = "56",
pages = "26--37",
journal = "Journal of the Operations Research Society of Japan",
issn = "0453-4514",
publisher = "Operations Research Society of Japan",
number = "1",

}

TY - JOUR

T1 - Rebalance schedule optimization of a large scale portfolio under transaction cost

AU - Yamamoto, Rei

AU - Konno, Hiroshi

PY - 2013/1/1

Y1 - 2013/1/1

N2 - 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.

AB - 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.

KW - 0-1 Integer programming

KW - Absolute deviation

KW - Finance

KW - Gradual rebalance

KW - Market impact cost

KW - Rebalance schedule

KW - Transaction cost

UR - http://www.scopus.com/inward/record.url?scp=84982103097&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84982103097&partnerID=8YFLogxK

U2 - 10.15807/jorsj.56.26

DO - 10.15807/jorsj.56.26

M3 - Article

AN - SCOPUS:84982103097

VL - 56

SP - 26

EP - 37

JO - Journal of the Operations Research Society of Japan

JF - Journal of the Operations Research Society of Japan

SN - 0453-4514

IS - 1

ER -