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 in nonclassical variational calculus, various median problems in Euclidean and other Minkowski spaces 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.
Language
English
Pages
440
Format
Kindle Edition
Publisher
Springer
Release
December 31, 1998
Geometric Methods and Optimization Problems (Combinatorial Optimization)
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 in nonclassical variational calculus, various median problems in Euclidean and other Minkowski spaces 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.