We consider a generalized semi-infinite programming problem (GSIP) with one semi-infinite constraint where the index set depends on the variable to be minimized. Keeping in mind the integral global optimization method of Zheng & Chew and its modifications we would like to outline theoretical considerations for determining coarse approximations of a solution of (GSIP) via global optimization of ...

With a common background and motivation, the main contributions of this paper are developed in two different directions. Firstly, we are concerned with functions, which are the maximum of a finite amount of continuously differentiable functions of n real variables, paying special attention to the case of polyhedral functions. For these max-functions, we obtain some results about outer limits of...

This paper concerns applications of advanced techniques of variational analysis and generalized differentiation to problems of semi-infinite and infinite programming with feasible solution sets defined by parameterized systems of infinitely many linear inequalities of the type intensively studied in the preceding development [5) from our viewpoint of robust Lipschitzian stability. We present me...

A semi-infinite programming problem is an optimization problem in which finitely many variables appear in infinitely many constraints. This model naturally arises in an abundant number of applications in different fields of mathematics, economics and engineering. The paper, which intends to make a compromise between an introduction and a survey, treats the theoretical basis, numerical methods, ...

In this paper,we treat fuzzy linear programming problemswith uncertain parameterswhose ranges are specified as fuzzy polytopes. The problem is formulated as a necessity measure optimization model. It is shown that the problem can be reduced to a semi-infinite programming problem and solved by a combination of a bisection method and a relaxation procedure. An algorithm in which the bisection met...