Next Article in Journal
Properties of Entropy-Based Topological Measures of Fullerenes
Next Article in Special Issue
Relaxed Inertial Tseng’s Type Method for Solving the Inclusion Problem with Application to Image Restoration
Previous Article in Journal
Multi-Stack Lifetime Improvement through Adapted Power Electronic Architecture in a Fuel Cell Hybrid System
Previous Article in Special Issue
Projected Subgradient Algorithms for Pseudomonotone Equilibrium Problems and Fixed Points of Pseudocontractive Operators
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Nondifferentiable Multiobjective Programming Problem under Strongly K-Gf-Pseudoinvexity Assumptions

by
Ramu Dubey
1,
Lakshmi Narayan Mishra
2,3,
Luis Manuel Sánchez Ruiz
4,* and
Deepak Umrao Sarwe
5
1
Department of Mathematics, J. C. Bose University of Science and Technology, YMCA, Faridabad 121 006, Haryana, India
2
Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology (VIT) University, Vellore 632 014, Tamil Nadu, India
3
L. 1627 Awadh Puri Colony, Beniganj, Phase III, Opposite Industrial Training Institute (I.T.I.), Ayodhya Main Road, Faizabad 224 001, Uttar Pradesh, India
4
ETSID-Departamento de Matemática Aplicada & CITG Universitat Politécnica de Valéncia, E-46022 Valencia, Spain
5
Department of Mathematics, Mumbai University, Mumbai 400 098, India
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(5), 738; https://doi.org/10.3390/math8050738
Submission received: 22 March 2020 / Revised: 4 May 2020 / Accepted: 4 May 2020 / Published: 7 May 2020

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.

1. Introduction

Duality mathematical programming is used in Economics, Control Theory, Business and other diverse fields. In mathematical programming, a pair of primal and dual problems are said to be symmetric when the dual of the dual is the primal problem, i.e., when the dual problem is expressed in the form of the primal problem, then it does happen that its dual is the primal problem. This type of dual problem was introduced by Dorn [1], later on Mond and Weir [2] studying them under weaker convexity assumptions.
Antczak [3] introduced the notion of G-invex function obtaining some optimality conditions which he himself [4] comprehends to be a G f -invex function, deriving optimality conditions for a multiobjective nonlinear programming problem. Ferrara and Stefaneseu [5] also discussed the conditions of optimality and duality for multiobjective programming problem, and Chen [6] considered multiobjective fractional problems and its duality theorems under higher-order ( F , α , ρ , d ) - convexity.
In recent years, 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.
Jiao [8] introduced new concepts of nonsmooth K α d I -invex and generalized type I univex functions over cones by using Clarke’s generalized directional derivative and d I -invexity for a nonsmooth vector optimization problem with cone constraints. Op. cit. also established sufficient optimality conditions and Mond-Weir type duality results under K α d I -invexity and type I cone-univexity assumptions. Very recently Dubey et al. [9] studied further Mond-Weir type dual model multiobjective programming problems over arbitrary cones.
Pitea and Postolache [10] developed the study of a new class of multi-time multiobjective variational problems of minimizing a vector of functionals of curvilinear integral type by means of which they were able to obtain results concerning duals of Mond-Weir type, generalized Mond-Weir-Zalmai type and under some assumptions of ( ρ , b ) -quasi-invexity, proving that the value of the objective function of the primal cannot exceed the value of the dual. And Pitea and Antczak [11] provided additional duality Mond-Weir type results and in the sense of Wolfe for multi-time multiobjective variational problems with univex functionals.
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.

2. Preliminaries and Definitions

As usual, throughout this paper, R n will stand for the n-dimensional Euclidean space and R + n for its non-negative orthant. Let f = ( f 1 , f 2 , , f k ) : X R k be a vector-valued differentiable function defined on a nonempty open set X R n and I f i ( X ) be the range of f i , that is, the image of X under f i , i = 1 , 2 , , k . G f = ( G f 1 , G f 2 , , G f k ) : R R k such that any its component G f i : I f i ( X ) R is strictly increasing on the range of I f i ( X ) , i = 1 , 2 , , k .
Definition 1.
Let S be a cone in R s , the positive polar cone S * of S is defined by
S * = { y R s : x T y 0 , x S } .
Given two closed convex pointed cones K and Q with nonempty interiors in R k and R m , respectively, we consider two vector minimization problems, each of them accompanied by a natural weak minimum definition.
(KMP)          K-minimize f ( x )
             Subject to X 0 = { x X R n : g j ( x ) Q }
