- Please Show Full Steps Please Show Full Steps 1 (35.03 KiB) Viewed 23 times
2. Consider the following biobjective integer knapsack problem (BOIKP): maximize f(x) = [fi(x) = 811 +9.12 +373, 82(x) = 3.61 +222 + 10.13] subject to 2.0 +2.02 +3.03 < 6 21, 22, 23 > 0, integer Note: All Pareto outcomes for this problem have integer components. (a) (30 points) 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.