In this paper, we establish the upper semicontinuity and lower semicontinuity of solution mappings to a parametric generalized strong vector equilibrium problem with setvalued mappings by using a scalarization method and a density result. The results improve the corresponding ones in the...

In this paper, a notion of Levitin–Polyak (LP in short) well-posedness is introduced for a vector optimization problem in terms of minimizing sequences and efficient solutions. Sufficient conditions for the LP well-posedness are studied under the assumptions of compactness of the feasible set,...

In this paper we apply two convexification procedures to the Lagrangian of a nonconvex semi-infinite programming problem. Under the reduction approach it is shown that, locally around a local minimizer, this problem can be transformed equivalently in such a way that the transformed Lagrangian...

The second-order cone program (SOCP) is an optimization problem with second-order cone (SOC) constraints and has achieved notable developments in the last decade. The classical semi-infinite program (SIP) is represented with infinitely many inequality constraints, and has been studied...

This paper aims to study a broad class of generalized semi-infinite programming problems with (upper and lower level) objectives given as the difference of two convex functions, and (lower level) constraints described by a finite number of convex inequalities and a set constraints. First, we are...