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

Skip to content

Linear Programming : A Modern Integrated Analysis

Linear Programming : A Modern Integrated Analysis

Linear Programming : A Modern Integrated Analysis Hardback - 1995 - 1995th Edition

by Romesh Saigal

Add to wish list
  • New
  • Hardback
New

Description

Hardcover. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; 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, whi
Ask the seller a question Add to wish list
A$388.00
A$15.44 Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Ships from Ria Christie Collections (Greater London, United Kingdom)
The BIBLIO Guarantee

Details

  • Title Linear Programming : A Modern Integrated Analysis
  • Author Romesh Saigal
  • 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 # ria9780792396222_inp
  • 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 280

About Ria Christie Collections Greater London, United Kingdom

Specialising in: Books, Calendars, Fiction Books, Non- Fiction Books, Textbooks
Biblio member since 2014

Hello We are professional online booksellers. We sell mostly new books and textbooks and we do our best to provide a competitive price. We are based in Greater London, UK. We pride ourselves by providing a good customer service throughout, shipping the items quickly and replying to customer queries promptly. Ria Christie Collections

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 Ria Christie Collections

Reader reviews for Linear Programming : A Modern Integrated Analysis

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

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.

Please wait a moment while we load the requested page.

tracking-