Hieu Trung Vu

A connectedness result for convex polynomial multi-objective optimization without boundedness

We prove that the weak Pareto solution set of a multi-objective optimization problem with convex polynomial objectives and constraints is connected, assuming neither boundedness of the constraint set nor a constraint qualification. Since this set is semi-algebraic, its connectedness implies that it is path-connected wh...