Optimization of a long-short portfolio under nonconvex transaction cost

Hiroshi Konno, Keisuke Akishino, Rei Yamamoto

Research output: Contribution to journalArticlepeer-review

25 Citations (Scopus)


The purpose of this paper is to propose a practical branch and bound algorithm for solving a class of long-short portfolio optimization problem with concave and d.c. transaction cost and complementarity conditions on the variables. We will show that this algorithm can solve a problem of practical size and that the long-short strategy leads to a portfolio with significantly better risk-return structure compared with standard purchase only portfolio both in terms of ex-ante and ex-post performance.

Original languageEnglish
Pages (from-to)115-132
Number of pages18
JournalComputational Optimization and Applications
Issue number1-2
Publication statusPublished - 2005 Oct
Externally publishedYes


  • Branch and bound algorithm
  • Concave cost
  • Global optimization
  • Long-short portfolio
  • Portfolio theory
  • d.c. cost

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Optimization of a long-short portfolio under nonconvex transaction cost'. Together they form a unique fingerprint.

Cite this