where f : X R k and g : X R m are differentiable functions defined on X .
Definition 2.
A point x ¯ X 0 is said to be a weak minimum of (KMP) if there exists no other x X 0 such that f ( x ¯ ) f ( x ) i n t K .
Lemma 1.
If y ¯ X 0 is a weak minimum of (KMP), then there exist α K * , β Q * which are not simultaneously zero such that
α T f ( y ¯ ) + β T g ( y ¯ ) T ( y y ¯ ) 0 , y Q ,
β T g ( y ¯ ) = 0 .
The second vector minimization problem that we consider is the following one.
(KGMP)         K-minimize G f ( f ( x ) )
               Subject to X 0 = { x X R n : G g j ( g j ( x ) ) Q }
Remark 1.
If G f ( t ) = t and G g j ( t j ) = t j , j = 1 , 2 , 3 , , m , then the vector minimization problem (KGMP) reduces to vector minimization problem (KMP).
Definition 3.
A point x ¯ X 0 is said to be a weak minimum of (KGMP) if there exists no other x X 0 such that G f ( f ( x ¯ ) ) G f ( f ( x ) ) i n t K .
Lemma 2.
If y ¯ X 0 is a weak minimum of (KGMP), then there exist α K * , β Q * which are not simultaneously zero such that
α T G f ( f ( y ¯ ) ) f ( y ¯ ) + β T G g ( g ( y ¯ ) ) g ( y ¯ ) T ( y y ¯ ) 0 , y Q ,
β T G g ( g ( y ¯ ) ) g ( y ¯ ) = 0 .
Let C 1 R n and C 2 R m be two closed convex cones with non-empty interiors, and let S 1 and S 2 be two non-empty open sets in R n and R m , respectively, so that C 1 × C 2 S 1 × S 2 . Given a vector valued differentiable function f = ( f 1 , f 2 , , f k ) : S 1 × S 2 R k we consider the following definitions.
Definition 4.
The function f is said to be K-η-pseudoinvex at u S 1 , if x S 1 and for fixed v S 2 , we have
η T ( x , u ) x f 1 ( u , v ) , x f 2 ( u , v ) , , x f k ( u , v ) i n t K f 1 ( x , v ) + f 1 ( u , v ) , f 2 ( x , v ) + f 2 ( u , v ) , , f k ( x , v ) + f k ( u , v ) i n t K .
Definition 5.
The function f is said to be strongly K η -pseudoinvex at u S 1 , if x S 1 and for fixed v S 2 , we have
η T ( x , u ) x f 1 ( u , v ) , x f 2 ( u , v ) , , x f k ( u , v ) i n t K f 1 ( x , v ) f 1 ( u , v ) , f 2 ( x , v ) f 2 ( u , v ) , , f k ( x , v ) f k ( u , v ) K .
Definition 6.
The function f is said to be K- G f -pseudoinvex at u S 1 (with respect to η) if x S 1 and for fixed v S 2 , we have
η T ( x , u ) G f 1 ( f 1 ( u , v ) ) x f 1 ( u , v ) , , G f k ( f k ( u , v ) ) x f k ( u , v ) i n t K G f 1 ( f 1 ( x , v ) ) + G f 1 ( f 1 ( u , v ) ) , , G f k ( f k ( x , v ) ) + G f k ( f k ( u , v ) ) i n t K .
Remark 2.
If G f i ( t ) = t , i = 1 , 2 , 3 , , k , then Definition 2.6 becomes K η -pseudoinvex (Definition 4).
Definition 7.
The function f is said to be strongly K G f -pseudoinvex at u S 1 (with respect to η) if x S 1 and for fixed v S 2 , we have
η T ( x , u ) G f 1 ( f 1 ( u , v ) ) x f 1 ( u , v ) , , G f k ( f k ( u , v ) ) x f k ( u , v ) i n t K G f 1 ( f 1 ( x , v ) ) G f 1 ( f 1 ( u , v ) ) , , G f k ( f k ( x , v ) ) G f k ( f k ( u , v ) ) K .
Remark 3.
If G f i ( t ) = t , i = 1 , 2 , 3 , , k , then Definition 7 reduces in K η -pseudoinvex (see, Definition 5).
Finally we recall that [12] given a compact convex set C in R n , the support function of C is defined by
s x | C = max { x T y : y C } .
The subdifferential of s ( x | C ) is given by
s ( x | C ) = { z C : z T x = s ( x | C ) } .
For any convex set S R n , the normal cone to S at a point x S is defined by
N S ( x ) = { y R n : y T ( z x ) 0 for   all z S } .
It is readily verified that for a compact convex set S, y N S ( x ) if and only if
s ( y | S ) = x T y .

