Finding duplicate rows in a linear programming model (Q1090077): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 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)90093-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027814833 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Formal optimization of some reduced linear programming problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A pathological case in the reduction of linear programs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:14, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding duplicate rows in a linear programming model |
scientific article |
Statements
Finding duplicate rows in a linear programming model (English)
0 references
1986
0 references
An algorithm for identifying and disposing of duplicate rows in a linear programming matrix is presented. This approach allows to reduce the model size in linear programming problems which decreases the cost of solution as well. It may also detect infeasible models and remove a potential source of numerical trouble in the simplex method. An example is presented, and computational experience is reported.
0 references
size reduction
0 references
duplicate rows
0 references
linear programming matrix
0 references
simplex method
0 references
