Eliminating columns in the simplex method for linear programming (Q1113797): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q173845 |
||
Property / author | |||
Property / author: Yinyu Ye / rank | |||
Revision as of 06:23, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Eliminating columns in the simplex method for linear programming |
scientific article |
Statements
Eliminating columns in the simplex method for linear programming (English)
0 references
1989
0 references
We propose a column-eliminating technique for the simplex method of linear programming. A pricing criterion is developed for checking whether a dual hyperplane corresponding to a column intersects a simplex containing all of the optimal dual feasible solutions. If the dual hyperplane has no intersection with this simplex, we can eliminate the corresponding column from further computation during the course of the simplex method.
0 references
column-eliminating technique
0 references
simplex method
0 references
pricing criterion
0 references
primal and dual methods
0 references
nonbasic variables
0 references
column elimination
0 references