Linear Programming:A Modern Integrated Analysis(International Series in Operations Research & Management Science)

数量经济学

原   价:
2724.00
售   价:
2179.00
优惠
平台大促 低至8折优惠
发货周期:外国库房发货,通常付款后3-5周到货
作      者
出  版 社
出版时间
1995年11月30日
装      帧
精装
ISBN
9780792396222
复制
页      码
342
开      本
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 100 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个