| Article ID: | iaor20011548 |
| Country: | India |
| Volume: | 21 |
| Issue: | 2 |
| Start Page Number: | 243 |
| End Page Number: | 255 |
| Publication Date: | May 2000 |
| Journal: | Journal of Information & Optimization Sciences |
| Authors: | Giorgi G., Guerraggio A. |
Various types of locally Lipschitz vector-valued invex (and generalized invex) functions are examined. Then the said classes of nonsmooth invex functions are used in order to formulate sufficient generalized Kuhn–Tucker results for a multiobjective programming problem, both with a conical ordering and in the Paretian case. Weakly efficient, efficient and properly efficient points are obtained.