A reactive greedy randomized adaptive search procedure for a mixed integer portfolio optimization problem
Purpose - The purpose of this paper is to present a procedure for finding the efficient frontier, i.e. a non-decreasing curve representing the set of Pareto-optimal or non-dominated portfolios, when the standard Markowitz' classical mean-variance model is enriched with additional constraints. Design/methodology/approach - The mean-variance portfolio optimization model is extended to include integer constraints that limit a portfolio to have a specified number of assets, and to impose limits on the proportion of the portfolio held in a given asset. Optimization-based procedures run into difficulties in this framework and this motivates the investigation of heuristic algorithms to find acceptable solutions. Findings - The problem is solved by a greedy randomized adaptive search procedure (GRASP), enhanced by a learning mechanism and a bias function for determining the next element to be introduced in the solution. Originality/value - This is believed to be the first time, a GRASP for finding the efficient frontier for this class of portfolio selection problems is used.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 36 (2010)
Issue (Month): 12 (October)
|Contact details of provider:|| Web page: http://www.emeraldinsight.com|
|Order Information:|| Postal: Emerald Group Publishing, Howard House, Wagon Lane, Bingley, BD16 1WA, UK|
Web: http://emeraldgrouppublishing.com/products/journals/journals.htm?id=mf Email:
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Mansini, Renata & Speranza, Maria Grazia, 1999. "Heuristic algorithms for the portfolio selection problem with minimum transaction lots," European Journal of Operational Research, Elsevier, vol. 114(2), pages 219-233, April.
- Crama, Y. & Schyns, M., 2003. "Simulated annealing for complex portfolio selection problems," European Journal of Operational Research, Elsevier, vol. 150(3), pages 546-571, November.
- Harry Markowitz, 1952. "Portfolio Selection," Journal of Finance, American Finance Association, vol. 7(1), pages 77-91, 03.
- N. J. Jobst & M. D. Horniman & C. A. Lucas & G. Mitra, 2001. "Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints," Quantitative Finance, Taylor & Francis Journals, vol. 1(5), pages 489-501.
When requesting a correction, please mention this item's handle: RePEc:eme:mfipps:v:36:y:2010:i:12:p:1057-1065. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Virginia Chapman)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.