3. K-G-Mond-Weir Type Primal Dual Model

In this section, we consider a multiobjective K-G-Mond–Weir type primal-dual model over arbitrary cones:
(KGMPP)  K-minimize U ( x , y ) = G f 1 ( f 1 ( x , y ) ) , G f 2 ( f 2 ( x , y ) ) , , G f k ( f k ( x , y ) )
Subject to
i = 1 k λ i [ G f i ( f i ( x , y ) ) y f i ( x , y ) ] C 2 * ,
y T i = 1 k λ i [ G f i ( f i ( x , y ) ) y f i ( x , y ) ] 0 ,
λ int K * , x C 1 , i = 1 , 2 , , k .
(KGMDP)  K-maximize V ( u , v ) = G f 1 ( f 1 ( u , v ) ) , G f 2 ( f 2 ( u , v ) ) , , G f k ( f k ( u , v ) )
Subject to
i = 1 k λ i [ G f i ( f i ( u , v ) ) x f i ( u , v ) ] C 1 * ,
u T i = 1 k λ i [ G f i ( f i ( u , v ) ) x f i ( u , v ) ] 0 ,
λ int K * , v C 2 , i = 1 , 2 , , k ,
where, for i = 1 , 2 , 3 , , k , it holds that:
 (I)
K * , C 1 * and C 2 * are the positive polar cones of K , C 1 and C 2 , respectively.
(II)
Given f i : S 1 × S 2 R ,   i f G f = ( G f 1 , G f 2 , , G f k ) : R R k has any of its components G f i : I f i ( S 1 × S 2 ) R as a strictly increasing function on its domain, G f is a differentiable function.
Next we prove weak, strong and converse duality theorems for (KGMPP) and (KGMDP), respectively.
Let Z 0 and W 0 be the set of feasible solutions of (KGMPP) and (KGMDP), respectively.
Theorem 1 (Weak duality theorem).
Let ( x , y , λ ) Z 0 and ( u , v , λ ) W 0 . Let
  (i)
{ f 1 ( . , v ) , f 2 ( . , v ) , , f k ( . , v ) } be strongly K- G f -pseudoinvex at u with respect to η 1 ,
 (ii)
{ f 1 ( x , . ) , f 2 ( x , . ) , , f k ( x , . ) } be K- G f -pseudoincave at y with respect to η 2 ,
(iii)
η 1 ( x , u ) + u C 1 , x C 1 ,
(iv)
η 2 ( v , y ) + y C 2 , , y C 2 .
Then,
( G f 1 ( f 1 ( u , v ) ) , G f 2 ( f 2 ( u , v ) ) , , G f k ( f k ( u , v ) ) ) ( G f 1 ( f 1 ( x , y ) ) , G f 2 ( f 2 ( x , y ) ) , , G f k ( f k ( x , y ) ) ) i n t K .
Proof. 
The proof is given by contradiction. Suppose that (7) does not hold. Then,
( G f 1 ( f 1 ( u , v ) ) , G f 2 ( f 2 ( u , v ) ) , , G f k ( f k ( u , v ) ) ) ( G f 1 ( f 1 ( x , y ) ) , G f 2 ( f 2 ( x , y ) ) , , G f k ( f k ( x , y ) ) ) i n t K .
For the dual constraint (4) and assumption ( i i i ) , we get
( η 1 ( x , u ) + u ) T i = 1 k λ i [ G f i ( f i ( u , v ) ) x f i ( u , v ) ] 0 .
Using the dual constraint (5) in the above inequality, we deduce that
η 1 ( x , u ) T i = 1 k λ i [ G f i ( f i ( u , v ) ) x f i ( u , v ) ] 0 ,
or equivalently,
i = 1 k λ i [ η 1 ( x , u ) T { G f i ( f i ( u , v ) ) x f i ( u , v ) } ] 0 .
Taking into account that λ i n t K * ,
η 1 ( x , u ) T { G f 1 ( f 1 ( u , v ) ) x f 1 ( u , v ) , G f 2 ( f 2 ( u , v ) ) x f 2 ( u , v ) , , G f k ( f k ( u , v ) ) x f k ( u , v ) } i n t K .
By hypothesis ( i ) , it holds that
{ G f 1 ( f 1 ( x , v ) ) G f 1 ( f 1 ( u , v ) ) , G f 2 ( f 2 ( x , v ) ) G f 2 ( f 2 ( u , v ) ) , , G f k ( f k ( x , v ) ) G f k ( f k ( u , v ) ) } K .
Having in mind (8), we obtain
{ G f 1 ( f 1 ( x , y ) ) + G f 1 ( f 1 ( x , v ) , G f 2 ( f 2 ( x , y ) ) + G f 2 ( f 2 ( x , v ) , , G f 1 ( f 1 ( x , y ) ) + G f 1 ( f 1 ( x , v ) } K + int K i n t K .
On the similar lines to the above proof, we have
η 2 ( v , y ) T { G f 1 ( f 1 ( x , y ) ) y f 1 ( x , y ) , G f 2 ( f 2 ( x , y ) ) y f 2 ( x , y ) , , G f k ( f k ( x , y ) ) y f k ( x , y ) } i n t K .
By using now generalized convexity assumptions, it follows that
{ G f 1 ( f 1 ( x , y ) ) + G f 1 ( f 1 ( x , v ) , G f 2 ( f 2 ( x , y ) ) + G f 2 ( f 2 ( x , v ) , , G f 1 ( f 1 ( x , y ) ) + G f 1 ( f 1 ( x , v ) } i n t K ,
a contradiction with (9). Hence, the conclusion follows. □
Theorem 2 (Strong duality theorem).
Let ( x ¯ , y ¯ , λ ¯ ) be a weak efficient solution of (KGMPP); fix λ = λ ¯ in (KGMDP) and suppose that
 (i)
G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) i = 1 k is linearly independent,
(ii) 
R + k K .
Then, ( x ¯ , y ¯ , λ ¯ ) W 0 and the objective values of (KGMPP) and (KGMDP) coincide. Moreover, if the assumptions of Theorem 1 are satisfied for all feasible solutions of (KGMPP) and (KGMDP), then ( x ¯ , y ¯ , λ ¯ ) is a weak efficient solution of (KGMDP).
Proof. 
Since ( x ¯ , y ¯ , λ ¯ ) is a weak efficient solution of (KGMPP), by Lemma 2, then there exist α K * , β C 2 , γ R + and δ K such that
( i = 1 k α i G f i ( f i ( x ¯ , y ¯ ) ) x f i ( x ¯ , y ¯ ) + ( β γ y ¯ ) T i = 1 k λ ¯ i [ G f i ( f i ( x ¯ , y ¯ ) ) x f i ( x ¯ , y ¯ ) y f i ( x ¯ , y ¯ ) + G f i ( f i ( x ¯ , y ¯ ) ) x y f i ( x ¯ , y ¯ ) ] ) T ( x x ¯ ) T + [ i = 1 k α i ( G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) + i = 1 k ( β γ y ¯ ) T λ ¯ i ( G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) ( y f i ( x ¯ , y ¯ ) ) T + G f i ( f i ( x ¯ , y ¯ ) ) y y f i ( x ¯ , y ¯ ) ) i = 1 k γ λ ¯ i G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) ] T ( y y ¯ ) + [ ( β γ y ¯ ) T G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) δ ] T ( λ λ ¯ ) 0 , x C 1 , y R m , λ int K * ,
β T i = 1 k λ ¯ i [ G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) ] = 0 ,
γ y ¯ T i = 1 k λ ¯ i [ G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) ] = 0 ,
δ T λ ¯ = 0 ,
( α , β , γ , δ ) ( 0 , 0 , 0 , 0 ) , ( α , β , γ , δ ) ( 0 , 0 , 0 , 0 ) .
Since δ K and λ ¯ int K * , Equation (13) implies δ = 0 .
Taking x = x ¯ , y = y ¯ in (10), we deduce that
[ ( β γ y ¯ ) T G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) ] T ( λ λ ¯ ) 0 , λ int K * .
This implies that ( β γ y ¯ ) T G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) N int K * ( λ ¯ ) , N int K * ( λ ¯ ) being the normal cone to int K * at λ ¯ .
Since λ ¯ int K * = int ( int K * ) , N int K * ( λ ¯ ) = { 0 } , we obtain that
( β γ y ¯ ) T G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) = 0 .
By assumption ( i ) , we have
β γ y ¯ = 0 .
Now, we claim that α 0 . Indeed, if α = 0 , then (10) becomes
[ i = 1 k γ λ ¯ i { G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) } ] T ( y y ¯ ) 0 , y R m .
This gives
i = 1 k γ λ ¯ i [ G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) ] ( y y ¯ ) = 0 .
By hypothesis ( i ) , we have γ λ ¯ i = 0 , i = 1 , 2 , 3 , , k . Since R + k K , int K * int R + k and since λ ¯ > 0 , we get γ = 0 . Thus, from (16), we have β = 0 . A contradiction with the fact that ( α , β , γ , δ ) 0 .
Hence, α 0 , i.e., α > 0 .
Now, the last equation and (16) yield
i = 1 k ( α i γ λ ¯ i ) G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) = 0 .
By independence linearity hypothesis ( i ) , this implies that
α i = γ λ ¯ i , i = 1 , 2 , , k .
From λ ¯ i > 0 , i = 1 , 2 , , k , and α k 0 = 0 , for some k 0 , it follows that γ = 0 . Now from (16), (19) and γ = 0 , we have α i = 0 , i = 1 , 2 , , k , a contradiction with (14). Hence α i > 0 , i = 1 , 2 , 3 , , k . Therefore, γ > 0 .
Taking y = y ¯ in (10), (16) and assumption ( i ) provide that
i = 1 k α i ( G f i ( f i ( x ¯ , y ¯ ) ) x f i ( x ¯ , y ¯ ) ) T ( x x ¯ ) 0 , x C 1 .
Since γ > 0 , from (19) and (20), we get
i = 1 k λ ¯ i ( G f i ( f i ( x ¯ , y ¯ ) ) x f i ( x ¯ , y ¯ ) ) T ( x x ¯ ) 0 , x C 1 .
Picking some x C 1 , then x + x ¯ C 1 since C 1 is a closed convex cone. By making x + x ¯ to play the role of x in (20), we get
i = 1 k λ ¯ i ( G f i ( f i ( x ¯ , y ¯ ) ) x ) f i ( x ¯ , y ¯ ) x 0 , x C 1 .
Consequently,
i = 1 k λ ¯ i G f i ( f i ( x ¯ , y ¯ ) ) x ) f i ( x ¯ , y ¯ ) C 1 * .
By considering simultaneously x = 0 and x = 2 x ¯ in (20), we have
x ¯ T i = 1 k λ ¯ i [ ( G f i ( f i ( x ¯ , y ¯ ) ) x ) f i ( x ¯ , y ¯ ) ] = 0 .
Since β = γ y ¯ and γ > 0 , we get
y ¯ = β γ C 2 .
From (22) and (23), it follows that ( x ¯ , y ¯ , λ ¯ ) W 0 . Moreover, if the hypothesis in Theorem 1 hold, then we conclude that ( x ¯ , y ¯ , λ ¯ ) is a weak minimum of (KGMDP), and the two objective values coincide, QED. □
Thanks to the fact that under symmetric duality, the converse duality theorem proof works in the same as for the strong duality theorem, Theorem 1 infers the following result.
Theorem 3 (Converse duality theorem).
Let ( u ¯ , v ¯ , λ ¯ ) be a weak efficient solution of (KGMDP); fix λ = λ ¯ in (KGMPP) and suppose that
 (i)
