Optimality conditions for semi-infinite programming problems involving generalized convexity

摘要

We apply some advanced tools of quasiconvex analysis to establish Karush-Kuhn-Tucker type necessary and sufficient optimality conditions for non-differentiable semi-infinite programming problems. In addition, we propose a linear characterization of optimality for the mentioned problems. Examples are also designed to analyze and illustrate the results obtained.