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 Operations Research & Management Science)

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

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

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

by Saigal, Romesh

Add to wish list
  • Used
  • Hardback
Used: Good

Description

Springer, 1995-11-30. 1995 ed. hardcover. Used: Good. 6.14x0.81x9.21. Buy with confidence. Excellent Customer Service & Return policy.
Ask the seller a question Add to wish list
A$262.36
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Dropship order
Ships from Ergodebooks (Texas, United States)

Details

About Ergodebooks Texas, United States

Biblio member since 2005

Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

Reader reviews for Linear Programming: A Modern Integrated Analysis (International 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-