Algorithm for Linear Stochastic Bilevel Problems / Najlacnejšie knihy
Algorithm for Linear Stochastic Bilevel Problems

Code: 02844977

Algorithm for Linear Stochastic Bilevel Problems

by Henkel Charlotte

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 ... more

34.69

RRP: 40.68 €

You save 5.99 €


In stock at our supplier
Shipping in 8 - 11 days
Add to wishlist

You might also like

Give this book as a present today
  1. Order book and choose Gift Order.
  2. We will send you book gift voucher at once. You can give it out to anyone.
  3. Book will be send to donee, nothing more to care about.

Book gift voucher sampleRead more

More about Algorithm for Linear Stochastic Bilevel Problems

You get 84 loyalty points

Book synopsis

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.

Book details

Book category Books in English Mathematics & science Mathematics

34.69

Trending among others



Collection points Bratislava a 12799 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies


Account: Log in
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Shopping cart ( Empty )

For free shipping
shop for 59,99 € and more

You are here: