• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Simplicial Algorithms for Minimizing Polyhedral Functions

Simplicial Algorithms for Minimizing Polyhedral Functions

Hardcover

General MathematicsProbability & Statistics

ISBN10: 0521791332
ISBN13: 9780521791335
Publisher: Cambridge
Published: Jan 8 2001
Pages: 262
Weight: 1.05
Height: 0.80 Width: 6.10 Depth: 9.10
Language: English
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.

1 different editions

Also available

Also in

Probability & Statistics