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

Regular price
Checking stock...
Regular price
Checking stock...
Summary

Potential Function Methods For Approximately Solving Linear Programming Problems breaks new ground in linear programming theory. 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.

The feel-good place to buy books
  • Free delivery in Australia
  • Supporting authors with AuthorSHARE
  • 100% recyclable packaging
  • Proud to be a B Corp – A Business for good

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

This text 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. Since the 1990s, 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 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 has been a family of algorithms with solid theoretical foundations and with growing experimental success. This book examines these algorithms, starting with some of the very earliest examples through to the latest theoretical and computational developments.
Bienstock, Daniel: - Daniel Bienstock is a Professor in the Department of Industrial Engineering and Operations Research, Columbia University, with a joint affiliation to the Department of Applied Physics and Applied Mathematics. Prior to joining Columbia University, Professor Bienstock was in the combinatorics and optimization research group at Bellcore. He has also participated in collaborative research with several industrial partners. He received the 2013 INFORMS Fellow Award, a Presidential Young Investigator Award, and an IBM Faculty Award and has given both a plenary address at the 2005 SIAM Conference on Optimization and a semi-plenary at the 2006 ISMP conference. His research focuses on optimization and high-performance computing, with a second focus on the use of computational mathematics in the analysis and control of power grids, especially the study of vulnerabilities and of cascading blackouts.
SKU Unavailable
ISBN 13 9781402071737
ISBN 10 1402071736
Title Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice
Author Daniel Bienstock
Series International Series In Operations Research And Management Science Ser
Condition Unavailable
Binding Type Hardback
Publisher Kluwer Academic Publishers
Year published 2002-08-31
Number of pages 111
Cover note Book picture is for illustrative purposes only, actual binding, cover or edition may vary.