Title: Geometric methods and optimization problems
First published: 1999
Description: 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.
Subjects: Convex geometry, Control theory, Mathematical optimization, Applied mathematics, Computer Programming, Probability & statistics, Mathematics, Science/Mathematics, Geometry - General, Mathematics / Geometry / General, Mathematics / Linear Programming, Discrete Mathematics, Combinatorial analysis, Electronic data processing, Discrete groups, Optimization, Calculus of Variations and Optimal Control; Optimization, Convex and Discrete Geometry, Numeric Computing
LC classification: QA639.5 .B65 1999