G f i ( f i ( u ¯ , v ¯ ) ) x f i ( u ¯ , v ¯ ) i = 1 k is linearly independent,
(ii) 
R + k K .
Then ( u ¯ , v ¯ , λ ¯ ) Z 0 and the objective values of (KGMPP) and (KGMDP) coincide. Moreover, if the assumptions of Theorem 1 are satisfied for every feasible solution of (KGMPP) and (KGMDP), then ( u ¯ , v ¯ , λ ¯ ) is a weak efficient solution of (KGMPP).

4. K-N-G-Mond–Weir Type Nondifferentiable Dual Model

Herein, we consider a nondifferentiable multiobjective K-N-G-Mond–Weir primal-dual model over arbitrary cones.
(KGNMPP) K-minimize S ( x , y , z ) = ( G f 1 ( f 1 ( x , y ) ) + s ( x | D 1 ) y T z 1 , G f 2 ( f 2 ( x , y ) ) + s ( x | D 2 )
y T z 2 , , G f k ( f k ( x , y ) + s ( x | D k ) y T z k ) )
Subject to
i = 1 k λ i [ G f i ( f i ( x , y ) ) y f i ( x , y ) z i ] C 2 * ,
y T i = 1 k λ i [ G f i ( f i ( x , y ) ) y f i ( x , y ) z i ] 0 ,
λ int K * , x C 1 , z i E i , i = 1 , 2 , , k .
(KGNMDP)  K-maximize T ( u , v , w ) = ( G f 1 ( f 1 ( u , v ) ) s ( v | E 1 ) + u T w 1 , G f 2 ( f 2 ( u , v ) ) s ( v | E 2 )
+ u T w 2 , , G f k ( f k ( u , v ) ) s ( v | E k ) + u T w k )
Subject to
i = 1 k λ i [ G f i ( f i ( u , v ) ) x f i ( u , v ) + w i ] C 1 * ,
u T i = 1 k λ i [ G f i ( f i ( u , v ) ) x f i ( u , v ) + w i ] 0 ,
λ int K * , v C 2 , w i D i , i = 1 , 2 , , k ,
where for i = 1 , 2 , 3 , , k , it holds that:
 (I)
