|
Simplicial Algorithms for Minimizing Polyhedral Functions
|
| List Price: | £55.00 |
| Price: | £52.25 & eligible for FREE Super Saver Delivery on orders over £5. Details |
Availability: Temporarily out of stock. Order now and we'll deliver when available. We'll e-mail you with an estimated delivery date as soon as we have more information. Your credit card will not be charged until we ship the item.
Dispatched from and sold by Amazon.co.uk
Product Description
This book provides the first general account of the development of simplicial algorithms. These include the ubiquitous simplex method of linear programming, widely used in industrial optimization and strategic decision making. They also include methods important in data analysis, such as problems involving very large data sets. The theoretical development is based on a new way of representing the underlying geometry of polyhedra functions (functions whose graphs are made up of plane faces), and is capable of resolving problems which occur when combinatorially large numbers of faces intersect at each vertex.
Product Details
- Amazon Sales Rank: #2784326 in Books
- Published on: 2001-01-08
- Original language: English
- Number of items: 1
- Binding: Hardcover
- 250 pages
Editorial Reviews
Review
‘… will be very useful to researchers and students in the field … will certainly serve as a standard reference on the subject for a long time.’ Numerical Algorithms
‘The book has a rich content and can be recommended to all optimizers, it is even a good supplement for specialists.’ Alfred Göpfert, Zentralblatt für Mathematik
'The treatment is mathematical (definition, lemma, theorem, proof type of text) but attention is paid to algorithms and practical implementation aspects too. It is easy to read and a reference book for novice students as well as for implementors of the methods.' Bulletin of the Belgian Mathematical Society
