Abstract: In this paper, the sequential max-min problem is considered. At first, an explicit first order condition, called the generalized K-K -T condition, is given and then, by using the secondary aggregate function technique and the homotopy method, a smooth path following method is given to find a generalized K-K-T point.

Key words: nonsmooth programming, sequential max-min, aggregate function, homoto py method