Linear Programming: A Modern Integrated Analysis
Romesh Saigal
12.2012 г. · International Series in Operations Research & Management Science Книга 1 · Springer Science & Business Media
4,0star
2 отзиваreport
Електронна книга
342
Страници
reportОценките и отзивите не са потвърдени Научете повече
Всичко за тази електронна книга
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.
Оценки и отзиви
4,0
2 отзива
Оценете тази електронна книга
Кажете ни какво мислите.
Информация за четенето
Смартфони и таблети
Инсталирайте приложението Google Play Книги за Android и iPad/iPhone. То автоматично се синхронизира с профила ви и ви позволява да четете онлайн или офлайн, където и да сте.
Лаптопи и компютри
Можете да слушате закупените от Google Play аудиокниги посредством уеб браузъра на компютъра си.
Електронни четци и други устройства
За да четете на устройства с електронно мастило, като например електронните четци от Kobo, трябва да изтеглите файл и да го прехвърлите на устройството си. Изпълнете подробните инструкции в Помощния център, за да прехвърлите файловете в поддържаните електронни четци.
