Page 1 of 1
Consider the following biobjective integer knapsack problem (BOIKP): maximize_f(x) = [ƒ1(x) = 8x1 + 9x2 + 3x3, ƒ2(x) = 3
Posted: Thu May 05, 2022 8:57 am
by answerhappygod
- Consider The Following Biobjective Integer Knapsack Problem Boikp Maximize F X F1 X 8x1 9x2 3x3 F2 X 3 1 (87.13 KiB) Viewed 46 times
Consider the following biobjective integer knapsack problem (BOIKP): maximize_f(x) = [ƒ1(x) = 8x1 + 9x2 + 3x3, ƒ2(x) = 3x1 + 2x2 + 10x3] subject to 2x1 + 2x2 + 3x3 ≤ 6 X1, X2, X3 ≥ 0, integer Note: All Pareto outcomes for this problem have integer components. (a) Use the weighted-sum method and/or the epsilon- constraint method and design an optimization process to com- pute all Pareto outcomes to this problem. Present the optimiza- tion process in the form of a multi-step procedure (pseudocode or flowchart) and explain why this process guarantees finding all Pareto outcomes.