Risk aversion in multi-stage stochastic programming: a modeling and algorithmic perspective
|
|
- Constance Norris
- 6 years ago
- Views:
Transcription
1 Risk aversion in multi-stage stochastic programming: a modeling and algorithmic perspective Tito Homem-de-Mello School of Business Universidad Adolfo Ibañez, Santiago, Chile Joint work with Bernardo Pagnoncelli (Universidad Adolfo Ibañez) ICSP XIII Bergamo, July 2013 Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
2 Motivation The problem There has been active research recently in the literature regarding the introduction of risk into multi-stage stochastic programs. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
3 Motivation The problem There has been active research recently in the literature regarding the introduction of risk into multi-stage stochastic programs. There are of course multiple ways of doing that, and no definitive formulation. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
4 Motivation The problem There has been active research recently in the literature regarding the introduction of risk into multi-stage stochastic programs. There are of course multiple ways of doing that, and no definitive formulation. Our goal is to understand some formulations and discuss pros and cons. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
5 Motivation The problem There has been active research recently in the literature regarding the introduction of risk into multi-stage stochastic programs. There are of course multiple ways of doing that, and no definitive formulation. Our goal is to understand some formulations and discuss pros and cons. We then focus on a specific formulation that has some interesting properties, and show some numerical results. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
6 The problem The problem We consider multi-stage stochastic programs of the form where: min R (f 1 (x 1, ξ 1 ) f T (x T, ξ T )) (1) x 1,...,x T s.t. x t X t ( x[t 1], ξ [t] ), t = 1,..., T ξ t, t = 1,..., T is the uncertainty observed just before stage t; f t (x t, ξ t ) corresponds to the cost of decision x t given the observed uncertainty at that stage; x [t] denotes the vector x 1,..., x t, and similarly for ξ [t] ; X t ( x[t 1], ξ [t] ) denotes the feasibility set in stage t; R is a multi-period risk measure. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
7 The problem Multi-period risk measures In our context, multi-period risk measures are those applied to real-valued functions of the stochastic process {ξ t } T t=1. To simplify notation, let Z t := f t (x t, ξ t ), Z := Z Z T. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
8 The problem Multi-period risk measures In our context, multi-period risk measures are those applied to real-valued functions of the stochastic process {ξ t } T t=1. To simplify notation, let Z t := f t (x t, ξ t ), Z := Z Z T. Examples: R is an unconditional risk global measure ρ applied to the random variable Z for instance, R(Z) = ρ(z) = CVaR α (Z). Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
9 The problem Multi-period risk measures In our context, multi-period risk measures are those applied to real-valued functions of the stochastic process {ξ t } T t=1. To simplify notation, let Z t := f t (x t, ξ t ), Z := Z Z T. Examples: R is an unconditional risk global measure ρ applied to the random variable Z for instance, R(Z) = ρ(z) = CVaR α (Z). R measures the risk in each stage, i.e., R(Z) = Z 1 + ρ 2 (Z 2 ) ρ T (Z T ) where each ρ i is an unconditional risk measure such as ρ i = CVaR αi. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
10 The problem Multi-period risk measures In our context, multi-period risk measures are those applied to real-valued functions of the stochastic process {ξ t } T t=1. To simplify notation, let Z t := f t (x t, ξ t ), Z := Z Z T. Examples: R is an unconditional risk global measure ρ applied to the random variable Z for instance, R(Z) = ρ(z) = CVaR α (Z). R measures the risk in each stage, i.e., R(Z) = Z 1 + ρ 2 (Z 2 ) ρ T (Z T ) where each ρ i is an unconditional risk measure such as ρ i = CVaR αi. R is a nested risk measure given by R(Z) = ρ 2 ρ ξ [2] 3... ρ ξ [T 1] T (Z), where the notation indicates that each ρ ξ [t 1] t is a conditional one-period risk measure, defined in terms of the history ξ 2,..., ξ t 1. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
11 The problem Coherent risk measures We assume that all unconditional risk measures ρ that appear in the definition of R are coherent, i.e., 1) ρ(x + c) = ρ(x ) + c. 2) X Y w.p.1 ρ(x ) ρ(y ). 3) ρ(λx ) = λρ(x ) for λ 0. 4) ρ(x + Y ) ρ(x ) + ρ(y ). (Artzner et al. 1999, Ruszczynski and Shapiro 2006) Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
12 Consistency Consistency of risk measures Several notions of consistency have been proposed in the literature (Shapiro 2009, Ruszczynski 2010, Carpentier et al. 2012). Our notion is similar to that in Shapiro (2009) and Carpentier et al. (2012) in that it defines consistency in terms of an underlying optimization problem. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
13 Consistency Consistency of risk measures Several notions of consistency have been proposed in the literature (Shapiro 2009, Ruszczynski 2010, Carpentier et al. 2012). Our notion is similar to that in Shapiro (2009) and Carpentier et al. (2012) in that it defines consistency in terms of an underlying optimization problem. To understand the definitions, we introduce the following notation: Let ˆx := [ˆx τ : τ = 1,..., T ] be an optimal solution of (1). Let u be an arbitrary time period such that 1 < u T. Given a realization ˆξ 1,..., ˆξ u, let S ṷ denote the set of optimal x,ˆξ solutions of (1) that coincide with ˆx along the path given by that realization. Note that we can view an element of S ṷ x,ˆξ as [ x τ : τ = u,..., T ], where x τ is a function of ξ u+1,..., ξ τ. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
14 Consistency Consistency of risk measures Definition R is consistent for problems of the form (1) if there exists an element of S ṷ which is also an optimal solution of the subproblem solved at time u x,ˆξ given the history ˆx [u 1], ˆξ [u]. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
15 Consistency Consistency of risk measures Definition R is consistent for problems of the form (1) if there exists an element of S ṷ which is also an optimal solution of the subproblem solved at time u x,ˆξ given the history ˆx [u 1], ˆξ [u]. In words... Consistency means that if you solve the problem at time 1, some optimal solution will also be optimal at time u. Inconsistency means that if you solve the problem at time 1, no optimal solution will also be optimal at time u. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
16 Examples Example: A 3-stage inventory problem Assume you are a retailer who sells one product and needs to decide now how much inventory to buy, at price c. There will be two selling opportunities: in the second stage the product can be sold at price s 2 > c and in the third stage the product can be sold for s 3 > s 2. At the end of the horizon unsold units are discarded. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
17 Problem formulation Examples min R ( ) cx 1 s 2 x 2 s 3 x 3 s.t. x 2 D 2 x 2 x 1 x 3 D 3 x 3 x 1 x 2 x 1, x 2, x 3 0, Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
18 Problem instance Examples In our example, c = 2, s 2 = 3, s 3 = 10, and demand is given by a binary tree Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
19 Examples Case 1: unconditional global R Suppose we use R(Z) = CVaR 0.8 (cx 1 s 2 x 2 s 3 x 3 ) Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
20 Examples Case 1: unconditional global R Suppose we use Optimal solution: R(Z) = CVaR 0.8 (cx 1 s 2 x 2 s 3 x 3 ) Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
21 Checking consistency Examples We consider now the problem given by the subtree: Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
22 Checking consistency Examples Optimal solution: Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
23 Checking consistency Examples We see that the original solution is not optimal for the subproblem. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
24 Checking consistency Examples We see that the original solution is not optimal for the subproblem. However, the following solution is optimal for the original problem and for the subproblem; thus, the chosen R is consistent Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
25 Case 2: stage-wise R Examples Suppose we use R(Z) = cx 1 + CVaR 0.8 ( s 2 x 2 ) + CVaR 0.8 ( s 3 x 3 ) Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
26 Case 2: stage-wise R Examples Suppose we use Optimal solution: R(Z) = cx 1 + CVaR 0.8 ( s 2 x 2 ) + CVaR 0.8 ( s 3 x 3 ) Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
27 Checking consistency Examples Subtree optimal solution. No optimal solution for the original problem is optimal for the subproblem; thus, the chosen R is inconsistent Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
28 Consistent risk measures Consistent risk measures The result below is similar to others in the literature. Theorem Consider the multi-period risk measure R given by R(Z) = ρ 2 ρ ξ [2] 3... ρ ξ [T 1] T (Z), where the notation indicates that each ρ ξ [t 1] t is a conditional risk measure, defined in terms of the history ξ 2,..., ξ t 1. Then, R is consistent for problem (1). Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
29 Consistent risk measures Consistent risk measures The result below is similar to others in the literature. Theorem Consider the multi-period risk measure R given by R(Z) = ρ 2 ρ ξ [2] 3... ρ ξ [T 1] T (Z), where the notation indicates that each ρ ξ [t 1] t is a conditional risk measure, defined in terms of the history ξ 2,..., ξ t 1. Then, R is consistent for problem (1). The following corollary is almost immediate: Corollary The risk-neutral measure R(Z) = E[Z] is consistent for problem (1). The worst-case risk measure R(Z) = ess sup (Z) is consistent for problem (1). Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
30 Nested CVaR Consistent risk measures Several authors have studied the case of nested risk measures where each ρ ξ [t 1] t is defined as a conditional CVaR, i.e., { ρ ξ [t 1] t (Z t ) := CVaR ξ [t 1] α t [Z t ] = min η t + 1 E [ } ] (Z t η t ) + ξ η t R 1 α [t 1]. t There are several advantages to this approach: Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
31 Nested CVaR Consistent risk measures Several authors have studied the case of nested risk measures where each ρ ξ [t 1] t is defined as a conditional CVaR, i.e., { ρ ξ [t 1] t (Z t ) := CVaR ξ [t 1] α t [Z t ] = min η t + 1 E [ } ] (Z t η t ) + ξ η t R 1 α [t 1]. t There are several advantages to this approach: Consistency is ensured due to the nested form; consequently, Bellman-type algorithms for dynamic programming can be employed. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
32 Nested CVaR Consistent risk measures Several authors have studied the case of nested risk measures where each ρ ξ [t 1] t is defined as a conditional CVaR, i.e., { ρ ξ [t 1] t (Z t ) := CVaR ξ [t 1] α t [Z t ] = min η t + 1 E [ } ] (Z t η t ) + ξ η t R 1 α [t 1]. t There are several advantages to this approach: Consistency is ensured due to the nested form; consequently, Bellman-type algorithms for dynamic programming can be employed. The formulation of CVaR as linear stochastic optimization problem allows for seamless integration into problem (1) and consequently relatively easy adaptation of existing methods developed for risk-neutral problems. A prominent example is the Stochastic Dual Dynamic Programming algorithm, which has been used in the risk-averse setting by Guigues and Römisch (2012), Guigues and Sagastizábal (2012), Philpott and de Matos (2012), Shapiro et al. (2012), Kozmik and Morton (2013). Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
33 Consistent risk measures Nested CVaR (cont.) There are however some disadvantages to the nested CVaR approach: Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
34 Consistent risk measures Nested CVaR (cont.) There are however some disadvantages to the nested CVaR approach: It is difficult to evaluate the objective function directly, which precludes the calculation of simple upper bounds for the optimal value based on a feasible solution. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
35 Consistent risk measures Nested CVaR (cont.) There are however some disadvantages to the nested CVaR approach: It is difficult to evaluate the objective function directly, which precludes the calculation of simple upper bounds for the optimal value based on a feasible solution. Such upper bounds are important for the implementation of stopping criteria, for instance in the SDDP algorithm. Philpott, de Matos and Finardi (2013) and Kozmik and Morton (2013) have proposed some ways around that problem. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
36 Consistent risk measures Nested CVaR (cont.) There are however some disadvantages to the nested CVaR approach: It is difficult to evaluate the objective function directly, which precludes the calculation of simple upper bounds for the optimal value based on a feasible solution. Such upper bounds are important for the implementation of stopping criteria, for instance in the SDDP algorithm. Philpott, de Matos and Finardi (2013) and Kozmik and Morton (2013) have proposed some ways around that problem. Nested risk measures can have a somewhat unexpected behavior (which we call lack of structural monotonicity ), as we shall see next. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
37 Consistent risk measures Back to example Recall the solution of the inventory problem with c = 2, s 2 = 3, s 3 = 10. R(Z) = CVaR 0.8 (cx 1 s 2 x 2 s 3 x 3 ) Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
38 Changing costs Consistent risk measures Suppose we change the costs to c = 2, s 2 = 8, s 3 = 10. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
39 Changing costs Consistent risk measures Suppose we change the costs to c = 2, s 2 = 8, s 3 = 10. We see that, even though the selling price goes up, we order and sell less! Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
40 The E-CVaR risk measure An alternative risk measure One alternative that can be used to address the above issues is the following multi-period risk measure: E-CVaR(Z) := Z 1 + T t=2 [ ] E ξ[t 1] CVaR ξ [t 1] α t (Z t ) Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
41 The E-CVaR risk measure An alternative risk measure One alternative that can be used to address the above issues is the following multi-period risk measure: E-CVaR(Z) := Z 1 + T t=2 [ ] E ξ[t 1] CVaR ξ [t 1] α t (Z t ) The idea is to measure the risk in each period, but compute the expectation instead of carrying it backward as in the nested case. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
42 The E-CVaR risk measure An alternative risk measure One alternative that can be used to address the above issues is the following multi-period risk measure: E-CVaR(Z) := Z 1 + T t=2 [ ] E ξ[t 1] CVaR ξ [t 1] α t (Z t ) The idea is to measure the risk in each period, but compute the expectation instead of carrying it backward as in the nested case. This risk measure was proposed by Pflug and Ruszczynski (2005). Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
43 The E-CVaR risk measure An alternative risk measure One alternative that can be used to address the above issues is the following multi-period risk measure: E-CVaR(Z) := Z 1 + T t=2 [ ] E ξ[t 1] CVaR ξ [t 1] α t (Z t ) The idea is to measure the risk in each period, but compute the expectation instead of carrying it backward as in the nested case. This risk measure was proposed by Pflug and Ruszczynski (2005). Can also be viewed as particular case of polyhedral risk measures (Eichhorn and Römisch 2005). Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
44 The E-CVaR risk measure Back to the example Solution of the inventory problem with E-CVaR, with worst-case in each stage. ] R(Z) = cx 1 + CVaR 0.8 ( s 2 x 2 ) + E D2 [CVaR D ( s 3x 3 ) Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
45 The E-CVaR risk measure An attractive property At first sight it appears that E-CVaR could be inconsistent since it does not have an apparent nested formulation. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
46 The E-CVaR risk measure An attractive property At first sight it appears that E-CVaR could be inconsistent since it does not have an apparent nested formulation. However, the result below shows that this is not the case: Theorem Problem (1) with R = E-CVaR can be written as a risk-neutral multi-stage problem with some extra variables and constraints. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
47 The E-CVaR risk measure An attractive property At first sight it appears that E-CVaR could be inconsistent since it does not have an apparent nested formulation. However, the result below shows that this is not the case: Theorem Problem (1) with R = E-CVaR can be written as a risk-neutral multi-stage problem with some extra variables and constraints. The proof follows from the optimization formulation of CVaR ξ [t 1]; the extra variables are the η t. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
48 The E-CVaR risk measure An attractive property At first sight it appears that E-CVaR could be inconsistent since it does not have an apparent nested formulation. However, the result below shows that this is not the case: Theorem Problem (1) with R = E-CVaR can be written as a risk-neutral multi-stage problem with some extra variables and constraints. The proof follows from the optimization formulation of CVaR ξ [t 1]; the extra variables are the η t. See also Eichhorn and Römisch (2005). Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
49 Comments The E-CVaR risk measure The equivalence with a risk-neutral multi-stage problem allows for the use of standard methods developed for that type of problem. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
50 Comments The E-CVaR risk measure The equivalence with a risk-neutral multi-stage problem allows for the use of standard methods developed for that type of problem. In particular, the calculation of upper bounds (e.g., in SDDP) is not an issue. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
51 Comments The E-CVaR risk measure The equivalence with a risk-neutral multi-stage problem allows for the use of standard methods developed for that type of problem. In particular, the calculation of upper bounds (e.g., in SDDP) is not an issue. Moreover, the E-CVaR risk measure does not suffer from the lack of structural monotonicity discussed earlier since risk is measured in a stage-wise fashion. Indeed, the solution does not change when we increase s 2. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
52 Numerical illustration A numerical example We consider the Dutch pension fund problem described in Haneveld, Streutker and van der Vlerk (2010). The fund sponsor has to maintain the ratio between assets and liabilities above some pre-specified threshold at every time period. To achieve this goal, three sources of income can be used: Returns from the asset portfolio (stocks, bonds, real estate, cash) Regular contributions made by fund participants Remedial contributions done by the company, which are money injections intended to keep the fund solvent. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
53 Numerical illustration A numerical example We consider the Dutch pension fund problem described in Haneveld, Streutker and van der Vlerk (2010). The fund sponsor has to maintain the ratio between assets and liabilities above some pre-specified threshold at every time period. To achieve this goal, three sources of income can be used: Returns from the asset portfolio (stocks, bonds, real estate, cash) Regular contributions made by fund participants Remedial contributions done by the company, which are money injections intended to keep the fund solvent. The objective function is to minimize the expected value of the sum, for all stages, of remedial contributions and contribution rates for the participants, while keeping the funding ratio above a threshold. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
54 Results Numerical illustration The problem instance has 4 stages; uncertainty (liabilities, contributions, returns) is modeled with a scenario tree with 10 stages per node. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
55 Results Numerical illustration The problem instance has 4 stages; uncertainty (liabilities, contributions, returns) is modeled with a scenario tree with 10 stages per node. We solved the problem using the E-CVaR risk measure; implementation was done in SLP-IOR (Kall and Mayer 1996) using the equivalent risk-neutral formulation. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
56 Results Numerical illustration The problem instance has 4 stages; uncertainty (liabilities, contributions, returns) is modeled with a scenario tree with 10 stages per node. We solved the problem using the E-CVaR risk measure; implementation was done in SLP-IOR (Kall and Mayer 1996) using the equivalent risk-neutral formulation. The table shows the first-stage portfolio allocations, participant contribution rate and remedial contributions. α stock bond real est. cash rate remedial (0,0,0) (0,0,1) (0,1,0) (1,0,0) (1,1,1) (.5,.5,.5) Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
57 Numerical illustration Second-stage variables The graphs show the cdfs of the second-stage variables. 1 Stocks + Real estate 1 Bonds (1,0,0) (1,1,1) (0,0,1) (0,0,0) (1,0,0) (1,1,1) (0,0,1) (0,0,0) x Cash 1 Remedial contribution (1,0,0) (1,1,1) (0,0,1) (0,0,0) (1,0,0) (1,1,1) (0,0,1) (0,0,0) Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
58 Numerical illustration Third-stage variables The graphs show the cdfs of the third-stage variables. 1 Stocks + Real estate 1 Bonds (1,0,0) (1,1,1) (0,0,1) (0,0,0) (1,0,0) (1,1,1) (0,0,1) (0,0,0) x x Cash 1 Remedial contribution (1,0,0) (1,1,1) (0,0,1) (0,0,0) (1,0,0) (1,1,1) (0,0,1) (0,0,0) Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
59 Summary Conclusions While there are multiple ways to incorporate risk into multi-stage stochastic programs, much of the (numerical) literature focuses on nested CVaR formulations. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
60 Summary Conclusions While there are multiple ways to incorporate risk into multi-stage stochastic programs, much of the (numerical) literature focuses on nested CVaR formulations. We have discussed an alternative approach, which we call E-CVaR, that addresses some issues that appear with nested formulations. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
61 Summary Conclusions While there are multiple ways to incorporate risk into multi-stage stochastic programs, much of the (numerical) literature focuses on nested CVaR formulations. We have discussed an alternative approach, which we call E-CVaR, that addresses some issues that appear with nested formulations. An attractive feature of the E-CVaR formulation is that is can be represented as a risk-neutral problem on a lifted space, so standard algorithms can be used. Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
62 Summary Conclusions While there are multiple ways to incorporate risk into multi-stage stochastic programs, much of the (numerical) literature focuses on nested CVaR formulations. We have discussed an alternative approach, which we call E-CVaR, that addresses some issues that appear with nested formulations. An attractive feature of the E-CVaR formulation is that is can be represented as a risk-neutral problem on a lifted space, so standard algorithms can be used. Moreover, since the risk measures are applied in a stage-wise fashion, it is easier to see what is being controlled (e.g., via the value of α t ). Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
63 Acknowledgment Conclusions This research has been supported by Fondecyt project , Chile. THANK YOU! Homem-de-Mello & Pagnoncelli (UAI) Risk-averse multi-stage SP ICSP / 31
Worst-case-expectation approach to optimization under uncertainty
Worst-case-expectation approach to optimization under uncertainty Wajdi Tekaya Joint research with Alexander Shapiro, Murilo Pereira Soares and Joari Paulo da Costa : Cambridge Systems Associates; : Georgia
More informationScenario Generation and Sampling Methods
Scenario Generation and Sampling Methods Güzin Bayraksan Tito Homem-de-Mello SVAN 2016 IMPA May 9th, 2016 Bayraksan (OSU) & Homem-de-Mello (UAI) Scenario Generation and Sampling SVAN IMPA May 9 1 / 30
More informationMultistage risk-averse asset allocation with transaction costs
Multistage risk-averse asset allocation with transaction costs 1 Introduction Václav Kozmík 1 Abstract. This paper deals with asset allocation problems formulated as multistage stochastic programming models.
More informationReport for technical cooperation between Georgia Institute of Technology and ONS - Operador Nacional do Sistema Elétrico Risk Averse Approach
Report for technical cooperation between Georgia Institute of Technology and ONS - Operador Nacional do Sistema Elétrico Risk Averse Approach Alexander Shapiro and Wajdi Tekaya School of Industrial and
More informationOn solving multistage stochastic programs with coherent risk measures
On solving multistage stochastic programs with coherent risk measures Andy Philpott Vitor de Matos y Erlon Finardi z August 13, 2012 Abstract We consider a class of multistage stochastic linear programs
More informationRobust Dual Dynamic Programming
1 / 18 Robust Dual Dynamic Programming Angelos Georghiou, Angelos Tsoukalas, Wolfram Wiesemann American University of Beirut Olayan School of Business 31 May 217 2 / 18 Inspired by SDDP Stochastic optimization
More informationDASC: A DECOMPOSITION ALGORITHM FOR MULTISTAGE STOCHASTIC PROGRAMS WITH STRONGLY CONVEX COST FUNCTIONS
DASC: A DECOMPOSITION ALGORITHM FOR MULTISTAGE STOCHASTIC PROGRAMS WITH STRONGLY CONVEX COST FUNCTIONS Vincent Guigues School of Applied Mathematics, FGV Praia de Botafogo, Rio de Janeiro, Brazil vguigues@fgv.br
More informationMartingale Pricing Theory in Discrete-Time and Discrete-Space Models
IEOR E4707: Foundations of Financial Engineering c 206 by Martin Haugh Martingale Pricing Theory in Discrete-Time and Discrete-Space Models These notes develop the theory of martingale pricing in a discrete-time,
More informationDynamic Risk Management in Electricity Portfolio Optimization via Polyhedral Risk Functionals
Dynamic Risk Management in Electricity Portfolio Optimization via Polyhedral Risk Functionals A. Eichhorn and W. Römisch Humboldt-University Berlin, Department of Mathematics, Germany http://www.math.hu-berlin.de/~romisch
More informationInvestigation of the and minimum storage energy target levels approach. Final Report
Investigation of the AV@R and minimum storage energy target levels approach Final Report First activity of the technical cooperation between Georgia Institute of Technology and ONS - Operador Nacional
More informationAssessing Policy Quality in Multi-stage Stochastic Programming
Assessing Policy Quality in Multi-stage Stochastic Programming Anukal Chiralaksanakul and David P. Morton Graduate Program in Operations Research The University of Texas at Austin Austin, TX 78712 January
More informationStochastic Dual Dynamic Programming
1 / 43 Stochastic Dual Dynamic Programming Operations Research Anthony Papavasiliou 2 / 43 Contents [ 10.4 of BL], [Pereira, 1991] 1 Recalling the Nested L-Shaped Decomposition 2 Drawbacks of Nested Decomposition
More informationApproximation of Continuous-State Scenario Processes in Multi-Stage Stochastic Optimization and its Applications
Approximation of Continuous-State Scenario Processes in Multi-Stage Stochastic Optimization and its Applications Anna Timonina University of Vienna, Abraham Wald PhD Program in Statistics and Operations
More informationApproximations of Stochastic Programs. Scenario Tree Reduction and Construction
Approximations of Stochastic Programs. Scenario Tree Reduction and Construction W. Römisch Humboldt-University Berlin Institute of Mathematics 10099 Berlin, Germany www.mathematik.hu-berlin.de/~romisch
More informationEssays on Some Combinatorial Optimization Problems with Interval Data
Essays on Some Combinatorial Optimization Problems with Interval Data a thesis submitted to the department of industrial engineering and the institute of engineering and sciences of bilkent university
More informationProgressive Hedging for Multi-stage Stochastic Optimization Problems
Progressive Hedging for Multi-stage Stochastic Optimization Problems David L. Woodruff Jean-Paul Watson Graduate School of Management University of California, Davis Davis, CA 95616, USA dlwoodruff@ucdavis.edu
More informationDynamic sampling algorithms for multi-stage stochastic programs with risk aversion
Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion A.B. Philpott y and V.L. de Matos z October 7, 2011 Abstract We consider the incorporation of a time-consistent coherent
More informationHandout 4: Deterministic Systems and the Shortest Path Problem
SEEM 3470: Dynamic Optimization and Applications 2013 14 Second Term Handout 4: Deterministic Systems and the Shortest Path Problem Instructor: Shiqian Ma January 27, 2014 Suggested Reading: Bertsekas
More informationRevenue Management Under the Markov Chain Choice Model
Revenue Management Under the Markov Chain Choice Model Jacob B. Feldman School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853, USA jbf232@cornell.edu Huseyin
More informationOn Integrated Chance Constraints in ALM for Pension Funds
On Integrated Chance Constraints in ALM for Pension Funds Youssouf A. F. Toukourou and François Dufresne March 26, 2015 Abstract We discuss the role of integrated chance constraints (ICC) as quantitative
More informationDynamic Programming: An overview. 1 Preliminaries: The basic principle underlying dynamic programming
Dynamic Programming: An overview These notes summarize some key properties of the Dynamic Programming principle to optimize a function or cost that depends on an interval or stages. This plays a key role
More informationDynamic sampling algorithms for multi-stage stochastic programs with risk aversion
Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion A.B. Philpott y and V.L. de Matos z March 28, 2011 Abstract We consider the incorporation of a time-consistent coherent
More informationA generalized coherent risk measure: The firm s perspective
Finance Research Letters 2 (2005) 23 29 www.elsevier.com/locate/frl A generalized coherent risk measure: The firm s perspective Robert A. Jarrow a,b,, Amiyatosh K. Purnanandam c a Johnson Graduate School
More informationDynamic Replication of Non-Maturing Assets and Liabilities
Dynamic Replication of Non-Maturing Assets and Liabilities Michael Schürle Institute for Operations Research and Computational Finance, University of St. Gallen, Bodanstr. 6, CH-9000 St. Gallen, Switzerland
More informationOptimizing S-shaped utility and risk management
Optimizing S-shaped utility and risk management Ineffectiveness of VaR and ES constraints John Armstrong (KCL), Damiano Brigo (Imperial) Quant Summit March 2018 Are ES constraints effective against rogue
More informationScenario reduction and scenario tree construction for power management problems
Scenario reduction and scenario tree construction for power management problems N. Gröwe-Kuska, H. Heitsch and W. Römisch Humboldt-University Berlin Institute of Mathematics Page 1 of 20 IEEE Bologna POWER
More informationA class of coherent risk measures based on one-sided moments
A class of coherent risk measures based on one-sided moments T. Fischer Darmstadt University of Technology November 11, 2003 Abstract This brief paper explains how to obtain upper boundaries of shortfall
More informationForecast Horizons for Production Planning with Stochastic Demand
Forecast Horizons for Production Planning with Stochastic Demand Alfredo Garcia and Robert L. Smith Department of Industrial and Operations Engineering Universityof Michigan, Ann Arbor MI 48109 December
More informationOptimal Security Liquidation Algorithms
Optimal Security Liquidation Algorithms Sergiy Butenko Department of Industrial Engineering, Texas A&M University, College Station, TX 77843-3131, USA Alexander Golodnikov Glushkov Institute of Cybernetics,
More informationIntroduction to modeling using stochastic programming. Andy Philpott The University of Auckland
Introduction to modeling using stochastic programming Andy Philpott The University of Auckland Tutorial presentation at SPX, Tuscon, October 9th, 2004 Summary Introduction to basic concepts Risk Multi-stage
More informationrisk minimization April 30, 2007
Optimal pension fund management under multi-period risk minimization S. Kilianová G. Pflug April 30, 2007 Corresponding author: Soňa Kilianová Address: Department of Applied Mathematics and Statistics
More informationLecture Notes 1
4.45 Lecture Notes Guido Lorenzoni Fall 2009 A portfolio problem To set the stage, consider a simple nite horizon problem. A risk averse agent can invest in two assets: riskless asset (bond) pays gross
More informationRisk-Averse Decision Making and Control
Marek Petrik University of New Hampshire Mohammad Ghavamzadeh Adobe Research February 4, 2017 Introduction to Risk Averse Modeling Outline Introduction to Risk Averse Modeling (Average) Value at Risk Coherent
More informationYao s Minimax Principle
Complexity of algorithms The complexity of an algorithm is usually measured with respect to the size of the input, where size may for example refer to the length of a binary word describing the input,
More informationMultistage Stochastic Demand-side Management for Price-Making Major Consumers of Electricity in a Co-optimized Energy and Reserve Market
Multistage Stochastic Demand-side Management for Price-Making Major Consumers of Electricity in a Co-optimized Energy and Reserve Market Mahbubeh Habibian Anthony Downward Golbon Zakeri Abstract In this
More informationDRAFT. 1 exercise in state (S, t), π(s, t) = 0 do not exercise in state (S, t) Review of the Risk Neutral Stock Dynamics
Chapter 12 American Put Option Recall that the American option has strike K and maturity T and gives the holder the right to exercise at any time in [0, T ]. The American option is not straightforward
More informationOptimal Investment for Worst-Case Crash Scenarios
Optimal Investment for Worst-Case Crash Scenarios A Martingale Approach Frank Thomas Seifried Department of Mathematics, University of Kaiserslautern June 23, 2010 (Bachelier 2010) Worst-Case Portfolio
More informationOptimal prepayment of Dutch mortgages*
137 Statistica Neerlandica (2007) Vol. 61, nr. 1, pp. 137 155 Optimal prepayment of Dutch mortgages* Bart H. M. Kuijpers ABP Investments, P.O. Box 75753, NL-1118 ZX Schiphol, The Netherlands Peter C. Schotman
More informationApproximate Revenue Maximization with Multiple Items
Approximate Revenue Maximization with Multiple Items Nir Shabbat - 05305311 December 5, 2012 Introduction The paper I read is called Approximate Revenue Maximization with Multiple Items by Sergiu Hart
More informationStochastic Dual Dynamic Programming Algorithm for Multistage Stochastic Programming
Stochastic Dual Dynamic Programg Algorithm for Multistage Stochastic Programg Final presentation ISyE 8813 Fall 2011 Guido Lagos Wajdi Tekaya Georgia Institute of Technology November 30, 2011 Multistage
More informationDynamic Portfolio Choice II
Dynamic Portfolio Choice II Dynamic Programming Leonid Kogan MIT, Sloan 15.450, Fall 2010 c Leonid Kogan ( MIT, Sloan ) Dynamic Portfolio Choice II 15.450, Fall 2010 1 / 35 Outline 1 Introduction to Dynamic
More informationOnline Appendix: Extensions
B Online Appendix: Extensions In this online appendix we demonstrate that many important variations of the exact cost-basis LUL framework remain tractable. In particular, dual problem instances corresponding
More informationElif Özge Özdamar T Reinforcement Learning - Theory and Applications February 14, 2006
On the convergence of Q-learning Elif Özge Özdamar elif.ozdamar@helsinki.fi T-61.6020 Reinforcement Learning - Theory and Applications February 14, 2006 the covergence of stochastic iterative algorithms
More informationApproximation Algorithms for Stochastic Inventory Control Models
Approximation Algorithms for Stochastic Inventory Control Models Retsef Levi Martin Pal Robin Roundy David B. Shmoys Abstract We consider stochastic control inventory models in which the goal is to coordinate
More informationAn Approximation Algorithm for Capacity Allocation over a Single Flight Leg with Fare-Locking
An Approximation Algorithm for Capacity Allocation over a Single Flight Leg with Fare-Locking Mika Sumida School of Operations Research and Information Engineering, Cornell University, Ithaca, New York
More informationMULTISTAGE PORTFOLIO OPTIMIZATION AS A STOCHASTIC OPTIMAL CONTROL PROBLEM
K Y B E R N E T I K A M A N U S C R I P T P R E V I E W MULTISTAGE PORTFOLIO OPTIMIZATION AS A STOCHASTIC OPTIMAL CONTROL PROBLEM Martin Lauko Each portfolio optimization problem is a trade off between
More informationGAME THEORY. Department of Economics, MIT, Follow Muhamet s slides. We need the following result for future reference.
14.126 GAME THEORY MIHAI MANEA Department of Economics, MIT, 1. Existence and Continuity of Nash Equilibria Follow Muhamet s slides. We need the following result for future reference. Theorem 1. Suppose
More informationDynamic Asset and Liability Management Models for Pension Systems
Dynamic Asset and Liability Management Models for Pension Systems The Comparison between Multi-period Stochastic Programming Model and Stochastic Control Model Muneki Kawaguchi and Norio Hibiki June 1,
More informationLecture 7: Bayesian approach to MAB - Gittins index
Advanced Topics in Machine Learning and Algorithmic Game Theory Lecture 7: Bayesian approach to MAB - Gittins index Lecturer: Yishay Mansour Scribe: Mariano Schain 7.1 Introduction In the Bayesian approach
More informationCasino gambling problem under probability weighting
Casino gambling problem under probability weighting Sang Hu National University of Singapore Mathematical Finance Colloquium University of Southern California Jan 25, 2016 Based on joint work with Xue
More informationOptimal energy management and stochastic decomposition
Optimal energy management and stochastic decomposition F. Pacaud P. Carpentier J.P. Chancelier M. De Lara JuMP-dev workshop, 2018 ENPC ParisTech ENSTA ParisTech Efficacity 1/23 Motivation We consider a
More informationLecture 10: The knapsack problem
Optimization Methods in Finance (EPFL, Fall 2010) Lecture 10: The knapsack problem 24.11.2010 Lecturer: Prof. Friedrich Eisenbrand Scribe: Anu Harjula The knapsack problem The Knapsack problem is a problem
More informationEE365: Risk Averse Control
EE365: Risk Averse Control Risk averse optimization Exponential risk aversion Risk averse control 1 Outline Risk averse optimization Exponential risk aversion Risk averse control Risk averse optimization
More informationRegime-dependent robust risk measures with application in portfolio selection
Regime-dependent robust risk measures Regime-dependent robust risk measures with application in portfolio selection, P.R.China TEL:86-29-82663741, E-mail: zchen@mail.xjtu.edu.cn (Joint work with Jia Liu)
More informationOn the Lower Arbitrage Bound of American Contingent Claims
On the Lower Arbitrage Bound of American Contingent Claims Beatrice Acciaio Gregor Svindland December 2011 Abstract We prove that in a discrete-time market model the lower arbitrage bound of an American
More informationDynamic tax depreciation strategies
OR Spectrum (2011) 33:419 444 DOI 10.1007/s00291-010-0214-3 REGULAR ARTICLE Dynamic tax depreciation strategies Anja De Waegenaere Jacco L. Wielhouwer Published online: 22 May 2010 The Author(s) 2010.
More informationOptimal liquidation with market parameter shift: a forward approach
Optimal liquidation with market parameter shift: a forward approach (with S. Nadtochiy and T. Zariphopoulou) Haoran Wang Ph.D. candidate University of Texas at Austin ICERM June, 2017 Problem Setup and
More informationOptimization Models in Financial Mathematics
Optimization Models in Financial Mathematics John R. Birge Northwestern University www.iems.northwestern.edu/~jrbirge Illinois Section MAA, April 3, 2004 1 Introduction Trends in financial mathematics
More informationStochastic Dynamic Programming Using Optimal Quantizers
Annals of Operations Research 0 (2017)?? 1 Stochastic Dynamic Programming Using Optimal Quantizers Anna Timonina-Farkas École Polytechnique Fédérale de Lausanne, Risk, Analytics and Optimization Chair
More informationAsset-Liability Management
Asset-Liability Management John Birge University of Chicago Booth School of Business JRBirge INFORMS San Francisco, Nov. 2014 1 Overview Portfolio optimization involves: Modeling Optimization Estimation
More informationLog-Robust Portfolio Management
Log-Robust Portfolio Management Dr. Aurélie Thiele Lehigh University Joint work with Elcin Cetinkaya and Ban Kawas Research partially supported by the National Science Foundation Grant CMMI-0757983 Dr.
More informationLarge-Scale SVM Optimization: Taking a Machine Learning Perspective
Large-Scale SVM Optimization: Taking a Machine Learning Perspective Shai Shalev-Shwartz Toyota Technological Institute at Chicago Joint work with Nati Srebro Talk at NEC Labs, Princeton, August, 2008 Shai
More informationScenario Generation for Stochastic Programming Introduction and selected methods
Michal Kaut Scenario Generation for Stochastic Programming Introduction and selected methods SINTEF Technology and Society September 2011 Scenario Generation for Stochastic Programming 1 Outline Introduction
More informationIEOR E4602: Quantitative Risk Management
IEOR E4602: Quantitative Risk Management Basic Concepts and Techniques of Risk Management Martin Haugh Department of Industrial Engineering and Operations Research Columbia University Email: martin.b.haugh@gmail.com
More informationWorst-Case Value-at-Risk of Non-Linear Portfolios
Worst-Case Value-at-Risk of Non-Linear Portfolios Steve Zymler Daniel Kuhn Berç Rustem Department of Computing Imperial College London Portfolio Optimization Consider a market consisting of m assets. Optimal
More informationHandout 8: Introduction to Stochastic Dynamic Programming. 2 Examples of Stochastic Dynamic Programming Problems
SEEM 3470: Dynamic Optimization and Applications 2013 14 Second Term Handout 8: Introduction to Stochastic Dynamic Programming Instructor: Shiqian Ma March 10, 2014 Suggested Reading: Chapter 1 of Bertsekas,
More informationSocially-Optimal Design of Crowdsourcing Platforms with Reputation Update Errors
Socially-Optimal Design of Crowdsourcing Platforms with Reputation Update Errors 1 Yuanzhang Xiao, Yu Zhang, and Mihaela van der Schaar Abstract Crowdsourcing systems (e.g. Yahoo! Answers and Amazon Mechanical
More informationPrudence, risk measures and the Optimized Certainty Equivalent: a note
Working Paper Series Department of Economics University of Verona Prudence, risk measures and the Optimized Certainty Equivalent: a note Louis Raymond Eeckhoudt, Elisa Pagani, Emanuela Rosazza Gianin WP
More informationPayment mechanisms and risk-aversion in electricity markets with uncertain supply
Payment mechanisms and risk-aversion in electricity markets with uncertain supply Ryan Cory-Wright Joint work with Golbon Zakeri (thanks to Andy Philpott) ISMP, Bordeaux, July 2018. ORC, Massachusetts
More informationDynamic Pricing and Inventory Management under Fluctuating Procurement Costs
1 Dynamic Pricing and Inventory Management under Fluctuating Procurement Costs Philip (Renyu) Zhang (Joint work with Guang Xiao and Nan Yang) Olin Business School Washington University in St. Louis June
More informationWorst-Case Value-at-Risk of Derivative Portfolios
Worst-Case Value-at-Risk of Derivative Portfolios Steve Zymler Berç Rustem Daniel Kuhn Department of Computing Imperial College London Thalesians Seminar Series, November 2009 Risk Management is a Hot
More informationTangent Lévy Models. Sergey Nadtochiy (joint work with René Carmona) Oxford-Man Institute of Quantitative Finance University of Oxford.
Tangent Lévy Models Sergey Nadtochiy (joint work with René Carmona) Oxford-Man Institute of Quantitative Finance University of Oxford June 24, 2010 6th World Congress of the Bachelier Finance Society Sergey
More informationThe value of foresight
Philip Ernst Department of Statistics, Rice University Support from NSF-DMS-1811936 (co-pi F. Viens) and ONR-N00014-18-1-2192 gratefully acknowledged. IMA Financial and Economic Applications June 11, 2018
More information4 Martingales in Discrete-Time
4 Martingales in Discrete-Time Suppose that (Ω, F, P is a probability space. Definition 4.1. A sequence F = {F n, n = 0, 1,...} is called a filtration if each F n is a sub-σ-algebra of F, and F n F n+1
More informationSpot and forward dynamic utilities. and their associated pricing systems. Thaleia Zariphopoulou. UT, Austin
Spot and forward dynamic utilities and their associated pricing systems Thaleia Zariphopoulou UT, Austin 1 Joint work with Marek Musiela (BNP Paribas, London) References A valuation algorithm for indifference
More informationFinancial Optimization ISE 347/447. Lecture 15. Dr. Ted Ralphs
Financial Optimization ISE 347/447 Lecture 15 Dr. Ted Ralphs ISE 347/447 Lecture 15 1 Reading for This Lecture C&T Chapter 12 ISE 347/447 Lecture 15 2 Stock Market Indices A stock market index is a statistic
More informationScenario-Based Value-at-Risk Optimization
Scenario-Based Value-at-Risk Optimization Oleksandr Romanko Quantitative Research Group, Algorithmics Incorporated, an IBM Company Joint work with Helmut Mausser Fields Industrial Optimization Seminar
More informationAssortment Planning under the Multinomial Logit Model with Totally Unimodular Constraint Structures
Assortment Planning under the Multinomial Logit Model with Totally Unimodular Constraint Structures James Davis School of Operations Research and Information Engineering, Cornell University, Ithaca, New
More informationConditional Value-at-Risk: Theory and Applications
The School of Mathematics Conditional Value-at-Risk: Theory and Applications by Jakob Kisiala s1301096 Dissertation Presented for the Degree of MSc in Operational Research August 2015 Supervised by Dr
More informationChapter 15: Jump Processes and Incomplete Markets. 1 Jumps as One Explanation of Incomplete Markets
Chapter 5: Jump Processes and Incomplete Markets Jumps as One Explanation of Incomplete Markets It is easy to argue that Brownian motion paths cannot model actual stock price movements properly in reality,
More informationThe optimal harvesting problem under risk aversion
The optimal harvesting problem under risk aversion Bernardo K. Pagnoncelli Adriana Piazza April 3, 202 Abstract We study the exploitation of a one species forest plantation when timber price is uncertain.
More informationDynamic - Cash Flow Based - Inventory Management
INFORMS Applied Probability Society Conference 2013 -Costa Rica Meeting Dynamic - Cash Flow Based - Inventory Management Michael N. Katehakis Rutgers University July 15, 2013 Talk based on joint work with
More informationAllocation of Risk Capital via Intra-Firm Trading
Allocation of Risk Capital via Intra-Firm Trading Sean Hilden Department of Mathematical Sciences Carnegie Mellon University December 5, 2005 References 1. Artzner, Delbaen, Eber, Heath: Coherent Measures
More informationDM559/DM545 Linear and integer programming
Department of Mathematics and Computer Science University of Southern Denmark, Odense May 22, 2018 Marco Chiarandini DM559/DM55 Linear and integer programming Sheet, Spring 2018 [pdf format] Contains Solutions!
More informationInteger Programming Models
Integer Programming Models Fabio Furini December 10, 2014 Integer Programming Models 1 Outline 1 Combinatorial Auctions 2 The Lockbox Problem 3 Constructing an Index Fund Integer Programming Models 2 Integer
More informationEnergy Systems under Uncertainty: Modeling and Computations
Energy Systems under Uncertainty: Modeling and Computations W. Römisch Humboldt-University Berlin Department of Mathematics www.math.hu-berlin.de/~romisch Systems Analysis 2015, November 11 13, IIASA (Laxenburg,
More informationArbitrage Conditions for Electricity Markets with Production and Storage
SWM ORCOS Arbitrage Conditions for Electricity Markets with Production and Storage Raimund Kovacevic Research Report 2018-03 March 2018 ISSN 2521-313X Operations Research and Control Systems Institute
More information6.231 DYNAMIC PROGRAMMING LECTURE 3 LECTURE OUTLINE
6.21 DYNAMIC PROGRAMMING LECTURE LECTURE OUTLINE Deterministic finite-state DP problems Backward shortest path algorithm Forward shortest path algorithm Shortest path examples Alternative shortest path
More informationUtility Indifference Pricing and Dynamic Programming Algorithm
Chapter 8 Utility Indifference ricing and Dynamic rogramming Algorithm In the Black-Scholes framework, we can perfectly replicate an option s payoff. However, it may not be true beyond the Black-Scholes
More informationOn Complexity of Multistage Stochastic Programs
On Complexity of Multistage Stochastic Programs Alexander Shapiro School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205, USA e-mail: ashapiro@isye.gatech.edu
More informationPortfolio Optimization with Alternative Risk Measures
Portfolio Optimization with Alternative Risk Measures Prof. Daniel P. Palomar The Hong Kong University of Science and Technology (HKUST) MAFS6010R- Portfolio Optimization with R MSc in Financial Mathematics
More informationUniversity of Groningen
University of Groningen Asset liability management modeling using multi-stage mixed-integer stochastic programming Drijver, S.J.; Klein Haneveld, W.K.; van der Vlerk, Maarten H. IMPORTANT NOTE: You are
More informationBounding Optimal Expected Revenues for Assortment Optimization under Mixtures of Multinomial Logits
Bounding Optimal Expected Revenues for Assortment Optimization under Mixtures of Multinomial Logits Jacob Feldman School of Operations Research and Information Engineering, Cornell University, Ithaca,
More informationIEOR E4602: Quantitative Risk Management
IEOR E4602: Quantitative Risk Management Risk Measures Martin Haugh Department of Industrial Engineering and Operations Research Columbia University Email: martin.b.haugh@gmail.com Reference: Chapter 8
More informationQuantitative Risk Management
Quantitative Risk Management Asset Allocation and Risk Management Martin B. Haugh Department of Industrial Engineering and Operations Research Columbia University Outline Review of Mean-Variance Analysis
More informationApplications of Linear Programming
Applications of Linear Programming lecturer: András London University of Szeged Institute of Informatics Department of Computational Optimization Lecture 8 The portfolio selection problem The portfolio
More informationWhy Bankers Should Learn Convex Analysis
Jim Zhu Western Michigan University Kalamazoo, Michigan, USA March 3, 2011 A tale of two financial economists Edward O. Thorp and Myron Scholes Influential works: Beat the Dealer(1962) and Beat the Market(1967)
More informationAll Investors are Risk-averse Expected Utility Maximizers. Carole Bernard (UW), Jit Seng Chen (GGY) and Steven Vanduffel (Vrije Universiteit Brussel)
All Investors are Risk-averse Expected Utility Maximizers Carole Bernard (UW), Jit Seng Chen (GGY) and Steven Vanduffel (Vrije Universiteit Brussel) First Name: Waterloo, April 2013. Last Name: UW ID #:
More informationProblem Set 2: Answers
Economics 623 J.R.Walker Page 1 Problem Set 2: Answers The problem set came from Michael A. Trick, Senior Associate Dean, Education and Professor Tepper School of Business, Carnegie Mellon University.
More information( 0) ,...,S N ,S 2 ( 0)... S N S 2. N and a portfolio is created that way, the value of the portfolio at time 0 is: (0) N S N ( 1, ) +...
No-Arbitrage Pricing Theory Single-Period odel There are N securities denoted ( S,S,...,S N ), they can be stocks, bonds, or any securities, we assume they are all traded, and have prices available. Ω
More information