Hostname: page-component-6bb9c88b65-vmslq Total loading time: 0 Render date: 2025-07-25T12:12:18.073Z Has data issue: false hasContentIssue false
  • English
  • Français

Nondifferentiable programming and duality with modified convexity

Published online by Cambridge University Press:  17 April 2009

V. Jeyakumar
V. Jeyakumar
Affiliation:
Department of Mathematics, University of Kentucky, Lexington, Kentucky 40506-0027, U.S.A.
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Abstracts of Australasian Ph.D. Theses
Information
Bulletin of the Australian Mathematical Society , Volume 35 , Issue 2 , April 1987 , pp. 309 - 313
Copyright
Copyright © Australian Mathematical Society 1987

References

[1]Craven, B.D. and Jeyakumar, V., “Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem”, Operations Research Letters Vol. 5 No. 2 (1986) (to appear).Google Scholar
[2]Jeyakumar, V., “Nonlinear alternative theorems and nondifferential programming”, Zeitschrift fur Operations Research, series A 28 (1984), 175–187.Google Scholar
[3]Jeyakumar, V., “Convexlike alternative theorems and mathematical programming” Vol. 16 No. 2 (1985) 643–652.Google Scholar
[4]Jeyakumar, V., “A generalization of a minimax theorem of Fan via a theorem of the alternative”, Journal of Optimization Theory and Applications Vol. 48 No. 3 (1986) 525–533.CrossRefGoogle Scholar
[5]Jeyakumar, V., “On subgradient duality with strong and weak convex functions”, Journal of the Australian Mathematical Society, Series A Vol. 40 part 2 (1986) 143–152.CrossRefGoogle Scholar
[6]Jeyakumar, V., “ρ-convexity and second order duality”, Utilitas Mathematica, Vol. 29 (1986) 71–85.Google Scholar
[7]Jeyakumar, V., “First and second order fractional programming duality”, Opsearch Vol. 22 No. 1 (1985) 24–41.Google Scholar
[8]Jeyakumar, V., “Strong and weak invexity in mathematical programming”, Methods of Operations Research 55 (1985) 109–125.Google Scholar
[9]Jeyakumar, V., “On optimality conditions in nonsmooth inequality constrained minimization”, Numerical Functional Analysis and Optimization, (1986) (to appear).Google Scholar
[10]Vial, J.P., “Strong and weak convexity of sets and functions”, Mathematics of Operations Research Vol. 8 No. 2 (1983) 231–259.CrossRefGoogle Scholar