Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming (Q3780756): Difference between revisions
From MaRDI portal
Latest revision as of 16:32, 18 June 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