Simplicial Algorithms for Minimizing Polyhedral Functions

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.

Author: M. R. Osborne
Publisher: Cambridge University Press
Published: 01/08/2001
Pages: 262
Binding Type: Hardcover
Weight: 1.05lbs
Size: 9.10h x 6.10w x 0.80d
ISBN: 9780521791335

This title is not returnable