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,801
Discovery Miles 78 010
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,801 Discovery Miles 78 010 | Repayment Terms: R731 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
Promotions
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,189 R1,762 Discovery Miles 17 620
Programming Logic & Design
Joyce Farrell Paperback R800 Discovery Miles 8 000
C++ Programming - Program Design…
D. Malik Paperback R1,751 R1,615 Discovery Miles 16 150
Program Construction - Calculating…
Roland Backhouse Paperback R1,467 Discovery Miles 14 670
Programming Logic & Design…
Joyce Farrell Paperback R1,336 R1,239 Discovery Miles 12 390
Dark Silicon and Future On-chip Systems…
Suyel Namasudra, Hamid Sarbazi-Azad Hardcover R4,186 Discovery Miles 41 860
Temporal Data Mining via Unsupervised…
Yun Yang Paperback R1,242 Discovery Miles 12 420
News Search, Blogs and Feeds - A Toolkit
Lars Vage, Lars Iselid Paperback R1,412 Discovery Miles 14 120
Essential Java for Scientists and…
Brian Hahn, Katherine Malan Paperback R1,341 Discovery Miles 13 410
FORTRAN 90 for Scientists and Engineers
Brian Hahn Paperback R1,440 Discovery Miles 14 400
Java How to Program, Late Objects…
Paul Deitel, Harvey Deitel Paperback R900 R750 Discovery Miles 7 500
The Data Quality Blueprint - A Practical…
John Parkinson Hardcover R1,703 Discovery Miles 17 030

See more

Partners