﻿<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
	<front>
		<journal-meta>
			<journal-id journal-id-type="publisher-id">INFORMATICA</journal-id>
			<journal-title-group>
				<journal-title>Informatica</journal-title>
			</journal-title-group>
			<issn pub-type="epub">1822-8844</issn>
			<issn pub-type="ppub">0868-4952</issn>
			<issn-l>0868-4952</issn-l>
			<publisher>
				<publisher-name>Vilnius University Institute of Mathematics and Informatics</publisher-name>
				<publisher-loc>Akademijos 4, LT-08663 Vilnius, Lithuania</publisher-loc>
			</publisher>
		</journal-meta>
		<article-meta>
			<article-id pub-id-type="publisher-id">INFO573</article-id>
			<article-id pub-id-type="doi">10.15388/Informatica.2005.086</article-id>
			<article-categories>
				<subj-group subj-group-type="heading">
					<subject>Research Article</subject>
				</subj-group>
			</article-categories>
			<title-group>
				<article-title>An Algorithm for Portfolio Optimization Problem</article-title>
			</title-group>
			<contrib-group>
				<contrib contrib-type="author">
					<name>
						<surname>Kim</surname>
						<given-names>Jong Soo</given-names>
					</name>
					<email xlink:href="mailto:jskim@mecors.hanyang.ac.kr">jskim@mecors.hanyang.ac.kr</email>
					<xref ref-type="aff" rid="j_info573_aff_001">a</xref>
				</contrib>
				<contrib contrib-type="author">
					<name>
						<surname>Kim</surname>
						<given-names>Yong Chan</given-names>
					</name>
					<email xlink:href="mailto:yckim@mecors.hanyang.ac.kr">yckim@mecors.hanyang.ac.kr</email>
					<xref ref-type="aff" rid="j_info573_aff_002">b</xref>
				</contrib>
				<contrib contrib-type="author">
					<name>
						<surname>Shin</surname>
						<given-names>Ki Young</given-names>
					</name>
					<email xlink:href="mailto:sky@mecors.hanyang.ac.kr">sky@mecors.hanyang.ac.kr</email>
					<xref ref-type="aff" rid="j_info573_aff_002">b</xref>
				</contrib>
				<aff id="j_info573_aff_001">
					<label>a</label>Department of Information and Industrial Engineering, <institution>Hanyang University</institution>, Ansan Campus, Ansan, <country>Korea</country>
				</aff>
				<aff id="j_info573_aff_002">
					<label>b</label>Department of Industrial Engineering, <institution>Hanyang University</institution>, Haengdang 1-dong, Seongdong-gu, Seoul 133-791, <country>Korea</country>
				</aff>
			</contrib-group>
			<pub-date pub-type="ppub">
				<year>2005</year>
			</pub-date>
			<volume>16</volume>
			<issue>1</issue>
			<fpage>93</fpage>
			<lpage>106</lpage>
			<history>
				<date date-type="received">
					<day>1</day>
					<month>11</month>
					<year>2003</year>
				</date>
			</history>
			<permissions>
				<copyright-statement>© 2005 Institute of Mathematics and Informatics, Vilnius</copyright-statement>
				<copyright-year>2005</copyright-year>
				<license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0/">
					<license-p>Open access article under the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/">CC BY</ext-link> license.</license-p>
				</license>
			</permissions>
			<abstract>
				<p>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 m ean-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.</p>
				<p>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.</p>
			</abstract>
			<kwd-group>
				<label>Key words</label>
				<kwd>portfolio</kwd>
				<kwd>MAD</kwd>
				<kwd>integer programming</kwd>
			</kwd-group>
			<funding-group>
				<award-group>
					<funding-source xlink:href="https://doi.org/10.13039/501100002380">Hanyang University</funding-source>
					<award-id>HY-2004-1</award-id>
				</award-group>
				<funding-statement>This work was supported by the research fund of Hanyang University (HY-2004-1).</funding-statement>
			</funding-group>
		</article-meta>
	</front>
	<body/>
</article>