Abstract
In this paper we consider the introduction of the concept of (strongly) K- G f -pseudoinvex functions which enable to study a pair of nondifferentiable K-G- Mond-Weir type symmetric multiobjective programming model under such assumptions.
Highlights
Duality mathematical programming is used in Economics, Control Theory, Business and other diverse fields
In the present paper we consider a pair of K-G-Mond-Weir type multiobjective symmetric dual program for which we establish the weak duality theorem, as well as the corresponding strong, and converse ones under K-G f -pseudo-invexity/strongly K-G f -pseudo-invexity assumptions
By using the notion of K-G f - pseudo-invex/ strongly K − G f - pseudo-invex functions we have established duality results for (KGMPP) /(KGNMPP)-Mond–Weir dual models applied in multiobjective nondifferentiable symmetric programming problems with objective cone and cone constraints, too
Summary
Duality mathematical programming is used in Economics, Control Theory, Business and other diverse fields. Several definitions such as nonsmooth univex, nonsmooth quasiunivex, and nonsmooth pseudoinvex functions have been introduced by Xianjun [7] By introducing these new concepts, sufficient optimality conditions for a nonsmooth multiobjective problem were obtained and, a fortiori, weak and strong duality results were established for a Mond-Weir type multiobjective dual program. In the present paper we consider a pair of K-G-Mond-Weir type multiobjective symmetric dual program for which we establish the weak duality theorem, as well as the corresponding strong, and converse ones under K-G f -pseudo-invexity/strongly K-G f -pseudo-invexity assumptions. In the process we construct a lemma that enables us to prove the strength and converse duality theorems under K-G f -pseudo-invexity/strongly K-G f -pseudo-invexity assumptions
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have