Stochastic Linear Programming Algorithms
A Comparison Based on a Model Management System
Seiten
1998
Taylor & Francis Ltd (Verlag)
978-90-5699-144-9 (ISBN)
Taylor & Francis Ltd (Verlag)
978-90-5699-144-9 (ISBN)
A computationally oriented comparison of solution algorithms for two stage and jointly chance constrained stochastic linear programming problems, this resource presents comparative computational results with several major stochastic programming solution approaches.
A computationally oriented comparison of solution algorithms for two stage and jointly chance constrained stochastic linear programming problems, this is the first book to present comparative computational results with several major stochastic programming solution approaches.
The following methods are considered: regularized decomposition, stochastic decomposition and successive discrete approximation methods for two stage problems; cutting plane methods, and a reduced gradient method for jointly chance constrained problems.
The first part of the book introduces the algorithms, including a unified approach to decomposition methods and their regularized counterparts. The second part addresses computer implementation of the methods, describes a testing environment based on a model management system, and presents comparative computational results with the various algorithms. Emphasis is on the computational behavior of the algorithms.
A computationally oriented comparison of solution algorithms for two stage and jointly chance constrained stochastic linear programming problems, this is the first book to present comparative computational results with several major stochastic programming solution approaches.
The following methods are considered: regularized decomposition, stochastic decomposition and successive discrete approximation methods for two stage problems; cutting plane methods, and a reduced gradient method for jointly chance constrained problems.
The first part of the book introduces the algorithms, including a unified approach to decomposition methods and their regularized counterparts. The second part addresses computer implementation of the methods, describes a testing environment based on a model management system, and presents comparative computational results with the various algorithms. Emphasis is on the computational behavior of the algorithms.
Janos Mayer
1. Stochastic Linear Programming Models 2. Stochastic Linear Programming Algorithms 3. Implementation. The Testing Environment 4. Computational Results 5. Algorithmic Concepts in Convex Programming
| Erscheint lt. Verlag | 25.2.1998 |
|---|---|
| Reihe/Serie | Optimization Theory and Applications |
| Verlagsort | London |
| Sprache | englisch |
| Maße | 191 x 254 mm |
| Gewicht | 512 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| ISBN-10 | 90-5699-144-2 / 9056991442 |
| ISBN-13 | 978-90-5699-144-9 / 9789056991449 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
was jeder über Informatik wissen sollte
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Grundlagen – Anwendungen – Perspektiven
Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 53,15
Teil 2 der gestreckten Abschlussprüfung Fachinformatiker/-in …
Buch | Softcover (2025)
Europa-Lehrmittel (Verlag)
CHF 37,90
