由于广义半无限极大极小问题的极大函数的约束集合随x的变化而变化,增加了对该问题的理论分析和求解难度。为了克服这种情况,许多研究者考虑通过转化消除约束集合中的约束f(x,y)≤0。本文是通过一类由1范数定义的精确罚,将广义的半无限极大极小规划中的约束条件消除,使该问题转化为半无限极小极大极小规划。在不需要假设集合的条件下证明,当罚参数充分大时,半无限极小极大极小规划与广义半无限极大极小问题具有相同的最优值,相同的局部最优解以及相同的全局最优解。利用这种等价性,进一步给出了广义半无限极大极小问题的一个最优性条件。最后,对本文中建立的最优性条件与其它文献中的最优性条件之间的关系进行了讨论。
Generalized semi-infinite min-max problem has important relations with optimal control and information technology. It can be used in various engineering fields. So it is very interesting to study the generalized semi-infinite min-max problem. However, since the constraint set change as the variable x changes, the generalized semi-infinite rain-max problem is difficult to be solved. To overcome these difficulties, investigators have developed many important progresses of generalized semi-infinite min-max programs. In this paper, we use 11 exact penalty function to remove the constraint conditions of a generalized semi-infinite min-max problem, and then convert this problem into a semi-infinite min-max-min problem. Without the compactness assumption, we prove that the generalized semi-infinite rain-max problem has the same optimal value, the same set of local and global solutions as the corresponding semi-infinite min- max-min problem, when the penalty parameter is sufficiently large. Using these results, we give an optimality condition for the generalized semi-infinite rain-max problem. Furthermore, we discuss the relations between the optimality condition given in this paper and other existing optimality conditions.