Sufficient optimality criteria and duality for variational problems with generalised invexity

Abstract A number of Kuhn-Tucker type sufficient optimality criteria for a class of variational problems under weaker invexity assumptions are presented. As an application of these optimality results, various Mond-Weir type duality results are proved under a variety of generalised invexity assumptions. These results generalise many well-known duality results of variational problems and also give a dynamic analogue of certain corresponding (static) results relating to duality with generalised invexity in mathematical programming.

[1]  W. Ziemba,et al.  Generalized concavity in optimization and economics , 1981 .

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

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

[4]  N. Wormald A 4-chromatic graph with a special plane drawing , 1979 .

[5]  B. D. Craven,et al.  A class of nondifferentiable continuous programming problems , 1985 .

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

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

[8]  Olvi L. Mangasarian,et al.  Nonlinear Programming , 1969 .

[9]  M. A. Hanson,et al.  Duality for variational problems , 1967 .

[10]  B. Mond,et al.  Generalized concavity and duality in continuous programming , 1984 .

[11]  Bertram Mond,et al.  Duality with generalized convexity , 1986, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[12]  B. Mond,et al.  Duality for variational problems with invexity , 1988 .