Simplicial Algorithms for Minimizing Polyhedral Functions

by

Write The First Customer Review

Polyhedral functions provide a model for an important class of problems that includes both linear programming and applications in data analysis. General methods for minimizing such functions using the polyhedral geometry explicitly are developed. Such methods approach a minimum by moving from extreme point to extreme point along descending edges and are described generically as simplicial. The best-known member of this class is the simplex method of linear programming, but simplicial methods have found important ...

Simplicial Algorithms for Minimizing Polyhedral Functions 2013, Cambridge University Press, Cambridge, England

ISBN-13: 9780521791335

Hardcover

Select
Simplicial Algorithms for Minimizing Polyhedral Functions 2011, Cambridge University Press, Cambridge

ISBN-13: 9781107403505

Trade paperback

Select