An interactive algorithm to find the most preferred solution of multi-objective integer programs (Q342783)
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: An interactive algorithm to find the most preferred solution of multi-objective integer programs |
scientific article; zbMATH DE number 6654537
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An interactive algorithm to find the most preferred solution of multi-objective integer programs |
scientific article; zbMATH DE number 6654537 |
Statements
An interactive algorithm to find the most preferred solution of multi-objective integer programs (English)
0 references
18 November 2016
0 references
multi-objective optimization
0 references
integer programming
0 references
linear programming
0 references
convex cones
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9525451
0 references
0.9463124
0 references
0.9375058
0 references
0.93601835
0 references
0.92934346
0 references
