Optimality and Duality in Nonsmooth Multiobjective Optimization Involving V-Type I Invex Functions

摘要

There is a vital role of convexity in many aspects of mathematical programming including optimality conditions, duality theorems, and alternative theorems, but, due to insufficiency of convexity notion in many mathematical models used in decision science, economics, engineering, and so forth, there has been an increasing interest in relaxing convexity assumptions in connection with sufficiency and duality theorems. One of the most lively