Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem (Q1794864)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem |
scientific article; zbMATH DE number 6955029
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem |
scientific article; zbMATH DE number 6955029 |
Statements
Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem (English)
0 references
16 October 2018
0 references
multiobjective linear programming
0 references
interval programming
0 references
minimax regret criterion
0 references
necessarily efficient solutions
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8451480865478516
0 references
0.8346580266952515
0 references
0.8167466521263123
0 references
0.8157913684844971
0 references
0.7932732701301575
0 references
