Geometric methods and optimization problems /
This book focuses on three disciplines of applied mathematics: control theory, location science and computational geometry. The authors show how methods and tools from convex geometry in a wider sense can help solve various problems from these disciplines. More precisely they consider mainly the ten...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | , |
| Format: | eBook |
| Language: | English |
| Published: |
Dordrecht ; Boston :
Kluwer Academic Publishers,
[1999]
|
| Series: | Combinatorial optimization ;
v. 4. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| Summary: | This book focuses on three disciplines of applied mathematics: control theory, location science and computational geometry. The authors show how methods and tools from convex geometry in a wider sense can help solve various problems from these disciplines. More precisely they consider mainly the tent method (as an application of a generalized separation theory of convex cones) in nonclassical variational calculus, various median problems in Euclidean and other Minkowski spaces (including a detailed discussion of the Fermat-Torricelli problem) and different types of partitionings of topologically complicated polygonal domains into a minimum number of convex pieces. Figures are used extensively throughout the book and there is also a large collection of exercises. Audience: Graduate students, teachers and researchers. |
|---|---|
| Physical Description: | 1 online resource (viii, 429 pages) : illustrations. |
| Bibliography: | Includes bibliographical references (pages 423-428) and index. |
| ISBN: | 9781461553199 (electronic bk.) 1461553199 (electronic bk.) |