Integer programming approaches in mean-risk models
Hiroshi Konno and
Computational Management Science, 2005, vol. 4, issue 4, 339-351
This paper is concerned with porfolio optimization problems with integer constraints. Such problems include, among others mean-risk problems with nonconvex transaction cost, minimal transaction unit constraints and cardinality constraints on the number of assets in a portfolio. These problems, though practically very important have been considered intractable because we have to solve nonlinear integer programming problems for which there exists no efficient algorithms. We will show that these problems can now be solved by the state- of-the-art integer programming methodologies if we use absolute deviation as the measure of risk. Copyright Springer-Verlag Berlin/Heidelberg 2005
Keywords: Portfolio optimization; mean-absolute deviation model; integer constraints; integer programming (search for similar items in EconPapers)
References: Add references at CitEc
Citations: View citations in EconPapers (8) Track citations by RSS feed
Downloads: (external link)
Access to full text is restricted to subscribers.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:comgts:v:4:y:2005:i:4:p:339-351
Ordering information: This journal article can be ordered from
http://www.springer. ... ch/journal/10287/PS2
Access Statistics for this article
Computational Management Science is currently edited by Ruediger Schultz
More articles in Computational Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla ().