C++ 三目标优化问题解支配关系比较算法

以下是用C++比较两个解之间关系的示例代码：\n\ncpp\n#include <iostream>\n#include <vector>\n\n// 定义一个结构体表示解的目标值\nstruct Solution {\n std::vector<int> objectives;\n};\n\n// 判断解y1是否支配解y2\nbool dominates(const Solution& y1, const Solution& y2) {\n bool dominates = true;\n\n for (size_t i = 0; i < y1.objectives.size(); i++) {\n if (y1.objectives[i] > y2.objectives[i]) {\n dominates = false;\n break;\n }\n }\n\n return dominates;\n}\n\nint main() {\n Solution y1, y2;\n\n std::cout << "输入第一个解y1的目标值：";\n for (int i = 0; i < 3; i++) {\n int objective;\n std::cin >> objective;\n y1.objectives.push_back(objective);\n }\n\n std::cout << "输入第二个解y2的目标值：";\n for (int i = 0; i < 3; i++) {\n int objective;\n std::cin >> objective;\n y2.objectives.push_back(objective);\n }\n\n if (dominates(y1, y2)) {\n std::cout << "解y1支配y2" << std::endl;\n } else {\n std::cout << "解y1不支配y2" << std::endl;\n }\n\n return 0;\n}\n\n\n运行程序后，根据提示输入两个解的目标值，程序将会输出解y1是否支配解y2。如果解y1支配解y2，则输出"解y1支配y2"，否则输出"解y1不支配y2"。