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.
"synopsis" may belong to another edition of this title.
£ 3.39 shipping within U.S.A.
Destination, rates & speedsSeller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Condition: Very Good. 163 pp., Hardcover, very good. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Seller Inventory # ZB777056
Quantity: 1 available
Seller: Der Buchfreund, Wien, Austria
Original-Pappband. Condition: min. Lagersp., g.e. 4 Original-Pappband en Mathematik, Naturwissenschaften (Optimization Theory and Applications. Vol. 1); IX pp., 153 pp. Seller Inventory # 1057
Quantity: 1 available