Linear Programming: A Modern Integrated Analysis
Romesh Saigal
joulu 2012 · International Series in Operations Research & Management Science Kirja 1 · Springer Science & Business Media
4,0star
2 arvosteluareport
E-kirja
342
sivuja
reportArvioita ja arvosteluja ei ole vahvistettu Lue lisää
Tietoa tästä e-kirjasta
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.
Arviot ja arvostelut
4,0
2 arvostelua
Arvioi tämä e-kirja
Kerro meille mielipiteesi.
Tietoa lukemisesta
Älypuhelimet ja tabletit
Asenna Google Play Kirjat ‑sovellus Androidille tai iPadille/iPhonelle. Se synkronoituu automaattisesti tilisi kanssa, jolloin voit lukea online- tai offline-tilassa missä tahansa oletkin.
Kannettavat ja pöytätietokoneet
Voit kuunnella Google Playsta ostettuja äänikirjoja tietokoneesi selaimella.
Lukulaitteet ja muut laitteet
Jos haluat lukea kirjoja sähköisellä lukulaitteella, esim. Kobo-lukulaitteella, sinun täytyy ladata tiedosto ja siirtää se laitteellesi. Siirrä tiedostoja tuettuihin lukulaitteisiin seuraamalla ohjekeskuksen ohjeita.
