A different convergence proof of the projective method for linear programming (Q1088902): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(86)90025-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987920272 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
Latest revision as of 18:42, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A different convergence proof of the projective method for linear programming |
scientific article |
Statements
A different convergence proof of the projective method for linear programming (English)
0 references
1986
0 references
We give a different proof of convergence of the polynomial-time algorithm for linear programming based on projective transformations.
0 references
Karmarkar's algorithm
0 references
proof of convergence
0 references
polynomial-time algorithm
0 references
projective transformations
0 references
