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

Skip to content

Linear Programming: A Modern Integrated Analysis (International Series in Operations Research & Management Science)

Linear Programming: A Modern Integrated Analysis (International Series in Operations Research & Management Science)

Linear Programming: A Modern Integrated Analysis (International Series in
Stock photo: cover may vary

Linear Programming: A Modern Integrated Analysis (International Series in Operations Research & Management Science) Hardback - 1995 - 1995th Edition

by Saigal, Romesh

Add to wish list
  • New
  • Hardback
New

Description

Springer, 1995-11-30. Hardcover. New. New. In shrink wrap. Looks like an interesting title!
Ask the seller a question Add to wish list
A$287.61
A$8.69 Delivery within USA
Standard delivery: 2 to 21 days
More delivery options
Ships from GridFreed LLC (California, United States)

Details

About GridFreed LLC California, United States

Biblio member since 2021

We sell primarily non-fiction, many new books, some collectible first editions and signed books. We operate 100% online and have been in business since 2005.

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 GridFreed LLC

Reader reviews for Linear Programming: A Modern Integrated Analysis (International Series in Operations Research & Management Science)

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-