Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (Q2001124)
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: Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem |
scientific article; zbMATH DE number 7075514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem |
scientific article; zbMATH DE number 7075514 |
Statements
Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (English)
0 references
2 July 2019
0 references
multi-objective programming
0 references
sum-of-ratio
0 references
multi-objective linear fractional programming
0 references
duality
0 references
branch and bound
0 references
0 references
0 references
0 references
0.8686999678611755
0 references
0.8045945167541504
0 references
0.8036625385284424
0 references
0.7997152209281921
0 references
0.7930131554603577
0 references
