An algorithm for portfolio optimization problem

8Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

Portfolio optimization is to find the stock portfolio minimizing the risk for a required return or maximizing the return for a given risk level. The seminal work in this field is the mean-variance model formulated as a quadratic programming problem. Since it is not computationally practical to solve the original model directly, a number of alternative models have been proposed. In this paper, among the alternative models, we focus on the Mean Absolute Deviation (MAD) model. More specifically, we derive bounds on optimal objective function value. Using the bounds, we also develop an algorithm for the model. We prove mathematically that the algorithm can solve the problem to optimality. The algorithm is tested using the real data from the Korean Stock Market. The results come up to our expectations that the method can solve a variety of problems in a reasonable computational time. © 2005 Institute of Mathematics and Informatics, Vilnius.

Author supplied keywords

Cite

CITATION STYLE

APA

Kim, J. S., Kim, Y. C., & Shin, K. Y. (2005). An algorithm for portfolio optimization problem. Informatica, 16(1), 93–106. https://doi.org/10.15388/informatica.2005.086

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free