Nonadjacent extreme point methods for solving linear programs (Q3673477): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4673630 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4177319 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4178772 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The simplex algorithm with the pivot rule of maximizing criterion improvement / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3252270 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4132007 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5629405 / rank | |||
Normal rank | |||
Revision as of 09:36, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonadjacent extreme point methods for solving linear programs |
scientific article |
Statements
Nonadjacent extreme point methods for solving linear programs (English)
0 references
1983
0 references
nonadjacent extreme point methods
0 references
block pivoting
0 references
advanced basis
0 references
relaxation method
0 references
feasible directions method
0 references
optimal basis
0 references
reduced gradient method
0 references
dual linear programs
0 references
binding hyperplanes
0 references
two phase simplex method
0 references
randomly generated test problems
0 references
numerical comparison of algorithms
0 references
