Academic Journal
On the number of degenerate simplex pivots.
| Τίτλος: | On the number of degenerate simplex pivots. |
|---|---|
| Συγγραφείς: | Kukharenko, Kirill1 (AUTHOR) kirill.kukharenko@ovgu.de, Sanità, Laura2 (AUTHOR) laura.sanita@unibocconi.it |
| Πηγή: | Mathematical Programming. Mar2026, Vol. 216 Issue 1/2, p757-791. 35p. |
| Θεματικοί όροι: | *Linear programming, Simplex algorithm, Polyhedra, Iterative methods (Mathematics) |
| Περίληψη: | The simplex algorithm is one of the most popular algorithms to solve linear programs (LPs). Starting at an extreme point solution of an LP, it performs a sequence of basis exchanges (called pivots) that allows one to move to a better extreme point along an improving edge-direction of the underlying polyhedron. A key issue in the simplex algorithm's performance is degeneracy, which may lead to a (potentially long) sequence of basis exchanges which do not change the current extreme point solution. In this paper, we prove that one can employ any improving feasible direction at an extreme point to limit the number of consecutive degenerate pivots that the simplex algorithm performs to n - m - 1 , where n is the number of variables and m is the number of equality constraints of a given LP in standard equality form. [ABSTRACT FROM AUTHOR] |
| Copyright of Mathematical Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Business Source Index |
καταχωρήστε σχόλιο πρώτοι!