This paper surveys some basic properties of the class of generalized semi-infinite programming problems (GSIP) where the infinite index set of inequality constraints depends on the state variables and all emerging functions are assumed to be continuously differentiable. There exists a wide range of applications which can be modelled as a (GSIP). The paper discusses extensions of the Mangasarian-Fromovitz, Kuhn-Tucker and Abadie constraint qualification to (GSIP) and presents related first order optimality conditions of Fritz-John and Karush-Kuhn-Tucker type. By using directional differentiability properties of the optimal value function of the lower level problem, first and second order necessary and sufficient optimality conditions are dis...
The paper concerns the study of new classes of nonlinear and nonconvex optimization problems of the ...
We consider the feasible set of a generalized semi-infinite programming problem with a one-dimension...
In this short paper, we present a new constraint qualification (CQ) for linear semi-infinite program...
This tutorial presents an introduction to generalized semi-infinite programming (GSIP) which in rece...
Generalized semi-infinite programming, extended Mangasarian-Fromovitz, Kuhn-Tucker and Abadie constr...
AbstractThis tutorial presents an introduction to generalized semi-infinite programming (GSIP) which...
Abstract. In this paper, we consider a generalized semi-infinite optimization problem where the inde...
We consider a generalized semi-infinite optimization problem (GSIP) of the form (GSIP) min{f(x) $x (...
This paper is devoted to the study of nonsmooth generalized semi-infinite programming problems in wh...
Generalized semi-infinite optimization problems (GSIP) are considered. The difference between GSIP a...
In this paper, we consider the Abadie and the Basic constraint qualifications (CQ) for lower level ...
AbstractWe investigate two classes of generalized nonsmooth semi-infinite optimization problems in t...
Generalized semi-infinite optimization problems (GSIP) are considered. It is investigated how the nu...
The feasible set M in General Semi-Infinite Programming (GSIP) need not to be closed. This fact is w...
Abstract. This paper concerns applications of advanced techniques of variational analysis and genera...
The paper concerns the study of new classes of nonlinear and nonconvex optimization problems of the ...
We consider the feasible set of a generalized semi-infinite programming problem with a one-dimension...
In this short paper, we present a new constraint qualification (CQ) for linear semi-infinite program...
This tutorial presents an introduction to generalized semi-infinite programming (GSIP) which in rece...
Generalized semi-infinite programming, extended Mangasarian-Fromovitz, Kuhn-Tucker and Abadie constr...
AbstractThis tutorial presents an introduction to generalized semi-infinite programming (GSIP) which...
Abstract. In this paper, we consider a generalized semi-infinite optimization problem where the inde...
We consider a generalized semi-infinite optimization problem (GSIP) of the form (GSIP) min{f(x) $x (...
This paper is devoted to the study of nonsmooth generalized semi-infinite programming problems in wh...
Generalized semi-infinite optimization problems (GSIP) are considered. The difference between GSIP a...
In this paper, we consider the Abadie and the Basic constraint qualifications (CQ) for lower level ...
AbstractWe investigate two classes of generalized nonsmooth semi-infinite optimization problems in t...
Generalized semi-infinite optimization problems (GSIP) are considered. It is investigated how the nu...
The feasible set M in General Semi-Infinite Programming (GSIP) need not to be closed. This fact is w...
Abstract. This paper concerns applications of advanced techniques of variational analysis and genera...
The paper concerns the study of new classes of nonlinear and nonconvex optimization problems of the ...
We consider the feasible set of a generalized semi-infinite programming problem with a one-dimension...
In this short paper, we present a new constraint qualification (CQ) for linear semi-infinite program...