SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
In this article, we study nonsmooth convex minimax programming problems with cone constraint and abstract constraint. Our aim is to develop sequential Lagrange multiplier rules for this class of problems in the absence of any constraint qualification. These rules are obtained in terms of ∊-subdifferentials of the functions. As an application of these rules, a sequential dual is proposed and sequential duality results are presented.
In this paper we consider certain prop- erties of an general access structure and its dual. In particular we prove that corer = corerL. We also es- tablish a new upper bound for the size of MSP, which computes connected access structure I?. We show that the size of a MSP is limited above by the sum of the number of minimal and the number of maximal sets minus one. This is the first upper bound on the size of MSPs to our knowledge.