Linear Optimization and Extensions - Problems and Solutions (Paperback, Softcover reprint of the original 1st ed. 2001)

,
This book offers a comprehensive treatment of the exercises and case studies as well as summaries of the chapters of the book "Linear Optimization and Extensions" by Manfred Padberg. It covers the areas of linear programming and the optimization of linear functions over polyhedra in finite dimensional Euclidean vector spaces.Here are the main topics treated in the book: Simplex algorithms and their derivatives including the duality theory of linear programming. Polyhedral theory, pointwise and linear descriptions of polyhedra, double description algorithms, Gaussian elimination with and without division, the complexity of simplex steps. Projective algorithms, the geometry of projective algorithms, Newtonian barrier methods. Ellipsoids algorithms in perfect and in finite precision arithmetic, the equivalence of linear optimization and polyhedral separation. The foundations of mixed-integer programming and combinatorial optimization.

R2,710

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles27100
Mobicred@R254pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 10 - 15 working days


Toggle WishListAdd to wish list
Review this Item

Product Description

This book offers a comprehensive treatment of the exercises and case studies as well as summaries of the chapters of the book "Linear Optimization and Extensions" by Manfred Padberg. It covers the areas of linear programming and the optimization of linear functions over polyhedra in finite dimensional Euclidean vector spaces.Here are the main topics treated in the book: Simplex algorithms and their derivatives including the duality theory of linear programming. Polyhedral theory, pointwise and linear descriptions of polyhedra, double description algorithms, Gaussian elimination with and without division, the complexity of simplex steps. Projective algorithms, the geometry of projective algorithms, Newtonian barrier methods. Ellipsoids algorithms in perfect and in finite precision arithmetic, the equivalence of linear optimization and polyhedral separation. The foundations of mixed-integer programming and combinatorial optimization.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Springer-Verlag

Country of origin

Germany

Series

Universitext

Release date

June 2001

Availability

Expected to ship within 10 - 15 working days

First published

2001

Authors

,

Dimensions

242 x 193 x 25mm (L x W x T)

Format

Paperback

Pages

449

Edition

Softcover reprint of the original 1st ed. 2001

ISBN-13

978-3-540-41744-6

Barcode

9783540417446

Categories

LSN

3-540-41744-3



Trending On Loot