Invex multifunctions and duality

1 January 1991

journal article
research article
Published by Taylor & Francis in Numerical Functional Analysis and Optimization

Vol. 12 (5) , 575-591
https://doi.org/10.1080/01630569108816453

Abstract

For optimization problems with multifunction objective and constraints, duality theorems are proved for analogs of the Wolfe and Mond–Weir dual problems, assuming that the multifunctions satisfy a generalization of the invex property for functions. Several characterizations of generalized invexity are obtained.

Keywords

This publication has 12 references indexed in Scilit:

Nonsmooth invexity
Bulletin of the Australian Mathematical Society, 1990
Further properties of the regularity of inclusion systems
Nonlinear Analysis, 1989
Nonsmooth multiobjective programming
Numerical Functional Analysis and Optimization, 1989
Generalized invexity for nonsmooth vector-valued mappings
Numerical Functional Analysis and Optimization, 1989
A modified wolfe dual for weak vector minimization
Numerical Functional Analysis and Optimization, 1989
On quasidifferentiable optimization
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1986
What is invexity?
The Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1986
On duality with generalized convexity
Mathematische Operationsforschung und Statistik. Series Optimization, 1984
On sufficiency of the Kuhn-Tucker conditions
Journal of Mathematical Analysis and Applications, 1981
APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS
Mathematics of the USSR-Sbornik, 1969