Intelligent gradient search in linear programming (Q1071647)
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: Intelligent gradient search in linear programming |
scientific article; zbMATH DE number 3939088
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Intelligent gradient search in linear programming |
scientific article; zbMATH DE number 3939088 |
Statements
Intelligent gradient search in linear programming (English)
0 references
1985
0 references
The authors discuss practical aspects and modifications of the polynomial-time algorithm for linear programming by \textit{N. Karmarkar} [Combinatorica 4, 373-395 (1984; Zbl 0557.90065)]. The method has been tested for small and medium size problems and compares favorably with two other LP codes based on the simplex method.
0 references
gradient methods
0 references
implementation
0 references
practical aspects
0 references
modifications
0 references
polynomial-time algorithm
0 references
