A finite conformal-elimination free algorithm over oriented matroid programming (Q1092810): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:10, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A finite conformal-elimination free algorithm over oriented matroid programming |
scientific article |
Statements
A finite conformal-elimination free algorithm over oriented matroid programming (English)
0 references
1987
0 references
This paper presents a new finite pivoting method for oriented matroid programming which works principally on the smallest subscript rule appealing to no process of conformal elimination. In particular, when the oriented matroid programming under consideration is a linear program, the process of conformal elimination is just the process of minimum ratio test.
0 references
finite pivoting method
0 references
oriented matroid programming
0 references
conformal elimination
0 references
minimum ratio test
0 references
