Mathematical Analysis - General & Miscellaneous, Geometry - General & Miscellaneous, Mathematical Programming & Operations Research
Available on Bookshop
Write a review
Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Log in to track your reading progress.
Overview
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 and 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 that occur when combinatorially large numbers of faces intersect at each vertex.Editorials
From the Publisher
Review of the hardback: '… 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 AlgorithmsReview of the hardback: '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
Review of the hardback: '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
Book Details
Published
September 15, 2011
Publisher
Cambridge University Press
Pages
262
Format
Paperback
ISBN
9781107403505