Geometric methods and optimization problems (Q1278049)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Geometric methods and optimization problems |
scientific article; zbMATH DE number 1252486
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Geometric methods and optimization problems |
scientific article; zbMATH DE number 1252486 |
Statements
Geometric methods and optimization problems (English)
0 references
22 February 1999
0 references
The book deals with three disciplines of applied mathematics: control theory, location science and computational geometry. The authors show how methods from convex geometry can help to solve various problems from these disciplines. In the first part (Non-classical Variational Calculus) the tent method as an application of a generalized separation theory of convex cones is presented. In parts II (Median Problems in Location Science) and III (Minimum Convex Partitions of Polygonal Domains), various median problems in Euclidean and Minkowski spaces and different types of partitionings of topologically complicated polygonal domains into a minimum number of convex pieces are considered.
0 references
non-classical variational calculus
0 references
median problems
0 references
minimum convex partitions of polygonal domains
0 references
control theory
0 references
location science
0 references
computational geometry
0 references
tent method
0 references