Invexity in multifunction optimization

The concept of invex function is extended to arbitrary multifunctions, without requiring any differentiability property. Relations with the usual invexity for functions are established. For minimization of a vector multifunction objective, subject to a multiftmction inclusion constraint, necessary Lagrangian conditions are obtained, which become sufficient under invexity hypotheses.

[1]  F. Clarke,et al.  Optimal solutions to differential inclusions , 1976 .

[2]  B. M. Glover,et al.  Invex functions and duality , 1985, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[3]  M. A. Hanson,et al.  On duality with generalized convexity , 1984 .

[4]  B. D. Craven.  On quasidifferentiable optimization , 1986 .

[5]  J. Aubin,et al.  Applied Nonlinear Analysis , 1984 .

[6]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[7]  B. Craven.  Nonsmooth multiobjective programming , 1989 .

[8]  Adi Ben-Israel,et al.  What is invexity? , 1986, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[9]  B. D. Craven,et al.  Nondifferentiable optimization by smooth approximations , 1986 .

[10]  B. Craven.  Invex functions and constrained local minima , 1981, Bulletin of the Australian Mathematical Society.

[11]  H. W. Corley,et al.  Optimality conditions for maximizations of set-valued functions , 1988 .

[12]  T. Reiland.  Generalized invexity for nonsmooth vector-valued mappings , 1989 .

[13]  G. A. Garreau,et al.  Mathematical Programming and Control Theory , 1979, Mathematical Gazette.

[14]  M. A. Hanson.  On sufficiency of the Kuhn-Tucker conditions , 1981 .