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

Potential Function Methods For Approximately Solving Linear Programming Problems

Potential Function Methods For Approximately Solving Linear Programming Problems
Stock photo: cover may vary

Potential Function Methods For Approximately Solving Linear Programming Problems Hardback - 2002

by Bienstock, Daniel,

Add to wish list
  • Used
New

Description

like new.
Ask the seller a question Add to wish list
A$175.80
A$5.72 Delivery within USA
Standard delivery: 2 to 14 days
More delivery options
Ships from GreatBookPrices (Maryland, United States)

Details

  • Title Potential Function Methods For Approximately Solving Linear Programming Problems
  • Author Bienstock, Daniel,
  • Binding Hardback
  • Edition 1st
  • Condition New
  • Pages 111
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date 2002-08-31
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index
  • Bookseller's Inventory # 947519
  • ISBN 9781402071737 / 1402071736
  • Weight 0.81 lbs (0.37 kg)
  • Dimensions 9.76 x 6.36 x 0.53 in (24.79 x 16.15 x 1.35 cm)
  • Category Mathematics
  • Library of Congress subjects Algorithms, Linear programming
  • Library of Congress Catalogue Number 2002073008
  • Dewey Decimal Code 519.72
  • Quantity available 5

About GreatBookPrices Maryland, United States

Biblio member since 2024

Since 1991, we have worked every day to serve our customers with state-of-the-art technology and world class service. We are dedicated to providing customers around the world with the widest selection of books, DVDs, and CDs at the absolute lowest price.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from GreatBookPrices

Reader reviews for Potential Function Methods For Approximately Solving Linear Programming Problems

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-