A comparison of interval linear programming with the simplex method (Q1154389): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A suboptimization method for interval linear programming: A new method for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A primal algorithm for interval linear-programming problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5567241 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4673630 / rank | |||
Normal rank | |||
Latest revision as of 11:43, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comparison of interval linear programming with the simplex method |
scientific article |
Statements
A comparison of interval linear programming with the simplex method (English)
0 references
1981
0 references
interval linear programming
0 references
simplex method
0 references
comparison of algorithms
0 references
computational study
0 references
0 references
