| 書目名稱 | The Simplex Method |
| 副標(biāo)題 | A Probabilistic Anal |
| 編輯 | Karl Heinz Borgwardt |
| 視頻video | http://file.papertrans.cn/920/919772/919772.mp4 |
| 叢書名稱 | Algorithms and Combinatorics |
| 圖書封面 |  |
| 描述 | 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 |
| 出版日期 | Book 1987 |
| 關(guān)鍵詞 | Gaussian distribution; Normal distribution; Probability space; Variance; calculus; combinatorics |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-61578-8 |
| isbn_softcover | 978-3-540-17096-9 |
| isbn_ebook | 978-3-642-61578-8Series ISSN 0937-5511 Series E-ISSN 2197-6783 |
| issn_series | 0937-5511 |
| copyright | Springer-Verlag Berlin Heidelberg 1987 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-10 07:02
發(fā)表于 2025-3-21 17:19:06
