Determining basic variables of optimal solutions in Karmarkar's new LP algorithm (Q1113799): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3323698 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
Latest revision as of 11:26, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determining basic variables of optimal solutions in Karmarkar's new LP algorithm |
scientific article |
Statements
Determining basic variables of optimal solutions in Karmarkar's new LP algorithm (English)
0 references
1986
0 references
This paper establishes a sufficient condition for a variable of a linear program to be positive at all optimal solutions. A numerical test using the condition is incorporated into Karmarkar's new LP algorithm to determine columns of optimal basis. Experimental results on the test are also reported.
0 references
Karmarkar's algorithm
0 references
optimal basis
0 references
