Author:
Mishra S. K.,Mukherjee R. N.
Abstract
AbstractWe extend the concept of V-pseudo-invexity and V-quasi-invexity of multi-objective programming to the case of nonsmooth multi-objective programming problems. The generalised subgradient Kuhn-Tucker conditions are shown to be sufficient for a weak minimum of a multi-objective programming problem under certain assumptions. Duality results are also obtained.
Publisher
Cambridge University Press (CUP)
Reference4 articles.
1. On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
2. On generalised convex mathematical programming
3. [2] Egudo R. R. and Hanson M. A. , “On sufficiency of Kuhn-Tucker conditions in nonsmooth multi-objective programming”, FSU Technical Report M-888, (1993).
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献