Abstract
This paper is concerned with a multiobjective convex polynomial problem, where the objective and constraint functions are first-order scaled diagonally dominant sums-of-squares convex polynomials. We first establish necessary and sufficient optimality criteria in terms of second-order cone (SOC) conditions for (weak) efficiencies of the underlying multiobjective optimization problem. We then show that the obtained result provides us a way to find (weak) efficient solutions of the multiobjective program by solving a scalar second-order cone programming relaxation problem of a given weighted-sum optimization problem. In addition, we propose a dual multiobjective problem by means of SOC conditions to the multiobjective optimization problem and examine weak, strong and converse duality relations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
