This paper devotes to the quasi \varepsilon-solution for robust semi-infinite optimization problems (RSIP) involving a locally Lipschitz objective function and infinitely many locally Lipschitz constraint functions with data uncertainty. Under the fulfillment of robust type Guignard constraint qualification and robust type Kuhn-Tucker constraint qualification, a necessary condition for a quasi \varepsilon-solution to problem (RSIP). After introducing the generalized convexity, we give a sufficient optimality for such a quasi \varepsilon-solution to problem (RSIP). Finally, we also establish approximate duality theorems in term of Wolfe type which is formulated in approximate form.

 

Additional Information

Author(s)

 Wangkeeree, Rabian, Khantree, Chanoksuda

DOI

https://doi.org/10.37193/CJM.2019.03.16