Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming (Q3780756): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02592079 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076658620 / rank | |||
Normal rank | |||
Latest revision as of 08:53, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming |
scientific article |
Statements
Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming (English)
0 references
1987
0 references
Karmarkar's algorithm
0 references
duality
0 references
cutting objective
0 references
polynomial-time complexity
0 references
0 references
0 references
