Optimality and solutions for conic robust multiobjective programs

This paper presents a robust framework for handling a conic multiobjective linear optimization problem, where the objective and constraint functions are involving affinely parameterized data uncertainties. More precisely, we examine optimality conditions and calculate efficient solutions of the conic robust multiobjective linear problem. We provide necessary and sufficient linear conic criteria for efficiency of the underlying conic robust multiobjective linear program. It is shown that such optimality conditions can be expressed in terms of linear matrix inequalities and second-order conic conditions for a multiobjective semidefinite program and a multiobjective second order conic program, respectively. We show how efficient solutions of the conic robust multiobjective linear problem can be found via its conic programming reformulation problems including semidefinite programming and second-order cone programming problems. Numerical examples are also provided to illustrate that the proposed conic programming reformulation schemes can be employed to find efficient solutions for concrete problems including those arisen from practical applications. © The Author(s) 2025.