0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming

Buy Now

Geometric Methods and Optimization Problems (Hardcover, 1999 ed.) Loot Price: R7,604
Discovery Miles 76 040
Geometric Methods and Optimization Problems (Hardcover, 1999 ed.): Vladimir Boltyanski, Horst Martini, V. Soltan

Geometric Methods and Optimization Problems (Hardcover, 1999 ed.)

Vladimir Boltyanski, Horst Martini, V. Soltan

Series: Combinatorial Optimization, 4

 (sign in to rate)
Loot Price R7,604 Discovery Miles 76 040 | Repayment Terms: R713 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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."

General

Imprint: Springer
Country of origin: Netherlands
Series: Combinatorial Optimization, 4
Release date: 2001
First published: 1999
Authors: Vladimir Boltyanski • Horst Martini • V. Soltan
Dimensions: 234 x 156 x 25mm (L x W x T)
Format: Hardcover
Pages: 432
Edition: 1999 ed.
ISBN-13: 978-0-7923-5454-3
Categories: Books > Science & Mathematics > Mathematics > Probability & statistics
Books > Computing & IT > Computer programming > General
Books > Science & Mathematics > Mathematics > Applied mathematics > General
LSN: 0-7923-5454-0
Barcode: 9780792354543

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Problem Solving with C++ - Global…
Walter Savitch Paperback R2,400 Discovery Miles 24 000
C++ Programming - Program Design…
D. Malik Paperback R1,660 R1,485 Discovery Miles 14 850
Program Construction - Calculating…
Roland Backhouse Paperback R1,358 Discovery Miles 13 580
Programming Logic & Design…
Joyce Farrell Paperback R1,253 R1,123 Discovery Miles 11 230
C++ How to Program: Horizon Edition
Harvey Deitel, Paul Deitel Paperback R1,779 Discovery Miles 17 790
Starting Out with Python, Global Edition
Tony Gaddis Paperback R2,272 R2,114 Discovery Miles 21 140
Java How to Program, Late Objects…
Paul Deitel, Harvey Deitel Paperback R900 R750 Discovery Miles 7 500
Data Abstraction and Problem Solving…
Janet Prichard, Frank Carrano Paperback R2,163 Discovery Miles 21 630
The Data Quality Blueprint - A Practical…
John Parkinson Hardcover R1,581 Discovery Miles 15 810
Using UML - Software Engineering with…
Perdita Stevens Paperback R2,169 Discovery Miles 21 690
Object-Oriented Game Development
Julian Gold Paperback R2,202 R1,648 Discovery Miles 16 480
Software Engineering for Real-Time…
Jim Cooling Paperback R2,301 R2,036 Discovery Miles 20 360

See more

Partners