A numerical study of an infeasible primal-dual path-following algorithm for linear programming (Q884611)
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: A numerical study of an infeasible primal-dual path-following algorithm for linear programming |
scientific article; zbMATH DE number 5162001
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A numerical study of an infeasible primal-dual path-following algorithm for linear programming |
scientific article; zbMATH DE number 5162001 |
Statements
A numerical study of an infeasible primal-dual path-following algorithm for linear programming (English)
0 references
6 June 2007
0 references
linear programming
0 references
infeasible primal-dual path-following methods
0 references
comparison of methods
0 references
algorithm
0 references
numerical examples
0 references
Karmarkar algorithm
0 references