K * , C 1 * and C 2 * are the positive polar cones of K , C 1 and C 2 , respectively.
(II)
Given f i : S 1 × S 2 R , i f G f = ( G f 1 , G f 2 , , G f k ) : R R k has any of its components G f i : I f i ( S 1 × S 2 ) R as a strictly increasing function on its domain, G f is a differentiable function.
(III)
D i and E i are compact convex sets in R n and R m , respectively.
(IV)
s ( x | D i ) and s ( v | E i ) are the support functions of D i and E i , respectively.
Remark 4.
In the primal- dual model (K-N-G- Mond-Weir type nondifferentiable dual model), we used support function for a nondifferentiable term.
Now we are ready to provide three duality theorems for (KGNMPP) and (KGNMDP). Their proofs are easily obtained by mimicking the ones of the three theorems obtained in the previous section.
Let X 0 and Y 0 be the set of feasible solutions of (KGNMPP) and (KGNMDP), respectively.
Theorem 4 (Weak duality theorem).
Let ( x , y , λ , z 1 , z 2 , , z k ) X 0 and ( u , v , λ , w 1 , w 2 , , w k ) Y 0 . Let
 (i)
{ f 1 ( . , v ) , f 2 ( . , v ) , , f k ( . , v ) } and { ( . ) T w 1 , ( . ) T w 2 , , ( . ) T w k } ) be strongly K- G f -pseudoinvex and strongly K η 1 pseudoinvex, respectively, at u with respect to η 1 ,
(ii) 
{ f 1 ( x , . ) , f 2 ( x , . ) , , f k ( x , . ) } and { ( . ) T z 1 , ( . ) T z 2 , , ( . ) T z k } ) be K- G f -pseudoincave and K η 2 -pseudoinvex, respectively, at y with respect to η 2 ,
(iii) 
η 1 ( x , u ) + u C 1 , x C 1 ,
(iv) 
η 2 ( v , y ) + y C 2 , , y C 2 .
Then
( G f 1 ( f 1 ( u , v ) ) s ( v | E 1 ) + u T w 1 , G f 2 ( f 2 ( u , v ) ) s ( v | E 2 ) + u T w 2 , , G f k ( f k ( u , v ) ) s ( v | E k ) + u T w k { G f 1 ( f 1 ( x , y ) ) + s ( x | D 1 ) y T z 1 , G f 2 ( f 2 ( x , y ) ) + s ( x | D 2 ) y T z 2 , , G f k ( f k ( x , y ) ) + s ( x | D k ) y T z k } ) i n t K .
Proof. 
The proof is given by contradiction. Suppose that (31) does not hold. Then,
( G f 1 ( f 1 ( u , v ) ) s ( v | E 1 ) + u T w 1 , G f 2 ( f 2 ( u , v ) ) s ( v | E 2 ) + u T w 2 , , G f k ( f k ( u , v ) ) s ( v | E k ) + u T w k { G f 1 ( f 1 ( x , y ) ) + s ( x | D 1 ) y T z 1 , G f 2 ( f 2 ( x , y ) ) + s ( x | D 2 ) y T z 2 , , G f k ( f k ( x , y ) ) + s ( x | D k ) y T z k } ) int K .
For the dual constraint (28) and assumption ( i i i ) , we get
( η 1 ( x , u ) + u ) T i = 1 k λ i [ G f i ( f i ( u , v ) ) x f i ( u , v ) + w i ] 0 .
Using the dual constraint (29) in the above inequality, we deduce that
η 1 ( x , u ) T i = 1 k λ i [ G f i ( f i ( u , v ) ) x f i ( u , v ) + w i ] 0 ,
or equivalently,
i = 1 k λ i [ η 1 ( x , u ) T { G f i ( f i ( u , v ) ) x f i ( u , v ) + w i } ] 0 .
Remaining part of proof follows almost similar to the Theorem 1. □
Theorem 5 (Strong duality theorem).
Let ( x ¯ , y ¯ , λ ¯ , z ¯ 1 , z ¯ 2 , , z ¯ k ) be a weak efficient solution of (KGNMPP); fix λ = λ ¯ in (KGNMDP) and suppose that:
 (i)
