Kontakt
Jak kupować
Dostawa
Doradca ds. zakupów
Angielski
474 b
najlepszej
ceny ▸
Nawet do 30 dni na zwrot
Klienci kupili także
/
Miękka
17.95
€
/
Miękka
42.95
€
/
Miękka
51.19
€
/
Miękka
27.19
€
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.
Informacje o książce
Angielski
Podaruj tę książkę jeszcze dziś
To łatwe
1 Dodaj książkę do koszyka i wybierz „dostarczyć jako prezent” 2 W odpowiedzi wyślemy Ci bon 3 Książka dotrze na adres obdarowanegoMogłoby Cię także zainteresować
/
Miękka
21.49
€
/
Miękka
15.39
€
/
Kalendarz
26.69
€
/
Twarda
12.29
€
Cześć! Jestem Libroamiko, Twój doradca książkowy.
Jak mogę Ci pomóc?