|VaR vs Probability Constraints||Probability of Exceedance (Pr_pen), VaR (Var_risk)|| This case study demonstrates the equivalence of chance constraints and Value-at-Risk (VaR) constraints.
, i.e., the constraint assuring that the probability that loss exceeding w is less or equal than 1-
is equivalent to the constraint that VaR (percentile) with confidence level
is less or equal than w.
We solved two portfolio optimization problems. In both cases we maximized the estimated return of a portfolio. In the first problem, we imposed a constraint on probability; in the second problem, we impose an equivalent constraint on VaR. For the two problems we obtained at optimality the same objective values and similar optimal portfolios.
|VaR vs Difference of CVaRs Minimization||VaR (Var_risk), CVaR (Cvar_risk), Linear (linear)||This case study numerically compares two algorithms for VaR minimization:
Problem 1: VaR is minimized using standard VaR function in PSG.
Problem 2: Difference of CVaRs is minimized using standard CVaR functions in PSG. The optimal solution of Problem 2 is close to the solution of Problem 1.
|Stochastic Utility Problem||Average Max Risk (Avg_max_risk), Partial Moment Penalty Normal Independent(Pm_pen_ni)||This case study solves Stochastic Utility (or Expected Utility) Problem which is approximated by sampling stochastic parameters of this problem (Sampling Average Approximation approach). The problem formulation and data are based on dataset which is considered in Nemirovski et al. (2009). The optimization problem is solved in approximation format with scenarios (PROBLEM 1: problem_utility) and in the format using normally distributed random variables (PROBLEM 2: problem_utility_exact). The Case Study presents four solved problem instances with 500, 1000, 2000, 5000 variables.|
|Stochastic Two Stage Linear Problem||Average for Recourse (Avg(Recourse))||POSTS (a portable stochastic programming test set) gives a set of multi-stage linear stochastic programming problems with discrete scenarios for testing algorithms, Derek et al. (1995). Every problem has several sets of scenarios. Problems posted at the POSTS website are general linear stochastic programming in SMPS format. We have selected several two-stage problems at POSTS website. For selected problems we converted data to PSG format and solved these problems in PSG RunFile environment. Two-stage problems were formulated using PSG Average function applied to Recourse function.|
|Supply Chain Two Stage Planning Problem||Average for Recourse (Avg(Recourse))||A supply chain design problem is modeled as a sequence of splitting and combining processes. The problem is formulated as a two-stage stochastic program. The first-stage decisions are strategic location decisions, whereas the second stage consists of operational decisions. The objective is to maximize the expected profits over the planning horizon.|