Linear Programming: A Modern Integrated Analysis
Romesh Saigal
dec. 2012 · International Series in Operations Research & Management Science Bok 1 · Springer Science & Business Media
4,0star
2 recensionerreport
E-bok
342
Sidor
reportBetyg och recensioner verifieras inte Läs mer
Om den här e-boken
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.
Betyg och recensioner
4,0
2 recensioner
Betygsätt e-boken
Berätta vad du tycker.
Läsinformation
Smartphones och surfplattor
Installera appen Google Play Böcker för Android och iPad/iPhone. Appen synkroniseras automatiskt med ditt konto så att du kan läsa online eller offline var du än befinner dig.
Laptops och stationära datorer
Du kan lyssna på ljudböcker som du har köpt på Google Play via webbläsaren på datorn.
Läsplattor och andra enheter
Om du vill läsa boken på enheter med e-bläck, till exempel Kobo-läsplattor, måste du ladda ned en fil och överföra den till enheten. Följ anvisningarna i hjälpcentret om du vill överföra filerna till en kompatibel läsplatta.
