National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Nonconvex stochastic programming problems-formulations, sample approximations and stability
Branda, Martin ; Lachout, Petr (advisor) ; Kaňková, Vlasta (referee) ; H.van der Vlerk, Maarten (referee)
Title: Nonconvex stochastic programming problems - formulations, sample approximations and stability Author: RNDr. Martin Branda Author's e-mail address: Supervisor: Doc. RNDr. Petr Lachout, CSc. Supervisor's e-mail address: Abstract: We deal with problems where integer variables may appear, hence no assumptions on convexity are made throughout this thesis. The goal of Chapter 2 is to introduce stochastic programming problems and to outline the most important tasks connected with solving the problems. In Chapter 3, we compare basic formulations of static stochastic programming problems with chance constraints, with integrated chance constraints and with penalties in the objective function. We show that the problems are asymptotically equivalent under mild conditions. We discuss solving the problems using sample approximation techniques and extend some results on rates of convergence. All the formulations and corresponding sample approximations are compared on an investment problem with real features with Value at Risk constraint, integer allocations and transaction costs. Then, stability of financial decision models where two-stage mixed-integer value function appears as a loss variable is studied. In Chapter 4, we study qualitative properties of the...

Interested in being notified about new results for this query?
Subscribe to the RSS feed.