DA Stochastic Dynamic Programming, Stochastic Dynamic Distance Optimal Partitioning Problems and Partitions-Requirements-Matrices

Name: DA Stochastic Dynamic Programming, Stochastic Dynamic Distance Optimal Partitioning Problems and Partitions-Requirements-Matrices
Brand: Cuvillier Verlag
SKU: 9783869556086
Price: 16551 HUF
Availability: InStock

Szerző: Regina Hildenbrandt

Nyelv:

Kötés: Puha kötésű

Kiadó: Cuvillier Verlag

Elérhetőség: Beszállítói készleten

Küldés 8-11 napon belül

16 551 Ft

This book consists of, apart from the introduction, the chapters -DA Stochastic Dynamic Programming...

Információk a könyvről

Szerző

Regina Hildenbrandt

Nyelv

Angol

Kötés

Könyv - Puha kötésű

Kiadva

2011

oldal

304

EAN

9783869556086

ISBN

3869556080

Enbook ID

13414661

Kiadó

Cuvillier Verlag

Súly

396

Méretek

148 x 210 x 16

Teljes leírás

This book consists of, apart from the introduction, the chapters -DA Stochastic Dynamic Programming with Random Disturbances, -The Problem of Stochastic Dynamic Distance Optimal Partitioning (SDDP problem), -Partitions-Requirements-Matrices (PRMs). DA ("decision after") stochastic dynamic programming with random disturbances" is characterized by the fact that these random disturbances are observed before the decision is made at each stage. In the past, only very moderate attention was given to problems with this characteristic. In Chapter 2 specific properties of DA stochastic dynamic programming problems are worked out for theoretical characterization and for more efficient solution strategies of such problems. The (DA) Stochastic Dynamic Distance Optimal Partitioning problem (SDDP problem) is an extremely complex Operations Research problem. It shows several connections with other problems of operations research and informatics such as stochastic dynamic transportation and facility location problems or metric task systems and more specific k-server problems. Partitions of integers as states of SDDP problems require an enormous amount of storage space for the corresponding computer programs. Investigations of inherent characteristic structures of SDDP problems are also important as a basis for heuristics. Partitions-requirements-matrices (PRMs) (Chapter 4) are matrices of transition probabilities of SDDP problems which are formulated as Markov decision processes. PRMs "in the strict meaning" include optimal decisions of certain reduced SDDP problems, as is shown (in many cases) toward the end of the book. PRMs (in the strict meaning) themselves represent interesting (almost selfevident) combinatorial structures, which are not otherwise found in literature. In order to understand the investigations of this book, previous knowledge about stochastic dynamic Programming and Markov decision processes is useful, however not absolutely necessary since the concerned models are developed from scratch.

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

DA Stochastic Dynamic Programming, Stochastic Dynamic Distance Optimal Partitioning Problems and Partitions-Requirements-Matrices

Információk a könyvről

Teljes leírás

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták