Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice (Hardcover, 2002 ed.)

Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. The book draws on the research developments in three broad areas: linear and integer programming, numerical analysis, and the computational architectures which enable speedy, high-level algorithm design. During the last ten years, a new body of research within the field of optimization research has emerged, which seeks to develop good approximation algorithms for classes of linear programming problems. This work both has roots in fundamental areas of mathematical programming and is also framed in the context of the modern theory of algorithms. The result of this work, in which Daniel Bienstock has been very much involved, has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book will examine these algorithms, starting with some of the very earliest examples, and through the latest theoretical and computational developments.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	International Series in Operations Research & Management Science, 53
Release date:	July 2002
First published:	2002
Authors:	Daniel Bienstock
Dimensions:	235 x 155 x 9mm (L x W x T)
Format:	Hardcover
Pages:	111
Edition:	2002 ed.
ISBN-13:	978-1-4020-7173-7
Categories:	Books > Science & Mathematics > Mathematics > Optimization > Linear programming Books > Professional & Technical > Mechanical engineering & materials > Production engineering > General
LSN:	1-4020-7173-6
Barcode:	9781402071737

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!