Skip to main content
  • Book
  • © 1987

The Simplex Method

A Probabilistic Analysis

Part of the book series: Algorithms and Combinatorics (AC, volume 1)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (7 chapters)

  1. Front Matter

    Pages i-xi
  2. Introduction

    • Karl Heinz Borgwardt
    Pages 1-61
  3. The Shadow-Vertex Algorithm

    • Karl Heinz Borgwardt
    Pages 62-111
  4. The Average Number of Pivot Steps

    • Karl Heinz Borgwardt
    Pages 112-141
  5. The Polynomiality of the Expected Number of Steps

    • Karl Heinz Borgwardt
    Pages 142-186
  6. Asymptotic Results

    • Karl Heinz Borgwardt
    Pages 187-226
  7. Problems with Nonnegativity Constraints

    • Karl Heinz Borgwardt
    Pages 227-244
  8. Appendix

    • Karl Heinz Borgwardt
    Pages 245-258
  9. Back Matter

    Pages 259-269

About this book

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.

Authors and Affiliations

  • Institute of Mathematics, University of Augsburg, Augsburg, West Germany

    Karl Heinz Borgwardt

Bibliographic Information

  • Book Title: The Simplex Method

  • Book Subtitle: A Probabilistic Analysis

  • Authors: Karl Heinz Borgwardt

  • Series Title: Algorithms and Combinatorics

  • DOI: https://doi.org/10.1007/978-3-642-61578-8

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1987

  • Softcover ISBN: 978-3-540-17096-9Published: 01 November 1986

  • eBook ISBN: 978-3-642-61578-8Published: 06 December 2012

  • Series ISSN: 0937-5511

  • Series E-ISSN: 2197-6783

  • Edition Number: 1

  • Number of Pages: XII, 270

  • Number of Illustrations: 3 b/w illustrations

  • Topics: Combinatorics

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access