A variation on Karmarkar’s algorithm for solving linear programming problems (Q3030578): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A modification of Karmarkar's linear programming algorithm / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02592024 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026021734 / rank | |||
Normal rank | |||
Latest revision as of 08:33, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A variation on Karmarkar’s algorithm for solving linear programming problems |
scientific article |
Statements
A variation on Karmarkar’s algorithm for solving linear programming problems (English)
0 references
1986
0 references
nondegeneracy
0 references
Karmarkar algorithm
0 references
