Abstract
ABSTRACT In this paper, we study the solvability of a nonconvex regular polynomial vector optimization problem on a nonempty closed set. We introduce regularity conditions for the polynomial vector optimization problem and study their properties and characterizations. Under the regularity conditions, we establish the nonemptiness and boundedness of the solution sets of the problem. As a by-product, we infer two Frank–Wolfe type theorems for the nonconvex polynomial vector optimization problem. Finally, we investigate the solution stability of the problem.
Sign-in/Register to access full text options 
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.
