9780792354543 - Geometric Methods and Optimization Problems: 4 di Boltyanski, Vladimir; Martini, H.; Soltan, V. (14 risultati)

Condizione: New.

Gebunden. Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New. In.

Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 444 | Sprache: Englisch | Produktart: Bücher | VII Preface In many fields of mathematics, geometry has established itself as a fruitful method and common language for describing basic phenomena and problems as well as suggesting ways of solutions. Especially in pure mathematics this is ob­ vious and well-known (examples are the much discussed interplay between lin­ ear algebra and analytical geometry and several problems in multidimensional analysis). On the other hand, many specialists from applied mathematics seem to prefer more formal analytical and numerical methods and representations. Nevertheless, very often the internal development of disciplines from applied mathematics led to geometric models, and occasionally breakthroughs were b~ed on geometric insights. An excellent example is the Klee-Minty cube, solving a problem of linear programming by transforming it into a geomet­ ric problem. Also the development of convex programming in recent decades demonstrated the power of methods that evolved within the field of convex geometry. The present book focuses on three applied disciplines: control theory, location science and computational geometry. It is our aim to demonstrate how methods and topics from convex geometry in a wider sense (separation theory of convex cones, Minkowski geometry, convex partitionings, etc.) can help to solve various problems from these disciplines.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.

Condizione: New. Focuses on three disciplines of applied mathematics: control theory, location science and computational geometry. This book shows how methods and tools from convex geometry in a wider sense can help solve various problems from these disciplines. Series: Combinatorial Optimization. Num Pages: 440 pages, biography. BIC Classification: PBT; PBW; UM. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 25. Weight in Grams: 796. . 1998. Hardback. . . . .

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - VII Preface In many fields of mathematics, geometry has established itself as a fruitful method and common language for describing basic phenomena and problems as well as suggesting ways of solutions. Especially in pure mathematics this is ob vious and well-known (examples are the much discussed interplay between lin ear algebra and analytical geometry and several problems in multidimensional analysis). On the other hand, many specialists from applied mathematics seem to prefer more formal analytical and numerical methods and representations. Nevertheless, very often the internal development of disciplines from applied mathematics led to geometric models, and occasionally breakthroughs were b~ed on geometric insights. An excellent example is the Klee-Minty cube, solving a problem of linear programming by transforming it into a geomet ric problem. Also the development of convex programming in recent decades demonstrated the power of methods that evolved within the field of convex geometry. The present book focuses on three applied disciplines: control theory, location science and computational geometry. It is our aim to demonstrate how methods and topics from convex geometry in a wider sense (separation theory of convex cones, Minkowski geometry, convex partitionings, etc.) can help to solve various problems from these disciplines.

Hardcover. Condizione: Brand New. 1999 edition. 440 pages. 9.50x6.50x1.00 inches. In Stock.

Condizione: New. Focuses on three disciplines of applied mathematics: control theory, location science and computational geometry. This book shows how methods and tools from convex geometry in a wider sense can help solve various problems from these disciplines. Series: Combinatorial Optimization. Num Pages: 440 pages, biography. BIC Classification: PBT; PBW; UM. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 25. Weight in Grams: 796. . 1998. Hardback. . . . . Books ship from the US and Ireland.

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -VII Preface In many fields of mathematics, geometry has established itself as a fruitful method and common language for describing basic phenomena and problems as well as suggesting ways of solutions. Especially in pure mathematics this is ob vious and well-known (examples are the much discussed interplay between lin ear algebra and analytical geometry and several problems in multidimensional analysis). On the other hand, many specialists from applied mathematics seem to prefer more formal analytical and numerical methods and representations. Nevertheless, very often the internal development of disciplines from applied mathematics led to geometric models, and occasionally breakthroughs were b~ed on geometric insights. An excellent example is the Klee-Minty cube, solving a problem of linear programming by transforming it into a geomet ric problem. Also the development of convex programming in recent decades demonstrated the power of methods that evolved within the field of convex geometry. The present book focuses on three applied disciplines: control theory, location science and computational geometry. It is our aim to demonstrate how methods and topics from convex geometry in a wider sense (separation theory of convex cones, Minkowski geometry, convex partitionings, etc.) can help to solve various problems from these disciplines. 444 pp. Englisch.

Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -VII Preface In many fields of mathematics, geometry has established itself as a fruitful method and common language for describing basic phenomena and problems as well as suggesting ways of solutions. Especially in pure mathematics this is ob vious and well-known (examples are the much discussed interplay between lin ear algebra and analytical geometry and several problems in multidimensional analysis). On the other hand, many specialists from applied mathematics seem to prefer more formal analytical and numerical methods and representations. Nevertheless, very often the internal development of disciplines from applied mathematics led to geometric models, and occasionally breakthroughs were b~ed on geometric insights. An excellent example is the Klee-Minty cube, solving a problem of linear programming by transforming it into a geomet ric problem. Also the development of convex programming in recent decades demonstrated the power of methods that evolved within the field of convex geometry. The present book focuses on three applied disciplines: control theory, location science and computational geometry. It is our aim to demonstrate how methods and topics from convex geometry in a wider sense (separation theory of convex cones, Minkowski geometry, convex partitionings, etc.) can help to solve various problems from these disciplines.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 444 pp. Englisch.