Geometric methods and optimization problems

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

Series Statement

• Combinatorial optimization ;

Other Editions

• Geometric methods and optimization problemsKluwer Academic Publishers1999-01-01
• Geometric Methods and Optimization Problems (Combinatorial Optimization)HardcoverSpringer1998-12-31
• Geometric Methods and Optimization ProblemsSpringer2013-01-01
• Geometric Methods and Optimization ProblemspaperbackSpringer2014-01-09
• Geometric Methods and Optimization ProblemsPaperbackSpringer2014-10-04