Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T08:29:10.187Z Has data issue: false hasContentIssue false

Generalized convexity in nondifferentiable programming

Published online by Cambridge University Press:  17 April 2009

Bevil M. Glover
Affiliation:
43 Wirbill Street, Cobram, Victoria, 3644, 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.

For an abstract mathematical programming problem involving quasidifferentiable cone-constraints we obtain necessary (and sufficient) optimality conditions of the Kuhn-Tucker type without recourse to a constraint qualification. This extends the known results to the non-differentiable setting. To obtain these results we derive several simple conditions connecting various concepts in generalized convexity not requiring differentiability of the functions involved.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1984