Author:
Ha Nguyen Xuan,Van Luu Do
Abstract
Under suitable assumptions we establish the formulas for calculating generalised gradients and generalised directional derivatives in the Clarke sense of the supremum and the infimum of an infinite family of Lipschitz functions. From these results we derive the results ensuring such a supremum or infimum are an invex function when all functions of the invex. Applying these results to a class of mathematical programs, we obtain necessary and sufficient conditions for optimality.
Publisher
Cambridge University Press (CUP)
Reference15 articles.
1. Generalized invexity for nonsmooth vector-valued mappings
2. Higher-order optimality condition for a minimax;Luu;Bull. Austral. Math. Soc.,1996
3. Sufficient optimality conditions under invexity hypotheses;Luu;Vietnam J. Math.,2000
4. Strong and weak invexity in mathemtical programming;Jeyakumar;methods Oper. Res.,1985
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献