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

Skip to content

Linear Programming

Linear Programming

Linear Programming
Stock photo: cover may vary

Linear Programming Hardback - 1995 - 1995th Edition

by Saigal, Romesh,

Add to wish list
  • Used
New

Description

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

Details

  • Title Linear Programming
  • Author Saigal, Romesh,
  • Binding Hardback
  • Edition number 1995th
  • Edition 1995
  • Condition New
  • Pages 342
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date 1995-11-30
  • Features Bibliography
  • Bookseller's Inventory # 7821310
  • ISBN 9780792396222 / 0792396227
  • Weight 1.5 lbs (0.68 kg)
  • Dimensions 9.21 x 6.14 x 0.81 in (23.39 x 15.60 x 2.06 cm)
  • Category Mathematics
  • Library of Congress Catalogue Number 95034605
  • 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 Linear Programming

From the publisher

In Linear Programming: A Modern Integrated Analysis, both boundary (simplex) and interior point methods are derived from the complementary slackness theorem and, unlike most books, the duality theorem is derived from Farkas's Lemma, which is proved as a convex separation theorem. The tedium of the simplex method is thus avoided.
A new and inductive proof of Kantorovich's Theorem is offered, related to the convergence of Newton's method. Of the boundary methods, the book presents the (revised) primal and the dual simplex methods. An extensive discussion is given of the primal, dual and primal-dual affine scaling methods. In addition, the proof of the convergence under degeneracy, a bounded variable variant, and a super-linearly convergent variant of the primal affine scaling method are covered in one chapter. Polynomial barrier or path-following homotopy methods, and the projective transformation method are also covered in the interior point chapter. Besides the popular sparse Cholesky factorization and the conjugate gradient method, new methods are presented in a separate chapter on implementation. These methods use LQ factorization and iterative techniques.
tracking-