Practical finite pivoting rules for the simplex method (Q751498): Difference between revisions

@@ Property / cites work @@
+On the choice of the pivot columns of the simplex-method: Gradient criteria
+Normal rank
@@ Property / cites work @@
+New Finite Pivoting Rules for the Simplex Method
@@ Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank @@
+Normal rank
@@ Property / cites work @@
+Optimality and Degeneracy in Linear Programming
@@ Property / cites work: Optimality and Degeneracy in Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3844775
@@ Property / cites work: Q3844775 / rank @@
+Normal rank
@@ Property / cites work @@
+A practicable steepest-edge simplex algorithm
@@ Property / cites work: A practicable steepest-edge simplex algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Worst case behavior of the steepest edge simplex method
+Normal rank
@@ Property / cites work @@
+The simplex algorithm with the pivot rule of maximizing criterion improvement
+Normal rank
@@ Property / cites work @@
+A class of linear programming problems requiring a large number of iterations
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+A Technique for Resolving Degeneracy in Linear Programming
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01721801
+Normal rank
@@ Property / OpenAlex ID @@
+W2078552136
@@ Property / OpenAlex ID: W2078552136 / rank @@
+Normal rank