|
|
New Trends in Stochastic Programming
Szabados, Viktor ; Kaňková, Vlasta (advisor) ; Lachout, Petr (referee)
Stochastic methods are present in our daily lives, especially when we need to make a decision based on uncertain events. In this thesis, we present basic approaches used in stochastic tasks. In the first chapter, we define the stochastic problem and introduce basic methods and tasks which are present in the literature. In the second chapter, we present various problems which are non-linearly dependent on the probability measure. Moreover, we introduce deterministic and non-deterministic multicriteria tasks. In the third chapter, we give an insight on the concept of stochastic dominance and we describe the methods that are used in tasks with multidimensional stochastic dominance. In the fourth chapter, we capitalize on the knowledge from chapters two and three and we try to solve the role of portfolio optimization on real data using different approaches. 1
|
|
|
Problems of Stochastic Optimisation under Uncertainty, Quantitative Methods, Simulations, Applications in Gas Storage Valuation
Omelčenko, Vadim ; Kaňková, Vlasta (advisor) ; Ortobelli, Sergio (referee) ; Popela, Pavel (referee)
This dissertation deals with heavy-tailed distributions and the problematics of stochastic dominance for stable distributions. In terms of stochastic dominance in the setup of stable distributions, we prove novel results which are mostly based on the domain of attraction of stable distributions. We introduce a bivariate sub-family of stable distributions, which can easily be simulated and used for the joint modelling of dependent data (such as spot and forward prices). The marginals of these bivariate distributions are stable and can have a different tail index. We also present our approach for parameter estimation of stable distributions. The theoretical results achieved are used for the valuation of gas storage units. In this part of the dissertation, we use stochastic dynamic programming to address this problem, and we present several algorithms.
|
|
|
Scenario generation for multidimensional distributions
Olos, Marek ; Dupačová, Jitka (advisor) ; Kaňková, Vlasta (referee)
Some methods for generating scenarios from multidimensional distribution assume we are able to generate scenarios from the one-dimensional distribution. We dedicate chapter 3 to this problem. At the end of the chapter, we provide references for applicable algorithms. Chapter 4 is focused on selected methods for generating scenarios from multidimensional distributions. In chapter 4.3, we introduce an algorithm for generating scenarios, which do not use any assumption about the distribution, except the first four moments and correlations to be specified. A method of generating scenarios based on approximation of multivariate normal distribution by the binomial distribution is described in chapter 4.5. Dimension reduction technique using principal components is presented in chapter 4.4. The algorithm is presented under the assumption of normal distribution. In chapter 4.6, we introduce the basics of the copula theory and a method for generating scenarios by C-vine copula. In chapter 5, we implement selected methods for generating scenarios for the estimation of daily value at risk for selected indexes and we discuss the results. Powered by TCPDF (www.tcpdf.org)
|
|
|
Empiciral Estimates in Stochastic Programming; Dependent Data
Kolafa, Ondřej ; Kaňková, Vlasta (advisor) ; Dupačová, Jitka (referee)
This thesis concentrates on stochastic programming problems based on empirical and theoretical distributions and their relationship. Firstly, it focuses on the case where the empirical distribution is an independent random sample. The basic properties are shown followed by the convergence between the problem based on the empirical distribution and the same problem applied to the theoretical distribution. The thesis continues with an overview of some types of dependence - m-dependence, mixing, and also more general weak dependence. For sequences with some of these types of dependence, properties are shown to be similar to those holding for independent sequences. In the last section, the theory is demonstrated using numerical examples, and dependent and independent sequences, including sequences with different types of dependence, are compared.
|
|
|
Multistage Stochastic Programming Problems - Decomposition
Lapšanská, Alica ; Kaňková, Vlasta (advisor) ; Lachout, Petr (referee)
The thesis deals with a multistage stochastic model and its application to a number of practical problems. Special attention is devoted to the case where a random element follows an autoregressive sequence and the constraint sets correspond to the individual probability constraints. For this case conditions under which is the problem well-defined are specified. Further, the approximation of the problem and its convergence rate under the empirical estimate of the distribution function is analyzed. Finally, an example of the investment in financial instruments is solved, which is defined as a two-stage stochastic programming problem with the probability constraint and a random element following an autoregressive sequence. Powered by TCPDF (www.tcpdf.org)
|
|
|
Multi-Stage Stochastic Programming with CVaR: Modeling, Algorithms and Robustness
Kozmík, Václav ; Dupačová, Jitka (advisor) ; Morton, David (referee) ; Kaňková, Vlasta (referee)
Multi-Stage Stochastic Programming with CVaR: Modeling, Algorithms and Robustness RNDr. Václav Kozmík Abstract: We formulate a multi-stage stochastic linear program with three different risk measures based on CVaR and discuss their properties, such as time consistency. The stochastic dual dynamic programming algorithm is described and its draw- backs in the risk-averse setting are demonstrated. We present a new approach to evaluating policies in multi-stage risk-averse programs, which aims to elimi- nate the biggest drawback - lack of a reasonable upper bound estimator. Our approach is based on an importance sampling scheme, which is thoroughly ana- lyzed. A general variance reduction scheme for mean-risk sampling with CVaR is provided. In order to evaluate robustness of the presented models we extend con- tamination technique to the case of large-scale programs, where a precise solution cannot be obtained. Our computational results are based on a simple multi-stage asset allocation model and confirm usefulness of the presented procedures, as well as give additional insights into the behavior of more complex models. Keywords: Multi-stage stochastic programming, stochastic dual dynamic programming, im- portance sampling, contamination, CVaR
|
|
|
Decision Problems and Empirical Data; Applications to New Types of Problems
Odintsov, Kirill ; Kaňková, Vlasta (advisor) ; Lachout, Petr (referee)
This thesis concentrates on different approaches of solving decision making problems with an aspect of randomness. The basic methodologies of converting stochastic optimization problems to deterministic optimization problems are described. The proximity of solution of a problem and its empirical counterpart is shown. The empirical counterpart is used when we don't know the distribution of the random elements of the former problem. The distribution with heavy tails, stable distribution and their relationship is described. The stochastic dominance and the possibility of defining problems with stochastic dominance is introduced. The proximity of solution of problem with second order stochastic dominance and the solution of its empirical counterpart is proven. A portfolio management problem with second order stochastic dominance is solved by solving the equivalent empirical problem. Powered by TCPDF (www.tcpdf.org)
|
|
|
Penalizační metody ve stochastické optimalizaci
Kálosi, Szilárd ; Branda, Martin (advisor) ; Kaňková, Vlasta (referee)
The submitted thesis studies penalty function methods for stochastic programming problems. The main objective of the paper is to examine penalty function methods for deterministic nonlinear programming, in particular exact penalty function methods, in order to enhance penalty function methods for stochastic programming. For this purpose, the equivalence of the original de- terministic nonlinear and the corresponding penalty function problem using arbi- trary vector norm as the penalty function is shown for convex and invex functions occurring in the problems, respectively. The obtained theorems are consequently applied to multiple chance constrained problems under finite discrete probability distribution to show the asymptotic equivalence of the probabilistic and the cor- responding penalty function problems. The practical use of the newly obtained methods is demonstrated on a numerical study, in which a comparison with other approaches is provided as well. 1
|
|
|
Stochastic Programming Problems via Economic Problems
Kučera, Tomáš ; Kaňková, Vlasta (advisor) ; Dupačová, Jitka (referee)
This thesis' topic is stochastic programming, in particular with regard to portfolio optimization and heavy tailed data. The first part of the thesis mentions the most common types of problems associated with stochastic programming. The second part focuses on solving the stochastic programming problems via the SAA method, especially on the condition of data with heavy tailed distributions. In the final part, the theory is applied to the portfolio optimization problem and the thesis concludes with a numerical study programmed in R based on data collected from Google Finance.
|
|
|
Stochastic activity networks
Sůva, Pavel ; Dupačová, Jitka (advisor) ; Kaňková, Vlasta (referee)
In the present work, stochastic network models representing a project as a set of activities are studied, as well as different approaches to these models. The critical path method, stochastic network models with probability constraints, finding a reference project duration, worst-case analysis in stochastic networks and optimization of the parameters of the probability distributions of the activity durations are studied. Use of stochastic network models in telecommunications networks is also briefly presented. In a numerical study, some of these models are implemented and the~related numerical results are analyzed.
|
guest ::
RSS feed.