wyszukanych pozycji: 2
Linear Programming: A Modern Integrated Analysis
ISBN: 9781461359777 / Angielski / Miękka / 2012 / 342 str. Termin realizacji zamówienia: ok. 20 dni roboczych. 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,... In Linear Programming: A Modern Integrated Analysis, both boundary (simplex) and interior point methods are derived from the complementary sl...
|
|
cena:
846,23 zł |
Linear Programming: A Modern Integrated Analysis
ISBN: 9780792396222 / Angielski / Twarda / 1995 / 342 str. Termin realizacji zamówienia: ok. 20 dni roboczych. 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,... In Linear Programming: A Modern Integrated Analysis, both boundary (simplex) and interior point methods are derived from the complementary sl...
|
|
cena:
769,29 zł |