<mods:mods version="3.3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mods:titleInfo><mods:title>A recursive procedure for selecting optimal portfolio according to the MAD model</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">W.</mods:namePart><mods:namePart type="family">Michalowski</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">W.</mods:namePart><mods:namePart type="family">Ogryczak</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>The mathematical model of portfolio optimization is usually represented as a bicriteria optimization problem where a reasonable trade-off between expected rate of return and risk is sought. In a classical Markowitz model the risk is measured by a variance, thus resulting in a quadratic programming model. As an alternative, the MAD model was proposed where risk is measured by (mean) absolute deviation instead of a variance. The MAD model is computationally attractive, since it is transformed into an easy to solve linear programming program. In this paper we present a recursive procedure which allows to identify optimal portfolio of the MAD model depending on investor's downside risk aversion.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1999</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>Systems Reseach Institute of the Polish Academy of Sciences</mods:publisher></mods:originInfo><mods:genre>Article</mods:genre></mods:mods>