Name: Geometric Methods and Optimization Problems (Combinatorial Optimization) (en Inglés)
Price: 140.43 USD
Availability: InStock
Author: Vladimir Boltyanski; Horst Martini; V. Soltan
ISBN: 9781461374275

portada Geometric Methods and Optimization Problems (Combinatorial Optimization) (en Inglés)

Geometric Methods and Optimization Problems (Combinatorial Optimization) (en Inglés)

Formato

Libro Físico

Editorial

Springer

Autor

Vladimir Boltyanski; Horst Martini; V. Soltan

Año

2014

Idioma

Inglés

N° páginas

432

Encuadernación

Tapa Blanda

ISBN13

9781461374275

N° edición

Categorías

Matemáticas aplicadas

Geometric Methods and Optimization Problems (Combinatorial Optimization) (en Inglés)

Vladimir Boltyanski; Horst Martini; V. Soltan (Autor) · Springer · Tapa Blanda

Libro Nuevo Importado

Envío: 17 a 24 días háb.

$ 280.86$ 140.43

-50%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 140.43

Llega entre el 04 Sep y el 17 Sep a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Geometric Methods and Optimization Problems (Combinatorial Optimization) (en Inglés)"

VII Preface In many fields of mathematics, geometry has established itself as a fruitful method and common language for describing basic phenomena and problems as well as suggesting ways of solutions. Especially in pure mathematics this is ob vious and well-known (examples are the much discussed interplay between lin ear algebra and analytical geometry and several problems in multidimensional analysis). On the other hand, many specialists from applied mathematics seem to prefer more formal analytical and numerical methods and representations. Nevertheless, very often the internal development of disciplines from applied mathematics led to geometric models, and occasionally breakthroughs were b~ed on geometric insights. An excellent example is the Klee-Minty cube, solving a problem of linear programming by transforming it into a geomet ric problem. Also the development of convex programming in recent decades demonstrated the power of methods that evolved within the field of convex geometry. The present book focuses on three applied disciplines: control theory, location science and computational geometry. It is our aim to demonstrate how methods and topics from convex geometry in a wider sense (separation theory of convex cones, Minkowski geometry, convex partitionings, etc.) can help to solve various problems from these disciplines.