Abstract
In this paper, we prove a necessary optimality theorem for a nonsmooth optimization problem in the face of data uncertainty, which is called a robust optimization problem. Recently, the robust optimization problems have been intensively studied by many authors. Moreover, we give examples showing that the convexity of the uncertain sets and the concavity of the constraint functions are essential in the optimality the- orem. We present an example illustrating that our main assumptions in the optimality theorem can be weakened.
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.
