Potential Function Methods For Approximately Solving Linear Programming Problems: Theory and Practice by Daniel BienstockPotential Function Methods For Approximately Solving Linear Programming Problems: Theory and Practice by Daniel Bienstock

Potential Function Methods For Approximately Solving Linear Programming Problems: Theory and…

byDaniel Bienstock

Hardcover | August 31, 2002

Pricing and Purchase Info

$220.95

Earn 1,105 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Potential Function Methods For Approximately Solving Linear Programming Problems: Theory and…Format:HardcoverDimensions:111 pagesPublished:August 31, 2002Publisher:Kluwer Boston Inc.Language:English

The following ISBNs are associated with this title:

ISBN - 10:1402071736

ISBN - 13:9781402071737

Reviews

Table of Contents

List of Figures. List of Tables. Preface. 1. Introduction. 1. Early Algorithms. 2. The Exponential Potential Function - Key Ideas. 3. Recent Developments. 4. Computational Experiments. Appendices. Index.