Jak nakupovat
Doručení
Nákupní rádce
Algorithm for Linear Stochastic Bilevel Problems
Angličtina
121 b
30 dní na vrácení zboží
Mohlo by vás také zajímat
Linear stochastic bilevel problems -although explained quickly- pose some difficulties when it comes to solving, even without the stochasticity. The aim of this work is to find a technique that allows for the use of decomposition methods known from stochastic programming in the framework of linear stochastic bilevel problems. The uncertainty is modeled as a discrete, finite distribution on some probability space. Two approaches are made, one using the optimal value function of the lower level, whereas the second technique utilizes the Karush-Kuhn-Tucker conditions of the lower level. Using the latter approach, an integer-programming based algorithm for the global resolution of these problems is presented and evaluated.
Informace o knize
Angličtina
Kategorie
