An algorithm for portfolio optimization problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jong Soo | - |
dc.contributor.author | Kim, Yong Chan | - |
dc.contributor.author | Shin,Ki Young | - |
dc.date.accessioned | 2021-06-23T23:41:42Z | - |
dc.date.available | 2021-06-23T23:41:42Z | - |
dc.date.created | 2021-02-01 | - |
dc.date.issued | 2005 | - |
dc.identifier.issn | 0868-4952 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/46164 | - |
dc.description.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 tine. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | INST MATHEMATICS & INFORMATICS | - |
dc.title | An algorithm for portfolio optimization problem | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Jong Soo | - |
dc.identifier.doi | 10.15388/Informatica.2005.086 | - |
dc.identifier.scopusid | 2-s2.0-21244493291 | - |
dc.identifier.wosid | 000227716100007 | - |
dc.identifier.bibliographicCitation | INFORMATICA, v.16, no.1, pp.93 - 106 | - |
dc.relation.isPartOf | INFORMATICA | - |
dc.citation.title | INFORMATICA | - |
dc.citation.volume | 16 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 93 | - |
dc.citation.endPage | 106 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | MINIMUM TRANSACTION LOTS | - |
dc.subject.keywordPlus | STOCK-MARKET | - |
dc.subject.keywordPlus | MODEL | - |
dc.subject.keywordAuthor | portfolio | - |
dc.subject.keywordAuthor | MAD | - |
dc.subject.keywordAuthor | integer programming | - |
dc.identifier.url | https://informatica.vu.lt/journal/INFORMATICA/article/974/info | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.