Geometric methods and optimization problems
Work detail
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.
Overview
Shared work-level identity and catalog context.
Contributors
People credited with this work in the active catalog.
- Open Author
V. G. Bolti͡anskiĭ
- Open Author
V. Boltyanski
- Open Author
H. Martini
- Open Author
V. Soltan
- Open Author
Vladimir Boltyanski
- Open Author
Horst Martini
Editions
Publication-specific versions linked to this work only.
- Image source: Open LibraryGM
Geometric Methods and Optimization Problems
- Image source: Open LibraryGM
Geometric Methods and Optimization Problems
- Image source: Open LibraryGM
Geometric methods and optimization problems
- Image source: Open LibraryGM
Geometric Methods and Optimization Problems (Combinatorial Optimization)
- GMGeometric Methods and Optimizat...Vladimir Boltyanski, Horst Martini, V. Soltan
Geometric Methods and Optimization Problems
