Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study convex multi-objective Mixed Integer Non-Linear Programming problems (MINLPs), which are characterized by multiple objective functions and non linearities, features that appear in real-world applications. To derive a good approximated set of non-dominated points for convex multi-objective MINLPs,  propose a heuristic based on a branch-and-bound algorithm. It starts with a set of feasible points, obtained, at the root node of the enumeration tree, by iteratively solving, with an e-constraint method, a single objective model that incorporates the other objective functions as constraints. Lor bounds are derived by optimally solving Non-Linear Programming problems (NLPs). Each leaf node of the enumeration tree corresponds to a convex multi-objective NLP, which is solved heuristically by varying the ights in a ighted sum approach. In order to improve the obtained points and remove dominated ones, a tailored refinement procedure is designed. Although the proposed method makes no assumptions on the number of objective functions nor on the type of the variables,  test it on bi-objective mixed binary problems. In particular, as a proof-of-concept,  tested the proposed heuristic algorithm on instances of a real-world application concerning por generation, and instances of the convex biobjective Non-Linear Knapsack Problem.  compared the obtained results with those derived by ll-known scalarization methods, showing the effectiveness of the proposed method.
['Valentina Cacchiani', 'Claudia D’Ambrosio']
I am writing a research paper on a idea A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
[{"from": "human", "value": "I am writing a research paper on a idea A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study convex multi-objective Mixed Integer Non-Linear Programming problems (MINLPs), which are characterized by multiple objective functions and non linearities, features that appear in real-world applications. To derive a good approximated set of non-dominated points for convex multi-objective MINLPs,  propose a heuristic based on a branch-and-bound algorithm. It starts with a set of feasible points, obtained, at the root node of the enumeration tree, by iteratively solving, with an e-constraint method, a single objective model that incorporates the other objective functions as constraints. Lor bounds are derived by optimally solving Non-Linear Programming problems (NLPs). Each leaf node of the enumeration tree corresponds to a convex multi-objective NLP, which is solved heuristically by varying the ights in a ighted sum approach. In order to improve the obtained points and remove dominated ones, a tailored refinement procedure is designed. Although the proposed method makes no assumptions on the number of objective functions nor on the type of the variables,  test it on bi-objective mixed binary problems. In particular, as a proof-of-concept,  tested the proposed heuristic algorithm on instances of a real-world application concerning por generation, and instances of the convex biobjective Non-Linear Knapsack Problem.  compared the obtained results with those derived by ll-known scalarization methods, showing the effectiveness of the proposed method."}]