The Simplex Method: A Probabilistic Analysis - Algorithms and Combinatorics 1 (Paperback)
  • The Simplex Method: A Probabilistic Analysis - Algorithms and Combinatorics 1 (Paperback)
zoom

The Simplex Method: A Probabilistic Analysis - Algorithms and Combinatorics 1 (Paperback)

(author)
£74.99
Paperback 270 Pages / Published: 01/11/1986
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
For more than 35 years now, George B. Dantzig's Simplex-Method has been the most efficient mathematical tool for solving linear programming problems. It is proba- bly that mathematical algorithm for which the most computation time on computers is spent. This fact explains the great interest of experts and of the public to understand the method and its efficiency. But there are linear programming problems which will not be solved by a given variant of the Simplex-Method in an acceptable time. The discrepancy between this (negative) theoretical result and the good practical behaviour of the method has caused a great fascination for many years. While the "worst-case analysis" of some variants of the method shows that this is not a "good" algorithm in the usual sense of complexity theory, it seems to be useful to apply other criteria for a judgement concerning the quality of the algorithm. One of these criteria is the average computation time, which amounts to an anal- ysis of the average number of elementary arithmetic computations and of the number of pivot steps. A rigid analysis of the average behaviour may be very helpful for the decision which algorithm and which variant shall be used in practical applications. The subject and purpose of this book is to explain the great efficiency in prac- tice by assuming certain distributions on the "real-world" -problems. Other stochastic models are realistic as well and so this analysis should be considered as one of many possibilities.

Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN: 9783540170969
Number of pages: 270
Weight: 438 g
Dimensions: 235 x 155 x 15 mm
Edition: Softcover reprint of the original 1st ed. 198

You may also be interested in...

Problems in Probability
Added to basket
Combinatorial Optimization
Added to basket
Discrete Mathematics
Added to basket
Proofs from THE BOOK
Added to basket
Proofs and Fundamentals
Added to basket
Introduction to Graph Theory
Added to basket
A Combinatorial Introduction to Topology
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.