Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-25T06:15:41.407Z Has data issue: false hasContentIssue false
  • English
  • Français

Invexity at a point: generalisations and classification

Published online by Cambridge University Press:  17 April 2009

S. Mititelu  and
I.M. Stancu-Minasian
S. Mititelu
Affiliation:
Department of Mathematics, Institute of Civil Engineering, Bucharest, Romania
I.M. Stancu-Minasian
Affiliation:
Centre of Mathematical, Statistics The Romanian Academy Bd Magheru, 22 RO-70158 Bucharest 22, Romania
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

This paper uses Clarke’s generalised directional derivative to describe several types of invexity, pseudoinvexity and quasiinvexity at a point of a nonlinear function. Direct implications of the relations existing between the various types of invexity and generalised invexity are presented, as well as a block diagram of these implications. In particular, similar results in the class of quasiconvex functions are obtained.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 48 , Issue 1 , August 1993 , pp. 117 - 126
Copyright
Copyright © Australian Mathematical Society 1993

References

[1]Clarke, F.H., ‘A new approach to Lagrange multipliers’, Math. Oper. Res. 1 (1976), 165–174.CrossRefGoogle Scholar
[2]Craven, B.D., ‘Invex functions and constrained local minima’, Bull. Austral. Math. Soc. 24 (1981), 357–366.CrossRefGoogle Scholar
[3]Craven, B.D., ‘Nondifferentiable optimization by smooth approximation’, Optimization 17 (1986), 3–17.CrossRefGoogle Scholar
[4]Craven, B.D. and Glover, B.M., ‘Invex functions and duality’, J. Austral. Math. Soc. (Ser.A) 39 (1985), 1–20.CrossRefGoogle Scholar
[5]Giorgi, G. and Mititelu, S., ‘Invexity in nonsmooth programming’, in Atti del Tredicesimo Convegno A.M.A.S.E.S., Verona, 13–15 Settembre 1989 (Pitagora Editrice Bologna), pp. 509–520.Google Scholar
[6]Giorgi, G. and Mititelu, S., ‘Convexités généralisées et properietés’, Rev. Roumaine Math. Pures Appl. 38 (1993), 125–172.Google Scholar
[7]Hanson, M.A., ‘On sufficiency of the Kuhn-Tucker conditions’, J. Math. Anal. Appl. 80 (1981), 545–550.CrossRefGoogle Scholar
[8]Jeyakumar, V., ‘Strong and weak invexity in mathematical programming’, Methods Oper. Res. 55 (1985), 109–125.Google Scholar
[9]Jeyakumar, V., ‘ρ–Convexity and second order duality’, Utilitas Math. 29 (1986), 71–85.Google Scholar
[10]Kaul, R.N. and Kaur, S., ‘Optimality criteria in nonlinear programming involving nonconvex functions’, J. Math. Anal. Appl. 105 (1985), 104–112.CrossRefGoogle Scholar
[11]Mititelu, S., ‘Conditions Kuhn-Tucker et dualité Wolfe dans la programation non Lipschitzienne’, Bull. Math. Soc. Sci. Math. Roumanie 37 (85) (1993).Google Scholar
[12]Preda, V., ‘Generalized invexity for a class of programming problems’, Stud. Cerc. Mat. 42 (1990), 304–316.Google Scholar
[13]Vial, J.-P., ‘Strong and weak convexity of sets and functions’, Math. Oper. Res. 8 (1983), 231–259.CrossRefGoogle Scholar