Separable Programming

运筹学

原   价:
1140.00
售   价:
912.00
优惠
平台大促 低至8折优惠
作      者
出  版 社
出版时间
2010年12月06日
装      帧
平装
ISBN
9781441948519
复制
页      码
336
语      种
英语
综合评分
暂无评分
我 要 买
- +
库存 98 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
In this book, the author considers separable programming and, in particular, one of its important cases - convex separable programming. Some general results are presented, techniques of approximating the separable problem by linear programming and dynamic programming are considered. Convex separable programs subject to inequality/ equality constraint(s) and bounds on variables are also studied and iterative algorithms of polynomial complexity are proposed. As an application, these algorithms are used in the implementation of stoch
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个