An analysis of an available set of linear programming test problems (Q1113798): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3844775 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An analysis of an available set of linear programming test problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving staircase linear programs by the simplex method, 1: Inversion / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational experience with a dual affine variant of Karmarkar's method for linear programming / rank | |||
Normal rank | |||
Revision as of 10:26, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An analysis of an available set of linear programming test problems |
scientific article |
Statements
An analysis of an available set of linear programming test problems (English)
0 references
1989
0 references
A set of linear programming test problems is analyzed with MINOS, Version 5.1. The problems have been run with different options for scaling and partial pricing to illustrate the effects of these options on the performance of the simplex method. The results indicate that the different options can significantly improve or degrade the performance of the simplex method, and that these options must be chosen wisely. For some of the problems, a picture of the nonzero stucture of the matrix A is also presented so that the problems can be classified according to structure.
0 references
test problems
0 references
MINOS
0 references
simplex method
0 references
