Hostname: page-component-8448b6f56d-gtxcr Total loading time: 0 Render date: 2024-04-25T04:27:29.267Z Has data issue: false hasContentIssue false
  • English
  • Français

A class of nonconvex functions and mathematical programming

Published online by Cambridge University Press:  17 April 2009

T. Weir  and
V. Jeyakumar
T. Weir
Affiliation:
Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Ontario Canada N2L 3G1
V. Jeyakumar
Affiliation:
Department of Mathematics, University College, Australian Defence Force Academy, Campbell, A.C.T. 2600, Australia
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.

A class of functions, called pre-invex, is defined. These functions are more general than convex functions and when differentiable are invex. Optimality conditions and duality theorems are given for both scalar-valued and vector-valued programs involving pre-invex functions.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 38 , Issue 2 , October 1988 , pp. 177 - 189
Copyright
Copyright © Australian Mathematical Society 1988

References

[1]Ben-Isreal, A. and Mond, B., ‘What is invexity?’, J. Austral. Math. Soc. (Ser. B) 28 (1986), 1–9.CrossRefGoogle Scholar
[2]Bitran, G.R., ‘Duality in nonlinear multiple criteria optimisation problems’, J. Optim. Theory Appl. 35 (1982), 367–406.CrossRefGoogle Scholar
[3]Borwein, J.M., Optimisation with Respect to Partial Orderings, D. Phil. Thesis, University of Oxford, 1974.Google Scholar
[4]Corely, B.D., ‘Duality theory for maximizations with respect to cones’, J. Math. Anal. Appl. 84 (1982), 560–568.CrossRefGoogle Scholar
[5]Craven, B.D., ‘Nonlinear programming in locally convex spaces’, J. Optim. Theory Appl. 10 (1972), 197–210.CrossRefGoogle Scholar
[6]Craven, B.D., ‘Lagrangian conditions and quasiduality’, Bull. Austral. Math. Soc. 16 (1977), 325–339.Google Scholar
[7]Craven, B.D., ‘Lagrangian conditions, vector-minimization and local duality’, Dept. Math. University of Melbourne Research Report 37 (1980).Google Scholar
[8]Craven, B.D., ‘Invex functions and constrained local minima’, Bull. Aust. Math. Soc. 24 (1981), 357–366.Google Scholar
[9]Craven, B.D. and Glover, B.M., ‘Invex functions and duality’, J. Austral. Math. Soc. (Ser. A) 39 (1985), 1–20.Google Scholar
[10]Elster, H. and Nehse, R., ‘Optimality conditions for some nonconvex problems’, in Optimization Techniques: Lecture Notes in Control and Information Sciences 23, pp. 1–9 (Springer-Verlag, New York).Google Scholar
[11]Hanson, M.A., ‘On sufficiency of the Kuhn-Tucker conditions’, J. Math. Anal. Appl. 80 (1982), 545–550.CrossRefGoogle Scholar
[12]Hanson, M.A. and Mond, B., Convez Transformable Programming Problems and Invezity (Florida State University Statistics Report M715, 1985).Google Scholar
[13]Hayashi, M. and Komiya, H., ‘Perfect duality for convexlike programs’, J. Optim. Theory Appl. 38 (1980), 179–189.Google Scholar
[14]Ivanov, E.H. and Nehse, R., ‘Some results on dual vector optimization problems’, Optimization 16 (1985), 505–517.CrossRefGoogle Scholar
[15]Jeyakumar, V., ‘Convexlike alternative theorems and mathematical programming’, Optimization 16 (1985), 643–652.Google Scholar
[16]Kaul, R.N. and Kaur, S., ‘Sufficient optimality conditions using generalized convex functions’, Opsearch 19 (1982), 212–224.Google Scholar
[17]Kuhn, H.W. and Tucker, A.W., ‘Nonlinear programming’, in Proceedings of the Second Berkely Symposium on Mathematical Statistics and Probability, Neyman, J. (ed), pp. 481–492 (University of California Press, Berkeley, California, 1951).Google Scholar
[18]Mangasarian, O.L., Nonlinear Programming (McGraw-Hill, New York, 1969).Google Scholar
[19]Martin, D.H., ‘The essence of invexity’, J. Optim. Theory Appl. 47 (1985), 65–76.CrossRefGoogle Scholar
[20]Rockafellar, R.T., ‘Convex Analysis’ (Princeton University Press, Princeton, N.J.).Google Scholar
[21]Tannino, T. and Sarawagi, Y., ‘Duality theory in multiobjective programming’, J. Optim. Theory Appl. 27 (1979), 509–529.CrossRefGoogle Scholar
[22]Weir, T., Mond, B. and Craven, B.D., ‘Weak minimization and duality’, Num. Func. Anal. Optim. 9 (1987), 181–192.Google Scholar
[23]White, D.S., ‘Vector maximization and Lagrange multipliers’, Math. Programming 31 (1985), 192–205.CrossRefGoogle Scholar
[24]Wolfe, P., ‘A duality theorem for nonlinear programming’, Quart. Appl. Math. 19 (1961), 239–244.Google Scholar