An enumerative algorithm for computing all possibly optimal solutions to an interval LP (Q456920): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C46 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6348319 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
interval linear programming | |||
| Property / zbMATH Keywords: interval linear programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
optimizing approach | |||
| Property / zbMATH Keywords: optimizing approach / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
possibly optimal solutions | |||
| Property / zbMATH Keywords: possibly optimal solutions / rank | |||
Normal rank | |||
Revision as of 12:51, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An enumerative algorithm for computing all possibly optimal solutions to an interval LP |
scientific article |
Statements
An enumerative algorithm for computing all possibly optimal solutions to an interval LP (English)
0 references
26 September 2014
0 references
interval linear programming
0 references
optimizing approach
0 references
possibly optimal solutions
0 references
