The platform will undergo maintenance on Sep 14 at about 9:30 AM EST and will be unavailable for approximately 1 hour.
2001
DOI: 10.1007/pl00011397
|View full text |Cite
|
Sign up to set email alerts
|

Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints

Abstract: We will propose a branch and bound algorithm for calculating a globally optimal solution of a portfolio construction/rebalancing problem under concave transaction costs and minimal transaction unit constraints. We will employ the absolute deviation of the rate of return of the portfolio as the measure of risk and solve linear programming subproblems by introducing (piecewise) linear underestimating function for concave transaction cost functions. It will be shown by a series of numerical experiments that the a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
75
0
2

Year Published

2005
2005
2015
2015

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 169 publications
(83 citation statements)
references
References 16 publications
(15 reference statements)
3
75
0
2
Order By: Relevance
“…For example, [20] extends the work of [4] to limited diversification portfolios, and [12] solves portfolio problems with minimum transaction levels, limited diversification and round lot constraints (which requires investing in discrete units) in a branch-and-bound context. In [15], the authors solve a portfolio optimization problem that maximizes net returns where the transaction costs are modeled by a concave function. They successively estimate the concave function by a piecewise linear function and solve the resulting LP.…”
Section: Portfolio Selectionmentioning
confidence: 99%
“…For example, [20] extends the work of [4] to limited diversification portfolios, and [12] solves portfolio problems with minimum transaction levels, limited diversification and round lot constraints (which requires investing in discrete units) in a branch-and-bound context. In [15], the authors solve a portfolio optimization problem that maximizes net returns where the transaction costs are modeled by a concave function. They successively estimate the concave function by a piecewise linear function and solve the resulting LP.…”
Section: Portfolio Selectionmentioning
confidence: 99%
“…Note that (48) solves for v A given η i , J and J ′ . On the other hand, (42), (43) and (44) determine η i , J and J ′ in terms of v A . The entire system can then be solved iteratively.…”
Section: Optimization With Factor Modelmentioning
confidence: 99%
“…As (Horst and Tuy, 1996;Horst and Thoai, 1999) Konno and Wijayanayake (2001), an iterative procedure can be used to compute an ε -optimal solution to that particular DC problem. The procedure is based on the construction of a convex relaxation of the original problem (by replacing each univariate concave cost function by an underestimating envelope function which is linear and univariate).…”
Section: Appendix a -Mathematical Proofsmentioning
confidence: 99%