Koha online

Your cart is empty.
Normal view MARC view ISBD view

Stability, Approximation, and Decomposition in Two- and Multistage Stochastic Programming [electronic resource] /by Christian Küchler.

by Küchler, Christian [author.]; SpringerLink (Online service).
Material type: materialTypeLabelBookPublisher: Wiesbaden : Vieweg+Teubner, 2009.Description: 184p. 49 illus. online resource.ISBN: 9783834893994.Subject(s): Mathematics | Mathematics | Mathematics, generalDDC classification: 510 Online resources: Click here to access online
Contents:
Stability of Multistage Stochastic Programs -- Recombining Trees for Multistage Stochastic Programs -- Scenario Reduction with Respect to Discrepancy Distances.
In: Springer eBooksSummary: Stochastic programming provides a framework for modelling, analyzing, and solving optimization problems with some parameters being not known up to a probability distribution. Such problems arise in a variety of applications, such as inventory control, financial planning and portfolio optimization, airline revenue management, scheduling and operation of power systems, and supply chain management. Christian Küchler studies various aspects of the stability of stochastic optimization problems as well as approximation and decomposition methods in stochastic programming. In particular, the author presents an extension of the Nested Benders decomposition algorithm related to the concept of recombining scenario trees. The approach combines the concept of cut sharing with a specific aggregation procedure and prevents an exponentially growing number of subproblem evaluations. Convergence results and numerical properties are discussed.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)

Stability of Multistage Stochastic Programs -- Recombining Trees for Multistage Stochastic Programs -- Scenario Reduction with Respect to Discrepancy Distances.

Stochastic programming provides a framework for modelling, analyzing, and solving optimization problems with some parameters being not known up to a probability distribution. Such problems arise in a variety of applications, such as inventory control, financial planning and portfolio optimization, airline revenue management, scheduling and operation of power systems, and supply chain management. Christian Küchler studies various aspects of the stability of stochastic optimization problems as well as approximation and decomposition methods in stochastic programming. In particular, the author presents an extension of the Nested Benders decomposition algorithm related to the concept of recombining scenario trees. The approach combines the concept of cut sharing with a specific aggregation procedure and prevents an exponentially growing number of subproblem evaluations. Convergence results and numerical properties are discussed.

There are no comments for this item.

Log in to your account to post a comment.
@ Jomo Kenyatta University Of Agriculture and Technology Library

Powered by Koha