An algorithm for simplex tableau reduction: The push-to-pull solution strategy (Q1406107)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for simplex tableau reduction: The push-to-pull solution strategy |
scientific article; zbMATH DE number 1977978
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for simplex tableau reduction: The push-to-pull solution strategy |
scientific article; zbMATH DE number 1977978 |
Statements
An algorithm for simplex tableau reduction: The push-to-pull solution strategy (English)
0 references
9 September 2003
0 references
This paper proposes a new general solution algorithm. The algorithm consists of preliminaries, followed by two main phases. The first phase develops a basic variable set, the second phase pulls the solution back to feasibility. Both phases use the usual Gauss pivoting row operation. Some numerical examples illustrate different parts of the new solution algorithm. Also a computer implementation of the algorithm is given.
0 references
linear programming
0 references
basic variable set
0 references
advanced basic
0 references
simplex tableau reduction
0 references
algorithm
0 references
numerical examples
0 references
0 references
0 references
0 references
