SKU/Artículo: AMZ-0792396227

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

Format:

Hardcover

Hardcover

Paperback

Detalles del producto
Disponibilidad:
En stock
Peso con empaque:
0.68 kg
Devolución:
No
Condición
Nuevo
Producto de:
Amazon
Viaja desde
USA

Sobre este producto
  • 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.
AR$989.197
60% OFF
AR$395.677

IMPORT EASILY

By purchasing this product you can deduct VAT with your RUT number

AR$989.197
60% OFF
AR$395.677

Pagá fácil y rápido con Mercado Pago o MODO

Llega en 18 a 28 días hábiles
con envío
Tienes garantía de entrega
Este producto viaja de USA a tus manos en