Linear Programming: A Modern Integrated Analysis
Romesh Saigal
gru 2012 · International Series in Operations Research & Management Science Część 1 · Springer Science & Business Media
4,0star
2 opiniereport
E-book
342
Strony
reportOceny i opinie nie są weryfikowane. Więcej informacji
Informacje o e-booku
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.
Oceny i opinie
4,0
2 opinie
Oceń tego e-booka
Podziel się z nami swoją opinią.
Informacje o czytaniu
Smartfony i tablety
Zainstaluj aplikację Książki Google Play na Androida i iPada/iPhone'a. Synchronizuje się ona automatycznie z kontem i pozwala na czytanie w dowolnym miejscu, w trybie online i offline.
Laptopy i komputery
Audiobooków kupionych w Google Play możesz słuchać w przeglądarce internetowej na komputerze.
Czytniki e-booków i inne urządzenia
Aby czytać na e-papierze, na czytnikach takich jak Kobo, musisz pobrać plik i przesłać go na swoje urządzenie. Aby przesłać pliki na obsługiwany czytnik, postępuj zgodnie ze szczegółowymi instrukcjami z Centrum pomocy.
