Join Books.org — it's free

Computer Mathematics, Geometry - General & Miscellaneous, Mathematical Programming & Operations Research
Geometric Methods And Optimization Problems, Vol. 4 by V. Boltianskii — book cover

Geometric Methods And Optimization Problems, Vol. 4

by V. Boltianskii, V. Boltyanski, H. Martini
Available on Bookshop Write a review

Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.

Log in to track your reading progress.

Overview

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.

Synopsis

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.

Booknews

Focuses on three applied disciplines: control theory, location science and computational geometry. The authors demonstrate how methods and topics from convex geometry in a wider sense, such as separation theory of convex cones, Minkowski geometry, and convex partitionings, can help solve various problems from these disciplines. They consider 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, and different types of partitionings of topologically complicated polygonal domains into a minimum number of convex pieces. Figures and exercises are provided throughout the book. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Reviews

There are no reviews yet. Log in to write one.

Editorials

Booknews

Focuses on three applied disciplines: control theory, location science and computational geometry. The authors demonstrate how methods and topics from convex geometry in a wider sense, such as separation theory of convex cones, Minkowski geometry, and convex partitionings, can help solve various problems from these disciplines. They consider 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, and different types of partitionings of topologically complicated polygonal domains into a minimum number of convex pieces. Figures and exercises are provided throughout the book. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Book Details

Published
December 1, 1998
Publisher
Springer-Verlag New York, LLC
Pages
440
Format
Hardcover
ISBN
9780792354543

Similar books