Author : Daniel Bienstock
Publisher : Springer
ISBN 13 : 9781475776713
Total Pages : 111 pages
Book Rating : 4.7/5 (767 download)
Book Synopsis Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice by : Daniel Bienstock
Download or read book Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice written by Daniel Bienstock and published by Springer. This book was released on 2013-03-26 with total page 111 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.