The portfolio optimization problem is modeled as
a mean-risk bicriteria optimization problem where the expected
return is maximized and some (scalar) risk measure is minimized.
In the original Markowitz model the risk is measured by the
variance while several polyhedral risk measures have been introduced
leading to Linear Programming (LP) computable portfolio
optimization models in the case of discrete random variables represented
by their realizations under specified scenarios. Among
them, the second order quantile risk measures, recently, become
popular in finance and banking. The simplest such measure,
now commonly called the Conditional Value at Risk (CVaR) or
Tail VaR, represents the mean shortfall at a specified confidence
level. Recently, the second order quantile risk measures have
been introduced and become popular in finance and banking.
The corresponding portfolio optimization models can be solved
with general purpose LP solvers. However, in the case of more
advanced simulation models employed for scenario generation
one may get several thousands of scenarios. This may lead to
the LP model with huge number of variables and constraints
thus decreasing the computational efficiency of the model since
the number of constraints (matrix rows) is usually proportional
to the number of scenarios. while the number of variables
(matrix columns) is proportional to the total of the number of
scenarios and the number of instruments. We show that the
computational efficiency can be then dramatically improved with
an alternative model taking advantages of the LP duality. In the
introduced models the number of structural constraints (matrix
rows) is proportional to the number of instruments thus not
affecting seriously the simplex method efficiency by the number
of scenarios
The portfolio optimization problem is modeled asa mean-risk bicriteria optimization problem where the expectedreturn is maximized and some (scalar) risk measure is minimized.In the original Markowitz model the risk is measured by thevariance while several polyhedral risk measures have been introducedleading to Linear Programming (LP) computable portfoliooptimization models in the case of discrete random variables representedby their realizations under specified scenarios. Amongthem, the second order quantile risk measures, recently, becomepopular in finance and banking. The simplest such measure,now commonly called the Conditional Value at Risk (CVaR) orTail VaR, represents the mean shortfall at a specified confidencelevel. Recently, the second order quantile risk measures havebeen introduced and become popular in finance and banking.The corresponding portfolio optimization models can be solvedwith general purpose LP solvers. However, in the case of moreadvanced simulation models employed for scenario generationone may get several thousands of scenarios. This may lead tothe LP model with huge number of variables and constraintsthus decreasing the computational efficiency of the model sincethe number of constraints (matrix rows) is usually proportionalto the number of scenarios. while the number of variables(matrix columns) is proportional to the total of the number ofscenarios and the number of instruments. We show that thecomputational efficiency can be then dramatically improved withan alternative model taking advantages of the LP duality. In theintroduced models the number of structural constraints (matrixrows) is proportional to the number of instruments thus notaffecting seriously the simplex method efficiency by the numberof scenarios
การแปล กรุณารอสักครู่..