loading page

On approximate solutions for convex semi-infinite programming with uncertainty
  • Ke Su,
  • Yumeng Lin,
  • Chen Wang
Ke Su
Hebei University
Author Profile
Yumeng Lin
Hebei University
Author Profile
Chen Wang
Hebei University
Author Profile


In this paper, we consider approximate solutions (also called $\varepsilon$-solutions) for semi-infinite optimization problems that objective function and constraint functions with uncertainty data are all convex, and establish robust counterpart of convex semi-infinite program and then consider approximate solutions for its. Moreover, the robust necessary condition and robust sufficient theorems are obtained. Then the duality results of the Lagrangian dual approximate solution is given by the robust optimization approach under a cone constraint qualification.

Peer review status:UNDER REVIEW

14 Dec 2020Submitted to Mathematical Methods in the Applied Sciences
16 Dec 2020Assigned to Editor
16 Dec 2020Submission Checks Completed
19 Dec 2020Reviewer(s) Assigned