具体描述
In the book Istvan Maros is publishing now, he discloses his secrets and presents them to the interested readers. The book is, however, not only about that. It presents a comprehensive description of those algorithmic elements which are needed for a state-of-the-art implementation of the simplex method, in a novel and attractive setting. Several of the results are of his own.
The main feature of the book is the presentation of a huge richness of algorithms and algorithmic components not seen in any other book on the simplex method so far. The author combines them with some known data structure methods in an intuitive way. Of particular importance are the use of piecewise linear objective functions in phase-l and phase-2 of the dual algorithms that not only make the dual a perfect alternative to the primal but also boosts the performance of mixed
integer programming algorithms by greatly reducing the effort needed
for reoptimization in branch and bound/cut. All algorithmic elements
presented in the book have been thoroughly tested.
The book can be used by specialists who develop LP solver codes
customized for special purposes. It can also be used as a textbook, to
teach graduate course, as well as a monograph helping to do research on
the subject. It is clearly written, easy to read and deserves to be on the
bookshelf of every mathematical programmer.
作者简介
目录信息
Part I: Preliminaries.
1. The linear programming problem.
2. The simplex method.
3. Large-scale LP problems.
Part II: Computational Techniques.
4. Design principles of LP systems.
5. Data structures and basic operations.
6. Problem definition.
7. LP Processing.
8. Basis inverse, factorization.
9. The primal algorithm.
10. The dual algorithm.
11. Various issues. Index.
· · · · · · (收起)
读后感
评分
评分
评分
评分
用户评价
相关图书
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2025 book.quotespace.org All Rights Reserved. 小美书屋 版权所有