ASSET/LIABILITY MANAGEMENT FOR PENSION FUNDS USING CVaR ...
1.
ASSET/LIABILITY MANAGEMENT FOR PENSION FUNDS
USING CVaR CONSTRAINTS
RESEARCH REPORT #2001-10
Erik Bogentoft1 , H. Edwin Romeijn2 , and Stanislav Uryasev3
Risk Management and Financial Engineering Lab
Center for Applied Optimization
Department of Industrial and Systems Engineering
University of Florida, Gainesville, FL 32611-6595
Date: September 21, 2001
Correspondence should be addressed to: Stanislav Uryasev
Abstract
This paper studies formal optimal decision approaches for a multi-period Asset/Liability
Management model for a pension fund. As a risk measure we use Conditional Value-at-Risk
(CVaR), which is the weighted average of the Value-at-Risk (VaR) and the losses exceed-
ing VaR. The model is based on sample-path simulation of the fund liabilities and returns
of ¯nancial instruments included in the portfolio. The same optimal decisions are made for
groups of sample-paths which exhibit similar performance characteristics. Since allocation
proportions depend on time, these techniques are more °exible than more standard allocation
procedures such as constant proportions." Optimization is conducted using linear program-
ming. However, compared to traditional stochastic programming algorithms for which the
problem dimension increases exponentially in the number of time stages, our approach ex-
hibits a linear growth of the dimension. Therefore, this approach allows for the solution of
problems with very large numbers of instruments and scenarios.
1
Erik Bogentoft is a consultant at the Boston Consulting Group AB, Stockholm, Sweden.
2
Edwin Romeijn is an assistant professor at the Department of Industrial and Systems Engineering, University
of Florida; e-mail: romeijn@ise.ufl.edu; URL: www.ise.ufl.edu/romeijn.
3
Stanislav Uryasev is director of the Risk Management and Financial Engineering Lab and associate professor
of the University of Florida, Department of Industrial and Systems Engineering; e-mail: uryasev@ufl.edu; URL:
www.ise.ufl.edu/uryasev.
1
2.
This paper develops a formal framework for Asset/Liability Management (ALM) for a pension
fund. Extensive literature exists for modeling and optimization of portfolio allocation strategies
for Asset Liability Management problems, see, for instance, Ziemba and Mulvey [35]. A formal
study of ALM problems is usually focused on modeling plausible sample-paths for liabilities of
the fund and returns of instruments in the portfolio. These scenarios are then used to test the
performance of various decision rules, usually using the brute-force approach. A typical decision
rule is the so-called constant proportion" rule, where the portfolio is rebalanced at each decision
moment in order to maintain a constant allocation of resources between di®erent asset classes.
For instance, using simulation, the paper [8] compares the choices available to a pension plan
member at the time of retirement.
Traditionally, in multiperiod setting, stochastic di®erention equations are used to solve asset
allocation problems, see for instance [23, 24, 25, 8]. These approaches, leading to analytical
solutions, usually study relatively simple strategies (e.g., "constant proportion") under restrictive
assumptions, such as the dynamics obeying geometric Browning motion.
Much more advanced strategies are developed in the framework of stochastic programming
approaches, see Boender et al. [7], Dert [13, 14], Kouwenberg [22], Cari~o et al. [11] and others as
n
surveyed in Ziemba and Mulvey [35]. The state of the art of such models and their implementation
has expanded greatly in 1990; see [35]. Censor and Zenios [12] and Zenios [33] survey large scale
asset-liability applications to portfolio management.
In the stochastic programming approach, one either transforms the set of sample-paths to a
scenario tree, or one generates a scenario tree directly using appropriately chosen (conditional)
distributions for each of the exogenous random variables in the problem (see Figure 1). The
problem is then formulated as a stochastic programming problem. A stochastic programming
approach can ¯nd a strategy that is superior to a strategy found using the brute force approach,
since the latter allows for a far smaller set of possible decisions at each decision moment. Although
stochastic programming techniques are well-studied and have successfully been used in several
ALM applications, they are not widely used in ¯nancial practice. There are several reasons why
stochastic programming approaches have not received widespread acceptance: (i) sophisticated
statistical techniques need to be applied to transform a set of simulated sample-paths into a
scenario tree; (ii) a scenario tree exhibits exponential growth of the number of nodes as the
number of decision moments increases, which can lead to a very large dimension of the decision
problem; (iii) when the size of the scenario tree is limited due to (ii), the resulting scenario
tree may not contain enough stochasticity" to cover a realistic and diverse range of uncertain
2
3.
behavior of the system.
Figure 1: The decision tree provides °exible decision strategies but leads to huge problems and/or
may not adequately model randomness.
We consider an intermediate setting between the brute-force approach and stochastic pro-
gramming. This setting was ¯rst proposed by Hibiki [17, 18] for portfolio optimization problems.
Here we extend this approach to ALM problems and combine it with a recently developed risk
management technique using Conditional Value-at-Risk (CVaR) constraints (see Rockafellar and
Uryasev [31, 30]). In this approach, optimization is performed using a set of sample-paths, thereby
eliminating, in contrast with the stochastic programming approach, the need to construct a sce-
nario tree. On the other hand, to allow for a decision space that is far larger than the decision
space that is traditionally used when using the decision rule approach with brute-force optimiza-
tion, we allow for di®erent decisions to be made for di®erent bundles of sample-paths, where
sample-paths are bundled together according to some criteria. In particular, the same optimal
decisions are made for bundles (or groups) of sample-paths which exhibit similar performance
characteristics. This bundling of sample-paths is done to avoid anticipativity1 of solutions (as
in the scenario tree approach), and at the same time, dramatically limits the number of deci-
sion variables. In particular, the dimension of the problem linearly increases with the number
of bundles and the number of time periods. This compares very favorably with the stochastic
programming approach which exhibits exponential growth of the problem size as a function of
1
a sample-path completely describes future events; the optimal solution for a particular sample-path should not
anticipate" (utilize information about) future events.
3
4.
the number of scenarios and the number of time periods. The proposed approach can be viewed
as a simpli¯cation of stochastic programming whereby the same decisions are imposed for many
scenarios. This simpli¯cation makes the models easier to solve, and in a way more intuitive.
The idea of using a decision variable independently of scenarios has been in use in ¯nancial
modeling by several authors for a long time. Financial models based on string (linear) scenario
trees instead of event trees have been suggested by Hiller and Eckstein [20] and Zenios [34].
However, compared to these papers, here, we consider decisions on bundles of sample-paths.
We will show that, with such a structure, and suitable risk measures, it is possible to formulate
and solve the problem using linear programming techniques. In particular, we will use the fact that
incorporating CVaR constraints does not destroy the linear structure of a model (see Rockafellar
and Uryasev [31, 30]). This quality is an important advantage of using CVaR as a risk measure
in optimization settings, but there are several other reasons to use CVaR as a risk measure.
CVaR is a sub-additive measure of risk (see Rockafellar and Uryasev [31, 30], P°ug [28]), i.e.
diversi¯cation of a portfolio reduces CVaR. Moreover, CVaR is a coherent measure of risk in the
sense of Artzner et al. [3] (coherency of CVaR was ¯rst proved by P°ug [28]; see also Rockafellar
and Uryasev [31], Acerbi et al. [1], and Acerbi and Tasche [2]).
The numerical experiments presented in this paper are conducted using a set of sample-paths
for liabilities and asset returns for one of the pension funds in The Netherlands. This set of
sample-paths was generated at ORTEC Consultants B.V., using their simulation-based decision
support system for asset/liability management for pension funds. Although this study is based
on a realistic set of scenarios, practical recommendations on investment decisions are beyond
the scope of this paper. The paper is designed as a feasibility study to test new optimization
techniques with CVaR risk constraints in a dynamic setting. We have shown that the technique
is stable and robust, allowing for the solution of large scale problems with a long investment
horizon. It can relatively easily be implemented in a realistic investment environment.
1 The pension fund problem
1.1 Basic setup
We consider a pension fund that conducts the following activities: (i) collects premiums from the
sponsor and/or the active employees; (ii) invests available funds; and (iii) pays pensions to retired
employees. The fund utilizes an asset management strategy (a set of investment rules) such that,
4
5.
at each decision moment, the total value of all assets exceeds the liabilities of the fund2 (which is
actually a measure of the fund's future stream of liabilities) with high certainty, and at the same
time tries to minimize the contribution rate by the sponsor and active employees of the fund.
The problem consists of setting, at each decision moment in time, a suitable contribution rate
and a suitable investment strategy for the funds available to the pension fund (see Figure 2).
Figure 2: The pension fund. The problem consists of determining a minimal contribution rate
(as a fraction of wages of active members) and investment strategy of available capital such that
liabilities are covered with high certainty. The wages, the returns on the instruments in the
portfolio, the payments to non-active members, and the liabilities are all random variables.
We will denote the time horizon by T , and denote the set of decision moments by t = 0; : : : ; T .
At each time t a decision is made on the value of contribution to the fund and on portfolio
allocations, both based on the state of the pension fund at that particular point in time. We
start the formal description by introducing the following notation, which is highly simpli¯ed for
the moment by suppressing randomness. The notation will be re¯ned later.
² At = Value of all assets owned by the fund at time t (random variable).
² Wt = Wages earned by active members at time t (random variable).
² yt = Contribution rate, i.e. premium paid by the sponsor and/or active employee as a
fraction of (a suitable part of) their wages at time t (decision variable3 ).
2
we consider the "de¯ned-bene¯t" pension scheme.
3
A decision variable can be a constant or a stochastic function depending upon the underlying stochastic
5
6.
² `t = Payments made by the fund to retirees at time t (random variable).
² xn;t = Money invested in asset n at time t (decision variable).
² rn;t = Return on investment in asset n at period t (random variable).
² Lt = Liabilities (i.e., a measure of the stream of future liabilities) of the fund at time t
(random variable).
In addition, let h(y1 ; : : : ; yT ) denote a measure of the costs of the pension fund. This could,
for example, be the average of contribution rates, or the present value of all contributions yt Wt .
Furthermore, we assume that h(y1 ; : : : ; yT ) is linear in yt and nondecreasing in yt . At each decision
moment, the following balance equation holds:
N
X
xn;t = At + Wt yt ¡ lt t = 0; : : : ; T ¡ 1 (1)
n=0
PN
which equates the sum of all investments, n=0 xn;t , to assets, At , plus contributions, Wt yt ,
PN
minus liabilities, `t . The sum n=0 xn;t¡1 invested at time t ¡ 1 results in the following value of
all assets at time t:
N
X
At = xn;t¡1 (1 + rn;t ):
n=0
At each time period t = 1; : : : ; T we want to satisfy the liability constraints
N
X
At = xn;t¡1 (1 + rn;t ) ¸ Lt with high certainty. (2)
n=0
In this paper, we consider the problem of minimizing costs of the fund
minimize h(y1 ; : : : ; yT ) (3)
subject to balance (1) and liability (2) constraints.
The ratio of assets to liabilities
At
Lt
is usually referred to as the funding ratio of the pension fund. A target funding ratio of Ã 61
=
can easily be incorporated by replacing constraint (2) by
N
X
At = xn;t¡1 (1 + rn;t ) ¸ ÃLt with high certainty. (4)
n=0
variables. The structure of the decision variables is discussed in more detail in Section 2.
6
9.
For i = 1; : : : ; I, let us denote by ri , Li , a sample of realizations of (r; L) from the probability
distribution function P . As was shown by Rockafellar and Uryasev [30, 31], constraint (8) can
be replaced by the system of linear constraints
XI
1
³+ zi · w (9)
I (1 ¡ ®)
i=1
N
X
(1 + rn )xn ¡ ³ · z i
i
i = 1; : : : ; I (10)
n=0
zi ¸ 0 i = 1; : : : ; I (11)
where z i , i = 1; : : : ; I, are dummy variables. If constraint (9) is active at an optimal solution,
the corresponding optimal value of ³, if it is unique, will be equal to VaR. If there are alternative
optimal values of ³, then VaR is the left endpoint of the optimal interval. The left hand side of
inequality (9) will be equal to CVaR.
1.3 Objective function and optimization problem
In the remainder, we consider the Asset/Liability model de¯ned by the balance constraints (1),
and the risk constraints (9){(11), which are imposed at each point in time t. As will be explained
in more detail in the following sections, the risk constraints will be imposed for groups of sample-
paths. The objective function of the model is de¯ned as the expected present value of the
contributions to the pension fund, i.e., we will minimize the total cost of funding the pension
fund subject to balance and safety constraints. The problem is solved using formal optimization
algorithms.
In the following sections, we will develop a more elaborate version of this model, where we
de¯ne approaches for modeling of uncertainties and the structure of solution rules. A formal
description of the problem formulation is included in the Appendix.
2 Modeling of underlying stochastic variables and decision rules
This section describes in a non-quantitative way our approach for modeling of uncertainties and
decision rules. A formal description of the model is included in the Appendix.
2.1 Basic idea
There are several ways of modeling dynamics and uncertainty. The most popular approach
is to use simulation and to generate many sample-paths (scenarios), which represent possible
9
10.
future states of the system. The ¯nance industry mostly uses the simulation approach, where
decision rules are speci¯ed for choosing the contribution rate and investment strategy. Then, the
parameters of these decision rules are adjusted, using trial-and-error, to provide a satisfactory
solution to the problem. The most typical decision rule is the "¯xed-mix strategy." This rule leads
to nonconvex optimization problems. Therefore, only few papers apply optimization techniques
to this problem, see, e.g., Mulvey at al. [26].
Alternatively, the set of sample-paths can be converted to a scenario tree. Such a conversion
allows one to use the well-developed stochastic optimization theory to make optimal decisions (a
description of the basic stochastic programming technology can be found, for instance, in Birge
and Louveaux [6], Ermoliev and Wets [15], and Prekopa [29]). However, for multistage models,
conversion of the set of sample-paths to a scenario tree can lead to signi¯cant methodological and
computational di±culties. Focusing on the latter, the scenario tree increases very rapidly in size
for multistage problems, easily exceeding the capacities of even the most extreme computational
resources. This forces multistage models to limit the number of scenarios, which in turn severely
limits the possibility of re°ecting the rich randomness of the actual dynamic stochastic processes.
Neither of the above sketched solutions is very satisfying. Therefore, we will employ an alter-
native approach, which was earlier explored by Hibiki [17, 18] for portfolio allocation problems.
This setup directly utilizes simulation sample-paths, but on the other hand leads to linear models
and a rich decision space, in contrast with other sample-path based approaches which lead to
nonconvex multiextremal problems (for example, in the case of the constant proportion" rule).
We will combine this approach with CVaR risk management techniques.
As above, we consider a T -period model with time ranging from t = 0; : : : ; T , and decisions
taken at times t = 0; : : : ; T ¡1. Randomness in the model is expressed by I sample-paths spanning
the entire horizon from t = 0 until t = T . Each path re°ects a sequence of possible outcomes for
all random parameters in the model. The collection of, equally probable, sample-paths gives a
discrete approximation of the probability measure of the random variables (r; W; L; `). Figure 3
illustrates this setup. The description of procedures for constructing sample-paths is beyond the
scope of this paper.
Ideally, one would like to take di®erent decisions for every path at every time t = 1; : : : ; T ¡ 1.
However, this will lead to undesirable anticipativity in the model. This is caused by the fact that,
once we start following a speci¯c path, we have full knowledge of the future until time T . The
simplest way to avoid anticipativity is to make one single decision at each time t for all paths.
This means that the values of the decision variables is independent for all path realizations at
10
11.
Figure 3: The di®erent sample-paths from t = 0 until t = T re°ect various random outcomes.
Each path is a realization of the stochastic variables in the model.
a given time. This is the basis of current sample-path based approaches. We will relax this
approach, without introducing anticipativity, by making the same decision at some point in time
for all sample-paths in a particular bundle of sample-paths. However, we allow for the presence
of multiple bundles of sample-paths at each point in time. This approach, is inspired by ideas
earlier developed for portfolio optimization by Hibiki [17, 18, 19].
In particular, we will consider two models that will lead to linear optimization problems. We
will call these models the ¯xed-value and ¯xed-quantity models. In the ¯xed-value model, the
dollar value of the positions held in each of the assets will be the same for all scenarios in a
given bundle, whereas in the ¯xed-quantity model the number of shares of each asset will be the
same for all scenarios in a given bundle. (Hibiki [17, 18, 19] referred to the ¯xed-quantity case
as ¯xed-amount; we have renamed this case to avoid confusion, since amount can refer to both
quantity (of shares) as to a dollar amount.) Similar to ¯ndings by Hibiki [17, 18] for portfolio
allocation problems, our initial numerical experiments indicate that for the ALM problem for
pension funds, the ¯xed-quantity model leads to solutions that are superior to the solutions
obtained by the ¯xed-value model. In this paper, we present the mathematical model for the
¯xed-quantity case, and discuss numerical results for its performance in several settings. For
the ¯xed-value case, we limit ourselves to discussing the numerical results, but we omitted the
detailed mathematical model.
The ¯xed-quantity approach can be implemented in various frameworks. Using a stochastic
11
12.
programming approach, Consiglio et al. [9] considered the ¯xed quantity models for the insurance
industry.
2.2 Structure of decision rules: grouping of sample-paths
To avoid anticipativity of solutions, the same decisions are made simultaneously for many sample-
paths. For reasons of comparison, we will study the extreme case where the same decisions are
made for all sample paths at a given point in time, i.e., at each point in time there is only a single
bundle of sample paths. However, such approach may lead to very conservative solutions: after a
high observed return on investments, we would need to contribute more than necessary to cover
liabilities, since the same contributions would also have to cover the liabilities for the case of low
returns.
To have a more °exible control strategy, we group sample-paths into di®erent bundles at each
point in time, and make the same decision for all paths in each node. At time t, we have grouped
the paths in Kt groups, or bundles, for t = 1; : : : ; T ¡ 1. Paths that are in two di®erent groups
at time t can pass through the same group at either earlier or later points in time (or both).
Also, paths that pass through one node at time t do not necessarily pass through the same node
at any other time. Figure 4 illustrates this setup. There is a lot of °exibility in grouping the
Figure 4: Grouping of paths into bundles at each time t. For each bundle the same decision is
taken.
paths. Besides having to decide how many groups to have at each time, we should also decide how
to allocate paths to these groups. The idea is to group paths into bundles that require similar
12
13.
decisions. Since the funding ratio is a single quantity that characterizes the health of the pension
funds, this seems a reasonable measure to use for grouping. A high funding ratio may allow one
to invest in risky instruments or to demand a lower contribution from the fund's sponsor and
active members. On the other hand, a low funding ratio may mean that the fund is in danger of
violating its liability constraints. This means that a raised contribution rate probably is needed.
So it seems intuitive that scenarios with similar funding ratios call for similar optimal decisions,
and can therefore be grouped together. Unfortunately, the funding ratio is a result of a particular
strategy, and cannot therefore be computed a priori. We have chosen to ¯rst solve the problem
using only a single bundle at each time period. Further, we have used the obtained solution to
calculate the funding ratio (for each path at each time), and grouped paths in bundles. This
approach could be employed in an iterative fashion { namely by using the optimal strategy for a
given grouping to re-estimate the funding ratios, which can then in turn be used to re-group the
sample paths. The application of this method is beyond the scope of this study, and is left for
future research. Our numerical experiments have shown that this method for grouping according
to the funding ratio leads to reasonable results.
2.3 Fixed-quantity model
With the ¯xed-quantity rule, a position in an asset is represented by the number of shares (i.e.
the quantity). The model considers I di®erent sample-paths (realizations) for times t = 0; : : : ; T .
At the beginning of each time period t = 0; : : : ; T ¡ 1, an investment decision is made and at the
end of every time period this investment must cover the value of future liabilities in the ®-CVaR
sense. Payments are made to retirees, and a contribution to the fund is made. In this model,
we ¯x the number of shares in each instrument for all paths in a single group (bundle) at each
time moment. However, in this case the total value of all shares to be purchased might not be
equal to the total available wealth, i.e., there is a balancing problem. For example, consider two
di®erent paths, say i and j, belonging the same group at time t. In both paths, the portfolio
should be adjusted to hold the same number of shares in two assets, for instance, in asset 1 and
asset 2. The total value of these shares may be di®erent in both paths due to the fact that each
path has its own history of asset returns up to time t. This clearly is not a problem. However,
the total value of the shares to be purchased may not coincide with the total amount available
for investment in one or both paths. We have chosen to solve this problem by allowing to make
up for the di®erence by additional (positive or negative) investments in cash. Hibiki [17] chooses
the cash position to be the path dependent variable. The idea to use cash as a path dependent
13
14.
variable earlier was considered by Hiller and Eckstein [20] for bonds and Zenios [34] extended
it to mortgage cash°ows. Here, we include two di®erent cash positions in the model. Strategic
investments in cash, as one of the asset categories, are made using a number of shares that is
constant for all paths in a single group at a single time. In addition, we have included a path
dependent deviation from this ¯xed quantity, to account for excess or shortage wealth. The
path dependent variable can take positive or negative values. This is consistent with other ALM
models, e.g. in Kouwenberg [22] the borrowing of cash is allowed, but not the shorting of other
assets. However, to avoid using this "corrective" cash to cover liabilities, we require that the
average path dependent cash position be zero over all paths in a group at a given time. The
strategic cash position, like the other asset positions, are restricted to be nonnegative.
3 Computational results
This section contains computational results for the ¯xed-quantity model, and we will compare
solutions obtained without grouping to ones obtained with grouping of sample-paths. A mathe-
matical description of the model is included in Appendix.
3.1 Data and computational resources
We have used a dataset of sample-paths, which was generated at ORTEC Consultants B.V. for
one of the pension funds in The Netherlands. The dataset contains 5,000 sample-paths for a
time horizon of 10 years. Each sample-path contains returns for 12 ¯nancial assets, wages for the
active members, payments to be made each year, and future liabilities. The asset categories are:
1) Cash Netherlands, 2) Bond CP Netherlands, 3) Bond CP United States, 4) Bond CP Japan,
5) Bond CP United Kingdom, 6) Bond Emerging Markets, 7) Equity Europe, 8) Equity United
States, 9) Equity Japan, 10) Equity United Kingdom, 11) Equity Emerging Markets, and 12)
Private Equity.
However, to simplify the interpretation of the results, we have mostly limited ourselves to a
subset of four asset categories: Cash Netherlands, Bond CP Netherlands, Equity Europe, and
Equity Emerging Markets. The objective of this study is to provide a qualitative assessment of
our model and approach. The simpli¯ed portfolio makes it easier to grasp the basic characteristics
of our modeling approach.
Some of the model parameters that we have used are (a full list is included in Table 2 in the
Appendix):
14
15.
² a target funding ratio of Ã = 1:2, see equation (5) and equation (15) in the Appendix;
² con¯dence level in CVaR constraint ® = 0:95, see equation (8) and equation (16) in the
Appendix;
² upper bound in the CVaR constraints is set to wt = 0, for all time moments and all nodes,
see equation (8) and equation(16) in the Appendix.
This means that we limit the expected value of the worst 5% underperformances to be 20% over
the future value of the liabilities (i.e. the outcome of L). All monetary values have been scaled
so that A0 = 1, see balance equations (1) and (13).
We have implemented the model using the CPLEX callable library. All computations were
done on an IBM Power 3 node with 2 processors and 512MB of RAM (CPLEX used one processor,
up to 256MB of RAM). The computation time for the problem with I = 5; 000 (number of
scenarios), N = 3 (number of instruments excluding cash) and T = 10 (number of periods) was
about three hours. To limit the computation time, in the remainder we have used a subset of
2,000 scenarios. Although in our numerical example we mostly considered N = 3, the model can
handle quite a large number of assets since the number of constraints, the number of variables,
and the computation time remain relatively constant as long as N ¿ I.
3.2 One decision at each time moment
First, we considered the case where the contribution rate and portfolio allocation (# of shares) are
the same for all sample paths at each time t = 1; : : : ; T ¡ 1. The contribution rate and (strategic)
portfolio allocation thus depend on time but do not depend on the sample-paths. Although the
number of shares invested in each instrument does not depend on the particular sample-path
that occurs, the actual monetary portfolio composition may di®er for various paths because of
di®erent prices of the instruments along di®erent paths, and because of the additional investment
in cash to compensate for di®erent wealth levels within a given group of sample-paths. Figure
5 illustrates the composition of a typical portfolio (average monetary proportions) as a function
of time. On average, more than 84% of the strategic portfolio funds are allocated to the bond
(Bond CP Netherlands), while the remaining funds are allocated to equities (Equity Europe, and
Equity Emerging Markets). The allocation to strategic cash (Cash Netherlands) is close to zero.
There is a tendency to increase the allocation in equities over time (from 5% to 14%, maximum
value of equities is 16%).
15
16.
Figure 5: Average monetary proportions of instruments. One decision is made for all sample-
paths at each time (the same # of shares for all sample-paths at each time). The monetary
portfolio composition di®ers between paths.
It is interesting to compare the dynamics of portfolio allocation with the dynamics of risk
levels. Since the bound on CVaR is set at zero level (wt = 0; 8t), VaR should be negative (CVaR
is always greater than or equal to VaR). In addition, Figure 6 shows that VaR (the variable
³ in the model) moves away from zero over time. In contrast, the number of underfundings
(or probability of underfunding) stays fairly constant. At the same time, the expected value of
the underfundings increases6 . Figure 7 illustrates that the di®erences in funding ratios between
the di®erent paths is increasing over time by comparing the distribution of the funding ratio at
di®erent times. In year 1 (i.e. after one period), the distribution of funding ratios is concentrated
around 1.3, almost 90% is found in the interval 1.20 to 1.25, the lowest value is 1.18 and the largest
1.42. By year 5, the average funding ratio is just below 1.4, but the lowest value found is 1.13
and the highest is 1.69. This pattern continues, and in year 9 we actually observe sample-paths
in which the funding ratio is below 1 (0.3% of the 2,000 paths). So while the average funding
ratio increases over time, the probability that very bad cases occur increases as well.
We conducted a sensitivity analysis of the model with respect to the funding ratio parameter
Ã by varying this parameter from 1.0 to 1.4. Figure 8 shows the e®ect of changing Ã on the
contribution rate. The contribution rates for di®erent Ã seem to be very similar. As could be
6
Recall that underfunding means that the wealth of the fund is lower than Ã times the liabilities. If Ã > 1 this
can still mean that we are not truly underfunded, but only that we are not meeting our target funding ratio.
16
17.
Figure 6: Evolution of three risk measures for the model with one decision at each time moment.
VaR reduces with time. The probability of underfunding stays approximately constant. The
expected value of the underfundings increases with time.
Figure 7: Distribution of the funding ratio for time 1, 5 and 9 for the model with ¯xed allocations
at each time. The variance of the funding ratio increases with time. The CVaR constraint limits
the left tail of the distribution, which remains at Ã = 1:2 for all time periods.
17
18.
Figure 8: The contribution rate for di®erent values of Ã. The contribution rate follows the same
decreasing pattern for all values of Ã.
expected, a higher value of the funding ratio parameter Ã leads to higher contribution rates.
Calculations show that parameter Ã can be e®ectively used to adjust the wealth of the fund. The
relationship between yt andÃ for several time periods is illustrated in Figure 9. The relationship
is close to linear, and a higher Ã implies a higher contribution rate.
We also performed a sensitivity analysis of the cost of the fund with respect to the con¯dence
level ® in the CVaR constraint. As expected, the costs increase with increasing con¯dence level ®.
The behavior is illustrated in Figure 10, where both the average contribution rate (lower curve)
as well as the present value of the contributions to the fund (upper curve) are shown.
3.3 Grouping of sample-paths
The strategy obtained in the previous section does not depend on the realized sample-path,
although the actual decisions do change with time. This solution was used as the ¯rst step before
constructing more °exible solutions. To obtain strategies that adapt to the situation faced by
the fund, as measured by the funding ratio, we have grouped sample-paths in 8 groups at each
point in time, using the funding ratios found in the previous section. The two extreme groups at
each time include 100 paths. The distance in the funding ratio between the path with the lowest
funding ratio in the ¯rst group and the path with the highest in the last group is then split into
12 parts. Groups two and seven consist of the ¯rst and last three of these parts; groups three
18
19.
Figure 9: The relationship between yt and Ã at ¯xed times. Higher value of the funding ratio
parameter Ã leads to higher contribution rates.
Figure 10: The cost of the pension fund for di®erent values of ®. Costs are illustrated both as
the value of the objective function, which is the present value of the contributions to the fund
(upper curve) and as the average contribution rate (lower curve).
19
20.
and six consist of the next two of these parts in either direction; and groups four and ¯ve consist
of one of these parts each. The resulting number of paths can be found in Table 1.
Table 1: The number of paths in each group (bundle).
group/time 1 2 3 4 5 6 7 8 9
1 101 101 101 101 101 101 101 101 101
2 295 263 253 226 201 187 173 200 201
3 352 290 321 309 318 262 252 308 268
4 200 192 214 198 227 216 189 191 184
5 230 230 230 197 213 226 222 225 214
6 378 450 393 456 453 460 467 439 482
7 344 374 388 413 387 448 496 436 450
8 100 100 100 100 100 100 100 100 100
Grouping signi¯cantly improves the performance of the algorithm. For the ¯xed quantity
model with grouping, we obtained a decrease in costs of about 50%, compared to the case with
one decision in each time, see Figure 11. The second set of bars in this graph corresponds to
the ¯xed quantity model without grouping and the third set of bars corresponds to the ¯xed
quantity model with grouping. Three cost values are presented in Figure 11: net present value
of contributions to the fund, average premium, and contribution rate as a fraction of wages. The
¯rst set of bars in Figure 11 corresponds to the ¯xed value model. This model is very similar to
the ¯xed quantity model, but instead of ¯xing the number of shares, in the ¯xed value model,
the monetary values invested in each instrument are ¯xed. As mentioned above, the ¯xed value
model signi¯cantly underperforms the ¯xed quantity model, which is why we have omitted the
model details from this paper. However, for comparison purposes, we have included data on this
model in Figures 11, 12, and 14. The dynamics of the contribution rates for the di®erent models
is presented in Figure 12. Again, we note that the ¯xed value model considerably underperforms
the ¯xed quantity model. The contribution rate in the ¯xed quantity model with grouping is
lower than the contribution rate in the ¯xed quantity model without grouping. For the case
with grouping, the contribution rate is calculated as the weighted average of the contribution
rates over the 8 groups at each time. The contribution rate of the model with grouping exhibits
some oscillations. These oscillations may be suppressed using additional constraints, disallowing
20
21.
Figure 11: Comparison of costs between di®erent models. The ¯xed quantity model with grouping
(third set of bars) gives about 50% lower costs as compared to the ¯xed quantity model without
grouping (second set of bars). The ¯rst set of bars corresponds to the ¯xed value model.
Figure 12: Comparison of the contribution rates between di®erent models. Fixed value model
without grouping has the highest contribution rate (black diamonds). Fixed quantity model
without grouping (squares) performs better than the ¯xed value model. Fixed quantity model
with grouping (back triangles) outperforms the other two models. For the case with grouping,
the contribution rate is calculated as the weighted average of the contribution rates over the 8
groups at each time moment.
21
22.
signi¯cant changes in the contribution rate at each time. However, at this time, we have chosen
not to include these constraints into the model. The contribution rate for various groups in the
¯xed quantity model with grouping is presented in Figure 13. The contribution rate di®ers for
Figure 13: Fixed quantity model with grouping: contribution rate for various groups. The
weighted average of contribution rates over 8 groups (solid curve). Ranges of contribution rates
(vertical lines). The group with the highest funding ratio (diamonds) and the group with the
next to the highest funding ratio (squares).
each group of paths. The solid curve in the graph is the weighted average of contribution rates
over 8 groups. The vertical lines display the range of contribution rates for each time period. The
group with the highest funding ratio is presented by diamonds and the group with the next to
the highest funding ratio is presented by squares. These two groups exhibit the highest changes
in the contribution rate. As we indicated earlier, the oscillations can be reduced by modifying
the feasible set of contribution rates. On the other hand, the oscillations may not be a severe
drawback of this model (if kept under control). Clearly, it will be undesirable to take dramatically
di®erent decisions between time periods (contribution rate oscillates from ¡0:2 to 0:3), but the
oscillations do provide a cheaper solution" than the solution of the ¯xed quantity model without
grouping. Usually, one is interested in the decision at time 0. This is because the program would
most likely be implemented in a rolling horizon fashion, i.e. one would rerun the program at each
time period to obtain a new optimal initial decision.
We have also compared the initial portfolios for the three di®erent models. As one can see in
Figure 14, there is little di®erence between the three initial portfolios. The ¯xed quantity model
22
23.
Figure 14: The initial portfolio for three models (¯xed value, ¯xed quantity with and without
grouping). The ¯xed quantity model with grouping has the highest exposure to equities, about
13%. All portfolios have more than 90% of their investments in bonds
with grouping has the highest exposure to equities (highest percentage of risky instruments). The
¯xed value model without grouping has the lowest exposure to equities. However, the CVaR risk
level for the three models is the same. This illustrates that, when a dynamic control strategy
that responds to the situation faced by the fund is employed, risk can be accounted for in a more
cost-e®ective manner.
4 Conclusions
In this paper we have explored a new approach to modeling Asset/Liability Management (ALM)
problems for pension funds. We have combined CVaR risk management with a new framework
of optimal decisions using sample-paths. We have formulated and solved several multiple-period
optimization models. Our ¯ndings can be summarized as follows.
We have formulated a model for ¯nding optimal contribution rates and portfolio allocations,
taking into account the funding situation of the fund. Using the CVaR risk measure, the model
can be solved with linear programming techniques.
Our approach is based on adding °exibility to the decisions while still using only a sample-path
representation of uncertainties, thereby avoiding the explosion of the problem dimension faced by
a stochastic programming approach. This is achieved by grouping, at each point in time, a set
23
24.
of sample-paths that correspond to similar characteristics of the pension fund, and by restricting
decisions to vary among di®erent groups of sample-paths. We obtained truly dynamic decisions
at a moderate computational expense, while allowing for extensive uncertainty through the use
of paths. In fact, from a computational point of view, we have observed that the problem size
and solution times are of the same order of magnitude, with or without grouping.
Our main focus has been on the so-called ¯xed-quantity model, where for each group of sample-
paths the number of shares invested in each asset category is optimized. We have compared our
grouping strategy to a strategy in which, at each time, the same decision is taken regardless of the
state of the fund. We have compared these two models to a so-called ¯xed-value model without
grouping, where instead of the number of shares, the monetary value invested in each asset
category is optimized. Our experiments indicate that using dynamic decision making through
the use of paths leads to much lower costs to the fund than the the alternative without grouping.
Clearly, how one groups the sample-paths a®ects the solution. For instance, the solutions obtained
show an oscillating behavior over time, which could be a consequence of the particular grouping
method.
Future research will be devoted to addressing the issue of grouping the sample-paths, perhaps
by applying the algorithm in an iterative fashion. Furthermore, we need to analyze end-of-study
e®ects by associating a value with the state of the pension fund at the end of the horizon, as well
as the e®ect of choosing di®erent objectives, for instance incorporating a measure of the rate of
return on the investment portfolio.
Acknowledgments
We are grateful to ORTEC Consultants B.V. for providing a dataset of sample-paths for a pension
fund which was used in this study.
References
[1] Acerbi, C., C. Nordio, and C. Sirtori, Expected shortfall as a tool for ¯nancial risk manage-
ment. Working paper, 2001, (download from http://www.gloriamundi.org).
[2] Acerbi, C., and D. Tasche, On the coherence of expected shortfall. Working paper, 2001,
(download from http://www.gloriamundi.org).
24
25.
[3] Artzner, P., P. Delbaen, J.-M. Eber, and D. Heath. Coherent measures of risk," Mathemat-
ical Finance, 9, 1999, pp. 203{228.
[4] Andersson, F., H. Mausser, D. Rosen, and S. Uryasev. Credit Risk Optimization with Con-
ditional Value-at-Risk." Mathematical Programming, Series B, December, 2000. (relevant Re-
search Report 99-9 can be downloaded http://www.ise.ufl.edu/uryasev/pubs.html#t).
[5] Blake,D., Cairns, A. and K. Dowd. Pensionmetrics: Stochastic Pension Plan Design During
the Distribution Phase," Pensions Institute, University of London, Discussion Paper PI-0103,
August, 2001.
[6] Birge, J.R. and F. Louveaux, Introduction to Stochastic Programming," Springer Series in
Operations Research, 1997.
[7] Boender, C.G.E., P.C. Van Aalst, and F. Heemskerk. Modeling and Management of Assets
and Liabilities of Pension Plans in The Netherlands," in W.T Ziemba and J.M. Mulvey
(eds.), Worldwide Asset and Liability Modeling. Cambridge University Press, 1998.
[8] Cairns, A.J.G., Blake, D., and K. Dowd. Optimal dynamic asset allocation for de¯ned-
contribution pension plans," Proceedings of the 10th AFIR Colloquium, Tromsoe, June,
2000, pp. 131-154.
[9] Consiglio, A., Cocco, F. and S.A. Zenios", The Value of Integrative Risk Management for
Insurance Products with Guarantees," Journal of Risk Finance, Spring, 2001, pp. 1{11.
[10] Boender, C.G.E. and H.E., Romeijn. The Multidimensional Markov Chain with Prespeci¯ed
Asymptotic Means, and (Auto-)Covariances," Communications in Statistics: Theory and
Methods, 20, 1991, pp. 345-359.
[11] Carino, D.R. et al., The Russel-Yasuda Kasai Model: An Asset/Liability Model for a
Japanese Insurance Company Using Multistage Stochastic Programming," Interfaces 24:1,
1994.
[12] Censor, Y. and S.A. Zenios, Parallel Optimization", Numerical Mathematics and Scienti¯c
Computation, Oxford University Press, New York, 1997.
[13] Dert, C. A Dynamic Model for Asset Liability Management for De¯ned Bene¯t Pension
Funds," in W.T Ziemba and, J.M. Mulvey (eds.), Worldwide Asset and Liability Modeling.
Cambridge University Press, 1998.
25
26.
[14] Dert, C. Asset Liability Management for Pension Funds { a Multistage Chance Constrained
Programming Approach." Ph.D. Thesis, Erasmus University Rotterdam, The Netherlands
(1995).
[15] Ermoliev, Yu. and R.J-B Wets (Eds.), Numerical Techniques for Stochastic Optimization",
Springer Series in Computational Mathematics, 10, 1988.
[16] Gaivoronski A.A., and G. P°ug. Value at Risk in portfolio optimization: properties and
computational approach", NTNU, Department of Industrial Economics and Technology
Management, Working paper, July, 2000.
[17] Hibiki, N. Multi-Period Stochastic Programming Models for Dynamic Asset Allocation."
Stochastic Systems Theory and Its Applications, Yokohama, Nov. 1999, pp. 11-12.
[18] Hibiki, N. Multi-Period Stochastic Programming Model Using Simulated Paths for Strategic
Asset Allocation". APORS 2000. The 5th Conference of The Association of Asian-Paci¯c
Operations Research Societies within IFORS, 5 July, Singapore.
[19] Hibiki, N. Simulation/Tree Hybrid Model for Optimal Asset Allocation," The Japanese
Association of Financial Econometrics and Engineering, 2000, pp. 175-193. (in Japanese).
[20] Hiller, R.S. and J. Eckstein. Stochastic Dedication: Designing Fixed Income Portfolios
using Massively Parallel Benders Decomposition," Management Science, Vol. 39, 11, 1993,
pp. 1422{1438.
[21] Hoyland, K. and S.W. Wallace, Generating Scenario Trees for Multi-stage Decision Prob-
lems." Management Science, 47, 2001, pp. 295-307.
[22] Kouwenberg, R. Scenario Generation and Stochastic Programming Models for Asset Lia-
bility Management." European Journal of Operational Research, 134, 2001, pp. 279{292.
[23] Merton, R.C. Optimum Consumption and Portfolio Rules in a Continuous-Time Model."
Journal of Economic Theory, 3, December, 1971, pp. 373-413.
[24] Merton, R.C. Continuous-Time Finance." Blackwell, Cambridge MA and Oxford UK, re-
vised edition, 1993.
[25] Milevsky, M.A. Optimal Asset Allocation Towards the End of the Life Cycle: to Annuitize
or not to Annuitize?" The Journal of risk and Insurance, 65(3), September, 1998, pp. 1998.
26
27.
[26] Mulvey, J.M., Rosenbaum, D.P., and B. Shetty. Strategic Financial Risk Management and
Operations Research," European Journal of Operational Research, 97, 1995, pp. 1{16.
[27] Palmquist, J., Uryasev, S. and P. Krokhmal. Portfolio Optimization with Conditional Value-
at-Risk Objective and Constraints." Journal of Risk , forthcoming (relevant Research Report
99-14 can be downloaded from http://www.ise.ufl.edu/uryasev/pal.pdf).
[28] P°ug. G. Some Remarks on the Value-at-Risk and the Conditional Value-at-Risk /, in Prob-
abilistic Constrained Optimization: Methodology and Applications" (S. Uryasev ed.), Kluwer
Academic Publishers, 2000.
[29] Prekopa A., Stochastic Programming", Kluwer Academic Publishers, 1995.
[30] Rockafellar, R. T. and S. Uryasev. Optimization of Conditional Value-at-Risk," Journal of
Risk, V 2 , 2000, pp. 21{41.
[31] Rockafellar R.T. and S. Uryasev. Conditional Value-at-Risk for General Loss Distributions."
Research Report 2001-5. ISE Dept., University of Florida, April, 2001 (Can be downloaded:
http://www.ise.ufl.edu/uryasev/cvar2.pdf)
[32] Steinbach, M.C. Markowitz Revisited: Single-Period and Multi-Period Mean-Variance Mod-
els." Preprint SC 99-30, Konrad-Zuse-Zentrum fÄr Informationstechnik Berlin, 1999.
u
[33] Zenios, S.A. High Performance Computing for Financial Planning: The Last Ten Years and
the Next," Parallel Computing, 25 , 1999, pp. 2149{2175.
[34] Zenios, S.A. A Model for Portfolio Management with Mortgage-Backed Securities," Annals
of Operations Research, 43, 1993, pp. 337{356",
[35] Ziemba T.W. and M.J. Mulvey (Eds.), Worldwide Asset and Liability Modeling," Cam-
bridge Press, Publications of the Newton Institute, 1998.
Appendix: mathematical model
This appendix formally presents the ¯xed-quantity model with CVaR constraints. We consider
the model with grouping of sample-paths. A special case of this model is a model without
grouping, i.e., the same decision is taken for all paths at each time moment.
27
28.
4.1 Notation
Parameters:
² A0 = total initial value of all assets.
² W0 = total initial amount of wages.
² l0 = initial payments made by the fund.
² pn;0 = initial market price of asset n (scaled to 1 for all assets).
² ½0 = scale factor which translates the initial cash position into a monetary value, (set to 1,
for simplicity).
² Ã = lower bound for funding ratio; typical value for Ã is around 1 or larger.
² Ãend = lower bound for funding ratio at the last time period.
² I = number of paths.
² N = number of assets.
² T = number of time intervals.
² ° = discount factor for contributions in the future.
² wt = CVaR constraint level at time t.
² ® = con¯dence level in CVaR.
² k(i; t) = function returning the node (i.e., group number) through which, at time t pass
i-th sample-path.
² Kt = set of all nodes at time t.
² Vtk = set of paths i that pass node k at time t.
² ¿ low = lower bound on cash positions.
² v = upper bound on the relative position of an asset in the portfolio (0 · v · 1).
low
² »n;t = lower bound on the position of instrument n at time t.
up
² »n;t = upper bound on the position of instrument n at time t.
28
29.
² y = lower bound on contribution rate.
² y = upper bound on contribution rate.
Random data:
² pi = market price of asset n for period t-1 to t in path i.
n;t
² ½i = equivalent of a market price for cash at time t in path i. This is a conversion factor
t
that converts the cash position variables »0 and ¿ into a monetary value.
² Li = liability measure that should be met or exceeded by the total value of all assets in the
t
fund at time t in path i.
i
² lt = payments of the fund at time t in path i.
² Wti = total wages at time t in path i.
Decision variables:
k
² yt = contribution rate at time t in node k.
k
² »n;t = total quantity (i.e. # of shares) of asset n; (n = 0; : : : ; N ) at time t in node k.
² ¿0 = additional of cash owned at time 0. 0 actually
² ¿ti = amount of cash owned at time t in path i.
k
² ³t = dummy variable which approximates ®-VaR in the optimal solution at time t for the
decision taken at node k.
i
² zt = dummy variables associated with the ®-CVaR constraint at time t and in path i.
² q i = amount of money borrowed at time T ¡ 1 in path i.
² B i = size of underfundings at time T in path i.
4.2 Formulation of the Optimization Problem
First,we formulate the problem. Then, we comment each expression in this formulation.
I T ¡1 k(i;t) I I
1 X X Wti yt 1X qi 1X Bi
minimize W0 y0 + + ¸1 + ¸2 (12)
I (1 + °)t I (1 + °)T I (1 + °)T
i=1 t=1 i=1 i=1
29
30.
subject to
N
X
pn;0 »n;0 + ½0;0 ¿0 = A0 ¡ l0 + W0 y0 ; (13)
n=0
N
X k(i;t) k(i;t¡1) k(i;t)
pi (»n;t
n;t ¡ »n;t¡1 ) + ½i (¿ti ¡ ¿t¡1 ) = Wti yt
t
i i
¡ lt ; t = 1; : : : ; T ¡ 1; 8i ; (14)
n=0
N
X k(i;t¡1) k(i;t¡1)
ÃLi
t ¡ pi »i;t¡1
n;t ¡ ½i ¿t¡1 ¡ ³t
t
i i
· zt ; 8i; t = 1; : : : ; T ; (15)
n=0
1 X
k i
³t + k
zt · wt ; t = 1; : : : ; T ; k 2 Kt¡1 ; (16)
(1 ¡ ®)jVt¡1 j k
i2Vt¡1
½i ¿T ¡1
T
i
+ q i ¸ 0; 8i; (17)
N
X k(i;T ¡1)
pi »n;T ¡1
n;T + ½i ¿T ¡1 + B i ¸ Ãend Li ; 8i;
T
i
T (18)
n=0
1 X i i
½t ¿t ¸ 0; k 2 Kt ; t = 1; : : : ; T ¡ 1 ; (19)
jVtk j k
i2Vt
N
X
1
pn;0 »n;0 · pm;0 »m;0 ; 8n; (20)
v m=0
XN
1 i k(i;t) k(i;t)
p » · pi »m;t ; 8i; 8n; t = 1; : : : ; T ¡ 1; (21)
v n;t n;t m;t
m=0
low k up
»n;t · »n;t · »n;t ; t = 0; : : : ; T ¡ 1; 8n; k 2 Kt ; (22)
i
0 · zt ; 8i; t = 1; : : : ; T; (23)
0 · ¿0 ; (24)
¿ low · ¿ti ; 8i; t = 1; : : : ; T ¡ 1; (25)
0 · q i ; 8i; (26)
0 · B i ; 8i; (27)
y0 is free; (28)
k
y · yt · y; t = 1; : : : ; T ¡ 1; 8i; k 2 Kt ; (29)
k
³t is free; t = 1; : : : ; T; k 2 Kt : (30)
4.2.1 Objective
The objective function (12) consists of four terms. The ¯rst term equals the initial contribution,
and the second term equals the expected present value of the contributions to the pension fund.
The third term is the expected present value of the loans at the end of the investment horizon.
30
31.
This term is included to ensure that all borrowed money is repaid at the end of the investment
horizon. The ¯nal term is the expected present value of the underfundings at time T , i.e. the
model penalizes those cases where we have less wealth than the required level Ãend Li . This term
T
was included to prevent end-of-horizon e®ects.
4.2.2 Investment Balance
Constraints (13), (14) are balance equations imposing that the amount of money available at
the end of a period, plus additional contributions and minus payments, is equal to the money
available at the beginning of the next period.
4.2.3 CVaR Constraints on Wealth
k
We have one CVaR constraint for each node, and accordingly one auxiliary variable ³t for each
k
node k at each time t. If the CVaR constraint is active, the optimal value of the variable ³t will
be equal to ®-VaR for the appropriate node7 . In each node k and at each time t, the value of the
investments must meet the required level ÃLi in an ®-CVaR sense, see (15), (16). The conditional
t
k
expected value of losses exceeding the VaR level ³t is constrained by the CVaR bound wt in (16).
4.2.4 Terminal Loans
At the end of the investment horizon (i.e. when t = T ), all borrowed money must be repaid.
Constraint (17) ensures that q i holds the value of the borrowed cash position at time t = T .
4.2.5 End-of-horizon E®ects
B i in (18) measures a shortage of wealth in path i at time T when the wealth is below the
required level Ãend L. The value B i is included in the objective function to prevent undesirable
end-of-horizon e®ects.
4.2.6 Constraints on Positions
The model allows the constraining of both the absolute and relative position sizes. The relative
position in each asset can be limited to v (0 · v · 1) of the total portfolio value with the
constraints (20) and (21). The value v = 1 implies that we have no bounds on the relative
positions. The absolute positions are handled by constrains (22).
7 k
®-VaR equals to the smallest optimal value if the solution ³t is not unique.
31
32.
4.2.7 Constraints on Cash Positions
Similar to the other assets, the size on the cash position could also be limited. In particular, we
do not allow any borrowing at time 0 (constraint (24)), since borrowing should only be used to
compensate for the di®erences between the sample-paths contained in the same group. Imposing
a lower bound on cash positions could re°ect the impact of regulations (constraint (25)). We
allow borrowing in all paths, but limit the expected value of the cash positions to be no less than
zero (constraint (19)). This means that on average we do not borrow.
4.2.8 Constraints on Contribution Rate
We have also placed limits on the rates of contributions from wages of active members, see, (29).
The upper bound is denoted by y and lower bound is denoted by y.
4.3 Size of problem
Figure 15 shows how the problem size grows with the number of assets for a typical example.
The dimension of the matrix (number of variables and constraints) stays fairly constant as long
as N ¿ I.
PT ¡1
² The number of variables is (N + 2)(1 + t=1 jKt j) + (2T + 1)I + T .
P
² The number of constraints is T (IN + 2I) + 2 ¡ IN + N + T ¡1 jKt j or T (3IN + 3I +
t=1
PT ¡1
N ) ¡ IN + 2 + N + t=1 jKt j depending on whether we count the simple upper and lower
bounds for the variables.
The number of nonzero elements in the constraint matrix grows linearly with the number of
PT ¡1
assets. For instance, for I=1000, N =3, T =10, t=1 jKt j = 84 the ¯ll" for this problem is
about 0.03%.
4.4 Values of Parameters
Typical parameters values that we used in this case study are included in Table 2.
32
33.
Table 2: Typical parameter values.
Parameter Value
# of paths I 2000
# of asset categories (except cash) N 3
length of investment horizon T 10
con¯dence level ® 0.95
lower bound on funding ratio Ã 1.2
lower bound on funding ratio at horizon Ãend 1.3
present value discount factor ° 0.15
penalty coe±cient for loans at horizon ¸1 1
penalty coe±cient for underfunding at horizon ¸2 1
CVaR constraint level wt , 8t 0
lower bound on cash positions ¿ low 0
upper bound on the relative position in an asset v 0.2
lower bound on position in an asset low
»n;t , 8n, 8t 0
up
upper bound on position in an asset »n;t , 8n, 8t 1
lower bound on contribution rate y ¡0:2
upper bound on contribution rate y 0.3
number of nodes jKt j, 8t 8
33
34.
Figure 15: Problem size growth with number of assets for a typical example.
34
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment