Linear and Integer Programming vs Linear Integration and Counting

数量经济学

售   价:
884.00
作      者
出  版 社
出版时间
2010年12月15日
装      帧
平装
ISBN
9781441918536
复制
页      码
168
语      种
英语
综合评分
暂无评分
我 要 买
- +
库存 56 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
This book analyzes and compares four closely related problems, namely linear programming, integer programming, linear integration, and linear summation (or counting). The focus is on duality and the novel approach puts integer programming in perspective with three associated problems, and permits one to define discrete analogues of well-known continuous duality concepts, and the rationale behind them. Also, the approach highlights the difference between the discrete and continuous cases. Central in the analysis are the continuous and discrete Brion and Vergne’s formulae for linear integration and counting which are not very well-known in the optimization community. This approach provides some new insights on duality concepts for integer programs, and also permits to retrieve and shed new light on some well-known results. For instance, Gomory relaxations and the abstract superadditive dual of integer programs are re-interpreted in this algebraic approach. This book will serve graduate students and researchers in applied mathematics, optimization, operations research and computer science. Due to the substantial practical importance of some presented problems, researchers in other areas will also find this book useful.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个