scientific article; zbMATH DE number 1135749
From MaRDI portal
Publication:4381220
Recommendations
Cited in
(14)- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- Exploiting special structure in Karmarkar's linear programming algorithm
- Updating lower bounds when using Karmarkar's projective algorithm for linear programming
- Improving complexity of Karmarkar's approach for linear programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
- On the Performance of Karmarkar's Algorithm
- scientific article; zbMATH DE number 4079165 (Why is no real title available?)
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
- scientific article; zbMATH DE number 4128654 (Why is no real title available?)
- A Modified Termination Rule for Karmarkar’s Algorithm
- On the improvement per iteration in Karmarkar's algorithm for linear programming
- A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm
- An improving procedure of the interior projective method for linear programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4381220)