Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-28T15:04:47.570Z Has data issue: false hasContentIssue false
  • English
  • Français

On properties of semipreinvex functions

Published online by Cambridge University Press:  17 April 2009

X. M. Yang ,
X. Q. Yang  and
K. L. Teo
X. M. Yang
Affiliation:
Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China
K. L. Teo
Affiliation:
Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China
Rights & Permissions [Opens in a new window]

Abstract

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.

In this paper, we first discuss some basic properties of semipreinvex functions. We then show that the ratio of semipreinvex functions is semipreinvex, which extends earlier results by Khan and Hanson [6] and Craven and Mond [3]. Finally, saddle point optimality criteria are developed for a multiobjective fractional programming problem under semipreinvexity conditions.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 68 , Issue 3 , December 2003 , pp. 449 - 459
Copyright
Copyright © Australian Mathematical Society 2003

References

[1]Bector, C.R., Chandra, S. and Bector, M.K., ‘Generalized fractional programming duality: a parametric approach’, J. Optim. Theory Appl. 60 (1989), 243–260.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. and Mond, B., ‘Fractional programming with invexity’, in Progress in optimization, Appl. Optim. 30 (Kluwer Acad. Publ., Dordrecht, 1999), pp. 79–89.CrossRefGoogle Scholar
[4]Hanson, M.A., ‘On sufficiency of the Kuhn-Tucker conditions’, J. Math. Anal. Appl. 80 (1981), 544–550.CrossRefGoogle Scholar
[5]Geoffrion, A.M., ‘Proper efficiency and the theory of vector maximization’, J. Math. Anal. Appl. 22 (1968), 618–630.CrossRefGoogle Scholar
[6]Kahn, Z.A. and Hanson, M.A., ‘On ratio invexity in mathematical programming’, J. Math. Anal. Appl. 205 (1997), 330–336.CrossRefGoogle Scholar
[7]Kaul, R.N. and Lyall, V., ‘A note on nonlinear fractional vector maximization’, Opsearch 26 (1989), 108–121.Google Scholar
[8]Noor, M.A., ‘Nonconvex function and variational inequalities’, J. Optim. Theory Appl. 87 (1995), 615–630.CrossRefGoogle Scholar
[9]Weir, T. and Jeyakumar, V., ‘A class of nonconvex functions and mathematical programming’, Bull. Austral. Math. Soc. 38 (1988), 177–189.CrossRefGoogle Scholar
[10]Weir, T. and Mond, B., ‘Pre-invex functions in multiple objective optimization’, J. Math. Anal. Appl. 136 (1988), 29–38.CrossRefGoogle Scholar
[11]Yang, X.Q. and Chen, G.Y., ‘A class of nonconvex functions and pre-variational inequalities’, J. Math. Anal. Appl. 169 (1992), 359–373.CrossRefGoogle Scholar