G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) z ¯ i i = 1 k is linearly independent,
(ii) 
R + k K .
Then there exists w ¯ i D i , i = 1 , 2 , , k such that ( x ¯ , y ¯ , λ ¯ , w ¯ 1 , w ¯ 2 , , w ¯ k ) Y 0 and the objective values of (KGNMPP) and (KGNMDP) coincide. Moreover, if the assumptions of Theorem 1 are satisfied for all feasible solutions of (KGNMPP) and (KGNMDP), then ( x ¯ , y ¯ , λ ¯ , w ¯ 1 , w ¯ 2 , , w ¯ k ) is a weak efficient solution of (KGNMDP).
Finally, the following result becomes the sibling result of the last one obtained in the previous section.
Theorem 6 (Converse duality theorem).
Let ( u ¯ , v ¯ , λ ¯ , w ¯ 1 , w ¯ 2 , , w ¯ k ) be a weak efficient solution of (KGNMDP); fix λ = λ ¯ in (KGNMPP) and suppose that:
 (i)
G f i ( f i ( u ¯ , v ¯ ) ) x f i ( u ¯ , v ¯ ) w ¯ i i = 1 k is linearly independent,
(ii) 
R + k K .
Then, there exists z ¯ i E i , i = 1 , 2 , , k such that ( u ¯ , v ¯ , λ ¯ , z ¯ 1 , z ¯ 2 , , z ¯ k ) X 0 and the objective values of (KGNMPP) and (KGNMDP) coincide. Moreover, if the assumptions of Theorem 1 are satisfied for all feasible solutions of (KGNMPP) and (KGNMDP), then ( u ¯ , v ¯ , λ ¯ , z ¯ 1 , z ¯ 2 , , z ¯ k ) is a weak efficient solution of (KGNMPP).

