On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming. (English) Zbl 0760.90078

Some generalized invex conditions are given for a nondifferentiable constrained optimization problem, generalizing the “type I invex” property of Hanson and Mond for differentiable problems. Some duality results are obtained.


90C26 Nonconvex programming, global optimization
90C30 Nonlinear programming
Full Text: DOI


[1] DOI: 10.1016/0022-247X(81)90123-2 · Zbl 0463.90080
[2] DOI: 10.1080/02331938608843097 · Zbl 0591.49016
[3] Clarke, Nonsmooth analysis and optimization (1983) · Zbl 0727.90045
[4] DOI: 10.1017/S0334270000005142 · Zbl 0603.90119
[5] DOI: 10.1007/BF02591683 · Zbl 0622.49005
[6] DOI: 10.1016/0022-247X(77)90183-4 · Zbl 0369.90104
[7] DOI: 10.1007/BF01442544 · Zbl 0389.90088
[8] DOI: 10.1007/BF01588951 · Zbl 0373.90071
[9] DOI: 10.1016/0022-247X(79)90228-2
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.