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.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Universitext
Release date:	June 2001
First published:	2001
Authors:	Dimitris Alevras • Manfred W. Padberg
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
Categories:	Books > Business & Economics > Economics > Economic theory & philosophy Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Reference & Interdisciplinary > Communication studies > Decision theory > General Books > Science & Mathematics > Mathematics > Optimization > Linear programming Promotions
LSN:	3-540-41744-3
Barcode:	9783540417446

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!