Publication:4435041
From MaRDI portal
zbMath1075.90537MaRDI QIDQ4435041
Publication date: 26 November 2003
90C05: Linear programming
Related Items
Exterior point simplex-type algorithms for linear and network optimization problems, Pivot versus interior point methods: Pros and cons, Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied, The \(s\)-monotone index selection rules for pivot algorithms of linear programming