BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

POTENTIAL FUNCTION METHODS FOR APPROXIMATELY SOLVING LINEAR PROGRAMMING PROBLEMS: THEORY AND PRACTICE (INTERNATIONAL SERIES IN OPERATIONS RESEARCH & MANAGEMENT SCIENCE)

POTENTIAL FUNCTION METHODS FOR APPROXIMATELY SOLVING LINEAR PROGRAMMING PROBLEMS: THEORY AND PRACTICE (INTERNATIONAL SERIES IN OPERATIONS RESEARCH & MANAGEMENT SCIENCE)

POTENTIAL FUNCTION METHODS FOR APPROXIMATELY SOLVING LINEAR PROGRAMMING
Stock photo: cover may vary

POTENTIAL FUNCTION METHODS FOR APPROXIMATELY SOLVING LINEAR PROGRAMMING PROBLEMS: THEORY AND PRACTICE (INTERNATIONAL SERIES IN OPERATIONS RESEARCH & MANAGEMENT SCIENCE) Hardback - 2002

by DANIEL BIENSTOCK ,

Add to wish list
  • New
  • Hardback
  • first
New

Description

kluwer, 2002. 1st. Hardcover. New/New.
Ask the seller a question Add to wish list
A$88.07
A$21.66 Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Ships from DELHI BOOK STORE (Delhi, India)

Details

About DELHI BOOK STORE Delhi, India

Biblio member since 2007

Our prime concern is to make books available with its extensive choices of titles on all subjects for medicine, engineers, technocrats, corporates, scientists, academics, students, scholars and many more at attractive price range.

Terms of Sale: BOOKS CAN BE RETURNED IF IT IS UNOPENED OR SHRINK WRAP IS NOT BROKEN.

Browse books from DELHI BOOK STORE

Reader reviews for POTENTIAL FUNCTION METHODS FOR APPROXIMATELY SOLVING LINEAR PROGRAMMING PROBLEMS: THEORY AND PRACTICE (INTERNATIONAL SERIES IN OPERATIONS RESEARCH & MANAGEMENT SCIENCE)

From the publisher

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.
tracking-