Linear Programming: A Modern Integrated Analysis
Romesh Saigal
dhj 2012 · International Series in Operations Research & Management Science Libri 1 · Springer Science & Business Media
4,0star
2 komentereport
Libër elektronik
342
Faqe
reportVlerësimet dhe komentet nuk janë të verifikuara Mëso më shumë
Rreth këtij libri elektronik
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.
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.
Vlerësime dhe komente
4,0
2 komente
Vlerëso këtë libër elektronik
Na trego se çfarë mendon.
Informacione për leximin
Telefona inteligjentë dhe tabletë
Instalo aplikacionin "Librat e Google Play" për Android dhe iPad/iPhone. Ai sinkronizohet automatikisht me llogarinë tënde dhe të lejon të lexosh online dhe offline kudo që të ndodhesh.
Laptopë dhe kompjuterë
Mund të dëgjosh librat me audio të blerë në Google Play duke përdorur shfletuesin e uebit të kompjuterit.
Lexuesit elektronikë dhe pajisjet e tjera
Për të lexuar në pajisjet me bojë elektronike si p.sh. lexuesit e librave elektronikë Kobo, do të të duhet të shkarkosh një skedar dhe ta transferosh atë te pajisja jote. Ndiq udhëzimet e detajuara në Qendrën e ndihmës për të transferuar skedarët te lexuesit e mbështetur të librave elektronikë.
