Semi-infinite programming, differentiability and geometric programming: Part II

summary:The authors deal with a certain specialization of their theory of duality on the case where the objective function is simple continuously differentiable and convex on the set $K$ of the admissible solutions and the constraint functions defining $K$ are continuously differentiable and concave. Further, a way is shown how to generalize the account to the case where the constraint functions of the problem are simple piecewise differentiable and concave. The obtained conditions can be considered as a generalization of Kuhn-Tucher's theorem