Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice

Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice

Bienstock, Daniel

Hardcover

Series: International Operations Research & Management Science, Book 53

Medical ReferenceGeneral MathematicsProgramming

ISBN10: 1402071736
ISBN13: 9781402071737
Publisher: Springer Nature
Published: Aug 31 2002
Pages: 111
Weight: 0.81
Height: 0.53 Width: 6.36 Depth: 9.76
Language: English
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.

1 different editions

Also available

Also in

General Mathematics

View All