5. Conclusions

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. This work may be inspirational for extension to nondifferentiable higher-order symmetric fractional programming.

Author Contributions

Conceptualization, R.D., L.N.M. and L.M.S.R.; Investigation, R.D., L.N.M., L.M.S.R. and D.U.S.; Methodology, R.D., L.N.M., L.M.S.R. and D.U.S.; Writing – review and editing, R.D., L.N.M., L.M.S.R. and D.U.S. All authors contributed equally in writing this article. All authors read and approved the final manuscript.

Funding

This research received no external funding.

Acknowledgments

Ramu Dubey gratefully acknowledges the Department of Mathematics, J.C. Bose University of Science and Technology, YMCA, Faridabad-121 006, Haryana, India.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Dorn, W.S. A symmetric dual theorem for quadratic programs. J. Oper. Res. Soc. Jpn. 1960, 2, 93–97. [Google Scholar]
  2. Mond, B.; Weir, T. Generalized concavity and duality. In Generalized Concavity in Optimization and Economics; Schaible, S., Ziemba, W.T., Eds.; Academic Press: New York, NY, USA, 1981. [Google Scholar]
  3. Antczak, T. New optimality conditions and duality results of G-type in differentiable mathematical programming. Nonlinear Anal. 2007, 66, 1617–1632. [Google Scholar] [CrossRef]
  4. Antczak, T. On G-invex multiobjective programming, Part I, Optimality. J. Glob. 2009, 43, 97–109. [Google Scholar] [CrossRef]
  5. Ferrara, M.; Stefaneseu, M.V. Optimality conditions and duality in multiobjective programming with (ϕ,ρ)-invexity. Yugosl. Oper. Res. 2008, 18, 153–165. [Google Scholar] [CrossRef]
  6. Chen, X.H. Higher-order symmetric duality in nondifferentiable multiobjective programming problems. J. Math. Anal. Appl. 2004, 290, 423–435. [Google Scholar] [CrossRef] [Green Version]
  7. Xianjun, L. Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions. J. Syst. Sci. Complex. 2013, 26, 1002–1018. [Google Scholar]
  8. Jiao, H. Sufficiency and duality for a nonsmooth vector optimization problem with generalized α-dI-type-I univexity over cones. Bull. Iranian Math. 2016, 42, 285–295. [Google Scholar]
  9. Dubey, R.; Mishra, L.N.; Sánchez Ruiz, L.M. Nondifferentiable G-Mond-Weir type multiobjective symmetric fractional problem and their duality theorems under generalized assumptions. Symmetry 2019, 11, 1348. [Google Scholar] [CrossRef] [Green Version]
  10. Pitea, A.; Postolache, M. Duality theorems for a new class of multitime multiobjective variational problems. J. Glob. Optim. 2012, 54, 47–58. [Google Scholar] [CrossRef]
  11. Pitea, A.; Antczak, T. Proper efficiency and duality for a new class of nonconvex multitime multiobjective variational problem. J. Inequal. Appl. 2014, 2014, 333. [Google Scholar] [CrossRef] [Green Version]
  12. Dubey, R. Deepmala and Vishnu Narayan Mishra, Higher-order symmetric duality in nondifferentiable multiobjective fractional programming problem over cone contraints. Stat. Optim. Inf. Comput. 2020, 8, 187–205. [Google Scholar] [CrossRef]

Share and Cite

MDPI and ACS Style

Dubey, R.; Mishra, L.N.; Sánchez Ruiz, L.M.; Sarwe, D.U. Nondifferentiable Multiobjective Programming Problem under Strongly K-Gf-Pseudoinvexity Assumptions. Mathematics 2020, 8, 738. https://doi.org/10.3390/math8050738

AMA Style

Dubey R, Mishra LN, Sánchez Ruiz LM, Sarwe DU. Nondifferentiable Multiobjective Programming Problem under Strongly K-Gf-Pseudoinvexity Assumptions. Mathematics. 2020; 8(5):738. https://doi.org/10.3390/math8050738

Chicago/Turabian Style

Dubey, Ramu, Lakshmi Narayan Mishra, Luis Manuel Sánchez Ruiz, and Deepak Umrao Sarwe. 2020. "Nondifferentiable Multiobjective Programming Problem under Strongly K-Gf-Pseudoinvexity Assumptions" Mathematics 8, no. 5: 738. https://doi.org/10.3390/math8050738

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop