Next Article in Journal
Short vs. Standard Length Cone Morse Connection Implants: An In Vitro Pilot Study in Low Density Polyurethane Foam
Next Article in Special Issue
A Study on Hypergraph Representations of Complex Fuzzy Information
Previous Article in Journal
Angle Tracking Observer with Improved Accuracy for Resolver-to-Digital Conversion
Previous Article in Special Issue
Proposal for the Identification of Information Technology Services in Public Organizations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Nondifferentiable G-Mond–Weir Type Multiobjective Symmetric Fractional Problem and Their Duality Theorems under Generalized Assumptions

by
Ramu Dubey
1,†,
Lakshmi Narayan Mishra
2,3,† and
Luis Manuel Sánchez Ruiz
4,*,†
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 Politecnica de Valencia, E-46022 Valencia, Spain
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Symmetry 2019, 11(11), 1348; https://doi.org/10.3390/sym11111348
Submission received: 29 September 2019 / Revised: 17 October 2019 / Accepted: 20 October 2019 / Published: 1 November 2019
(This article belongs to the Special Issue Symmetry and Complexity 2019)

Abstract

:
In this article, a pair of nondifferentiable second-order symmetric fractional primal-dual model (G-Mond–Weir type model) in vector optimization problem is formulated over arbitrary cones. In addition, we construct a nontrivial numerical example, which helps to understand the existence of such type of functions. Finally, we prove weak, strong and converse duality theorems under aforesaid assumptions.

1. Introduction

In multiobjective programming problems, convexity plays an important role in deriving optimality conditions and duality results. To relax convexity assumptions involved in sufficient optimality conditions and duality theorems, various generalized convexity notions have been proposed. Multiobjective type programming problem [1] is common in mathematical modeling of realistic phenomenon with a wide spectrum of utilization. Symmetric duality in nonlinear programming deals with the situation where dual of the dual is primal. Special dual problems of optimization are applied to many types of optimization problems. They are used for the proof of optimality of solutions, for designing and a theoretical justification of optimization algorithms, and for physical or economic interpretation of received solutions. Quite often dual problems introduce new meaning to modeled problems. For many interesting applications and developments of multiobjective optimization, we refer to the work of A. Chinchuluun and P.M. Pardalos [2] and the references cited therein.
In economics, we often come across a case where we have to maximize the efficiency of an economic system resulting optimization problems whose objective function is a ratio. Mangasarian [3] proposed the idea of second-order duality for nonlinear optimization problems. The perusal of second-order duality is important due to the computer simulation benefit over the first-order duality since this one supplies narrow ranges for the cost of the objectives when estimations are applied. Suneja et al. [1] and Kim et al. [4] extended the concept of symmetric duality to arbitrary cones.
Suneja et al. [5] considered a pair of multiobjective second order symmetric dual problems of Mond–Weir type without non-negativity constraints and established duality results under η -bonvexity and η -pseudobonvexity assumptions. Later, Khurana [6] defined cone-pseudoinvex and strongly cone-pseudoinvex functions and proved duality theorems for a pair of Mond–Weir type symmetric dual multiobjective programs over arbitrary cones. For more information on fractional programming, readers are advised to see [7,8,9,10,11,12,13].
The purpose of the present work is to study second order multiobjective fractional symmetric duality over arbitrary cones for nondifferentiable G-Mond–Weir type program under G f -bonvexity/ G f -pseudobonvexity assumptions. The paper is organized as follows. In Section 2, we present some relevant preliminaries. In Section 3, we consider a pair of G-Mond–Weir type nondifferentiable multiobjective second order fractional symmetric dual problems with cone constraints and establish appropriate duality theorems under aforesaid assumptions followed by conclusions.

2. Preliminaries and Definitions

Throughout this paper, R n stands for the n-dimensional Euclidean space and R + n for its non-negative orthant. Consider the following vector minimization problem:
(MP)    Minimize f ( x ) = f 1 ( x ) , f 2 ( x ) , f 3 ( x ) , , f k ( x ) T
    Subject to X 0 = { x X R n : g j ( x ) 0 , j = 1 , 2 , , m }
where f = { f 1 , f 2 , , f k } : X R k and g = { g 1 , g 2 , , g m } : X R m are differentiable functions defined on X .
Definition 1.
A point x ¯ X 0 is said to be an efficient solution of (MP) if there exists no other x X 0 such that f r ( x ) < f r ( x ¯ ) , for some r = 1 , 2 , , k and f i ( x ) f i ( x ¯ ) , for all i = 1 , 2 , , k .
Definition 2.
The positive polar cone S * of a cone S R s is defined by
S * = { y R s : x T y 0 , f o r a l l x S } .
Let C 1 R n and C 2 R m be closed convex cones with non-empty interiors and S 1 and S 2 be non-empty open sets in R n and R m , respectively, such that C 1 × C 2 S 1 × S 2 . Suppose f = ( f 1 , f 2 , , f k ) : S 1 × S 2 R k is a vector- valued differentiable function.
Definition 3.
The function f is said to be invex at u S 1 (with respect to η , where η : S 1 × S 2 R n ), if x S 1 and for fixed v S 2 , we have
f i ( x , v ) f i ( u , v ) η T ( x , u ) x f i ( u , v ) , f o r a l l i = 1 , 2 , , k ,
If the above inequality sign changes to ≤, then f is called incave at u S 1 with respect to η .
Definition 4.
The function f is said to be pseudoinvex at u S 1 (with respect to η , where η : S 1 × S 2 R n ), if x S 1 and for fixed v S 2 , we have
η T ( x , u ) x f i ( u , v ) 0 f i ( x , v ) f i ( u , v ) 0 , f o r a l l i = 1 , 2 , , k .
If the above inequality sign changes to , then f is called pseudoincave at u X with respect to η .
Definition 5.
The function f is said to be G f -invex at u S 1 (with respect to η), if there exists a differentiable function G f = ( G f 1 , G f 2 , , G f k ) : R R k such that each component G f i : I f i ( S 1 × S 2 ) R , where I f i ( S 1 × S 2 ) , i = 1 , 2 , 3 , , k is the range of f i , is strictly increasing on its domain and η : S 1 × S 2 R n , so that x S 1 , for fixed v S 2 , we have
G f i ( f i ( x , v ) ) G f i ( f i ( u , v ) ) η T ( x , u ) G f i ( f i ( u , v ) ) x f i ( u , v ) , f o r a l l i = 1 , 2 , , k ,
If the above inequality sign changes to ≤, then f is called G f -incave at u S 1 with respect to η .
Definition 6.
The function f is said to be G f -pseudoinvex at u S 1 (with respect to η), if there exists a differentiable function G f = ( G f 1 , G f 2 , , G f k ) : R R k such that each component G f i : I f i ( S 1 × S 2 ) R , where I f i ( S 1 × S 2 ) , i = 1 , 2 , 3 , , k is the range of f i , is strictly increasing on its domain and η : S 1 × S 2 R n , so that x S 1 , for fixed v S 2 , we have
η T ( x , u ) G f i ( f i ( u , v ) ) x f i ( u , v ) 0 G f i ( f i ( x , v ) ) G f i ( f i ( u , v ) ) 0 , f o r a l l i = 1 , 2 , , k .
If the above inequality sign changes to , then f is called G f -pseudoincave at u X with respect to η .
Definition 7.
The function f is said to be G f -bonvex at u S 1 (with respect to η), if there exists a differentiable function G f = ( G f 1 , G f 2 , , G f k ) : R R k such that each component G f i : I f i ( S 1 × S 2 ) R , where I f i ( S 1 × S 2 ) , i = 1 , 2 , 3 , , k is the range of f i , is strictly increasing on its domain and η : S 1 × S 2 R n , so that x S 1 , for fixed v S 2 and p i R n , we have
G f i ( f i ( x , v ) ) G f i ( f i ( u , v ) ) η T ( x , u ) [ G f i ( f i ( u , v ) ) x f i ( u , v ) + { G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T
+ G f i ( f i ( u , v ) ) x f i ( u , v ) } p i ] 1 2 p i T [ G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T
+ G f i ( f i ( u , v ) ) x f i ( u , v ) ] p i , f o r a l l i = 1 , 2 , , k .
If the above inequality sign changes to , then f is called G f -boncave at u S 1 with respect to η .
Definition 8.
The function f is said to be G f -pseudobonvex at u S 1 (with respect to η), if there exists a differentiable function G f = ( G f 1 , G f 2 , , G f k ) : R R k such that each component G f i : I f i ( S 1 × S 2 ) R , where I f i ( S 1 × S 2 ) , i = 1 , 2 , 3 , , k is the range of f i , is strictly increasing on its domain and η : S 1 × S 2 R n , so that x S 1 , for fixed v S 2 and p i R n , η T ( x , u ) [ G f i ( f i ( u , v ) ) x f i ( u , v ) + { G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T + G f i ( f i ( u , v ) )
x x f i ( u , v ) } p i ] 0 G f i ( f i ( x , v ) ) G f i ( f i ( u , v ) ) + 1 2 p i T [ G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T
+ G f i ( f i ( u , v ) ) x x f i ( u , v ) ] p i 0 , f o r a l l i = 1 , 2 , , k .
If the above inequality sign changes to , then f is called G f -pseudoboncave at u S 1 with respect to η .
We now give an example of G f -bonvexity with respect to η , but not η -bonvex.
Example 1.
Let k = 4 , n = 1 , S 1 = S 2 = π 6 , π 6 , C 1 = C 2 = π 6 , π 6 .
Let f : π 6 , π 6 × π 6 , π 6 R 4 be defined as
f ( x , y ) = { f 1 ( x , y ) , f 2 ( x , y ) , f 3 ( x , y ) , f 4 ( x , y ) } ,
where f 1 ( x , y ) = e y , f 2 ( x , y ) = x e y , f 3 ( x , y ) = x 2 s i n 2 y , f 4 ( x , y ) = y 2 and G f = { G f 1 , G f 2 , G f 3 , G f 4 } : R R 4 be defined as:
G f 1 ( t ) = t , G f 2 ( t ) = t 4 , G f 3 ( t ) = t , G f 4 ( t ) = t 2 .
Let η : π 6 , π 6 × π 6 , π 6 R be given as:
η ( x , u ) = x u .
To show that f is G f -bonvex at u = 0 with respect to η , we have to claim that
π i = G f i ( f i ( x , v ) ) G f i ( f i ( u , v ) ) η T ( x , u ) [ G f i ( f i ( u , v ) ) x f i ( u , v ) + { G f i ( f i ( u , v ) ) x f i ( u , v )
( x f i ( u , v ) ) T } + G f i ( f i ( u , v ) ) x x f i ( u , v ) } p i + 1 2 p i T [ G f i ( f i ( u , v ) ) x f i ( u , v )
( x f i ( u , v ) ) T + G f i ( f i ( u , v ) ) x x f i ( u , v ) ] p i 0 , i = 1 , 2 , 3 , 4 .
Putting the values of f 1 , f 2 , f 3 , f 4 , G f 1 , G f 2 , G f 3 , G f 4 and u = 0 in the above expressions, we have
π 1 = 0 , p , x , v π 6 , π 6 ,
π 2 = x 4 e 4 v , p , x , v π 6 , π 6 ,
π 3 = x 2 s i n 2 v , p , x , v π 6 , π 6 ,
and
π 4 = 0 , p , x , v π 6 , π 6 .
Hence, π 1 0 , π 2 0 (from Figure 1), π 3 0 (in Figure 2) and π 4 0 , x , v π 6 , π 6 and p .
Therefore, f is G f -bonvex at u = 0 with respect to η and p .
Next, we claim that function f is not η -bonvex. For this, it is sufficient to prove that at least one f i s is not η -bonvex.
Let
ξ = f 3 ( x ) f 3 ( u ) η T ( x , u ) [ x f 3 ( u ) x x f 3 ( u ) p 3 ] + 1 2 p 3 T [ x x f 3 ( u ) ] p 3
or
ξ = x e v u e v 0 , p , x , v π 6 , π 6 ,
ξ = x e v at u = 0 π 6 , π 6 .
It follows that ξ 0 , u π 6 , π 6 and p (in Figure 3). Therefore, f 3 is not η -bonvex at u = 0 with respect to p 3 . Hence, f = ( f 1 , f 2 , f 3 , f 4 ) is not η -bonvex at u = 0 with respect to p .
Definition 9.
Let C be a compact convex set in R n . The support function of C is defined by
s x | C = m a x { 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 f o r a l l z S } .
It is readily verified that for a compact convex set S, y is in N S ( x ) if and only if
s ( y | S ) = x T y .
Suppose that S 1 R n and S 2 R m are open sets such that C 1 × C 2 S 1 × S 2 .

3. Second-Order Nondifferentiable Multiobjective Symmetric Fractional Programming Problem Over Arbitrary Cones

Now, we consider the following pair of a nondifferentiable multiobjective second-order fractional symmetric dual program over arbitrary cones
(GMFP) Minimize U ( x , y , z , r , p ) = ( U 1 ( x , y , z 1 , r 1 , p 1 ) , U 2 ( x , y , z 2 , r 2 , p 2 ) , , U k ( x , y , z k , r k , p k ) ) T
  subject to
i = 1 k λ i [ G f i ( f i ( x , y ) ) y f i ( x , y ) z 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 ) } p i U i ( x , y , p i ) { G g i ( g i ( x , y ) ) y g i ( x , y ) + r i + { G g i ( g i ( x , y ) ) y g i ( x , y ) }
( y g i ( x , y ) ) T + G g i ( g i ( x , y ) ) y y g i ( x , y ) } p i ] C 2 * ,
y T [ i = 1 k λ i { G f i ( f i ( x , y ) ) y f i ( x , y ) z 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 ) } p i U i ( x , y , p i ) { G g i ( g i ( x , y ) ) y g i ( x , y ) + r i + { G g i ( g i ( x , y ) ) y g i ( x , y ) }
( y g i ( x , y ) ) T + G g i ( g i ( x , y ) ) y y g i ( x , y ) } p i } ] 0 ,
x C 1 , λ > 0 , z i D i , r i F i , i = 1 , 2 , , k .
(GMFD) Maximize T ( u , v , w , t , q ) = ( T 1 ( u , v , w 1 , t 1 , q 1 ) , ( T 2 ( u , v , w 2 , t 2 , q 2 ) , , T k ( u , v , w k , t k , q k ) ) T
     subject to
i = 1 k λ i [ G f i ( f i ( u , v ) ) x f i ( u , v ) + w i + G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T + G f i ( f i ( u , v ) )
x x f i ( u , v ) ] q i T i ( u , v , q i ) [ G g i ( g i ( u , v ) ) x g i ( u , v ) t i + { G g i ( g i ( u , v ) ) x g i ( u , v )
( x g i ( u , v ) ) T + G g i ( g i ( u , v ) ) x x g i ( u , v ) } q i ] C 1 * ,
u T [ i = 1 k λ i { G f i ( f i ( u , v ) ) x f i ( u , v ) w i + G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T + G f i ( f i ( u , v ) )
x x f i ( u , v ) ] q i T i ( u , v , q i ) [ G g i ( g i ( u , v ) ) x g i ( u , v ) t i + { G g i ( g i ( u , v ) )
x g i ( u , v ) ( x g i ( u , v ) ) T + G g i ( g i ( u , v ) ) x x g i ( u , v ) } q i } ] 0 ,
v C 1 , λ > 0 , w i Q i , t i E i , i = 1 , 2 , , k .
where
U i ( x , y , z i , r i , p i ) = G f i ( f i ( x , y ) ) + s ( x | Q i ) y T z i 1 2 p i T [ G f i ( f i ( x , y ) ) y f i ( x , y ) ( y f i ( x , y ) ) T G g i ( g i ( x , y ) ) s ( x | E i ) + y T r i 1 2 p i T [ G g i ( g i ( x , y ) ) y g i ( x , y ) ( y g i ( x , y ) ) T
+ G f i ( f i ( x , y ) ) y y f i ( x , y ) ] p i + G g i ( g i ( x , y ) ) y y g i ( x , y ) ] p i
and
T i ( u , v , w i , t i , q i ) = G f i ( f i ( u , v ) ) s ( v | D i ) + u T w i 1 2 q i T [ G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T G g i ( g i ( u , v ) ) + s ( v | F i ) u T t i 1 2 q i T [ G g i ( g i ( u , v ) ) x g i ( u , v ) ( x g i ( u , v ) ) T
+ G f i ( f i ( u , v ) ) x x f i ( u , v ) ] q i + G g i ( g i ( u , v ) ) x x g i ( u , v ) ] q i ;
and
S 1 R n and S 2 R m ; C 1 and C 2 are arbitrary cones in R n and R m , respectively, such that C 1 × C 2 S 1 × S 2 ; f i : S 1 × S 2 R and g i : S 1 × S 2 R are differentiable functions; G f i : I f i R and G g i : I g i R are differentiable strictly increasing functions on their domains; Q i , E i are compact convex sets in R n ; and D i , F i are compact convex sets in R m , i = 1 , 2 , 3 , , k . C 1 * and C 2 * are positive polar cones of C 1 and C 2 , respectively. It is assumed that in the feasible regions, the numerators are nonnegative and denominators are positive. p i and q i are vectors in R m and R n , respectively, λ R k .
Equivalently, the above problem is reduced in the given form:
(EGMFP) Min R ( x , y , z , r , p ) = ( R 1 ( x , y , z 1 , r 1 , p 1 ) , R 2 ( x , y , z 2 , r 2 , p 2 ) , , R k ( x , y , z k , r k , p k ) )
subject to
G f i ( f i ( x , y ) ) + s ( x | Q i ) y T z i 1 2 p i T [ 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 ) ] p i R i ( x , y , z i , r i , p i ) [ G g i ( g i ( u , v ) ) s ( x | E i ) + y T r i 1 2 q i T [ G g i ( g i ( u , v ) )
x g i ( u , v ) ( x g i ( u , v ) ) T + G g i ( g i ( u , v ) ) x x g i ( u , v ) ] q i ] = 0 , i = 1 , 2 , , k ,
i = 1 k λ i [ G f i ( f i ( x , y ) ) y f i ( x , y ) z 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 ) ] p i R i ( x , y , z i , r i , p i ) { G g i ( g i ( x , y ) ) + r i y g i ( x , y ) + ( G g i ( g i ( x , y ) )
y g i ( x , y ) ( y g i ( x , y ) ) T + G g i ( g i ( x , y ) ) y y g i ( x , y ) ) p i } ] C 2 * ,
y T i = 1 k λ i [ G f i ( f i ( x , y ) ) y f i ( x , y ) z 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 ) ] p i R i ( x , y , z i , r i , p i ) { G g i ( g i ( x , y ) ) y g i ( x , y ) + r i + ( G g i ( g i ( x , y ) )
y g i ( x , y ) ( y g i ( x , y ) ) T + G g i ( g i ( x , y ) ) y y g i ( x , y ) ) p i } ] 0 ,
x C 1 , λ > 0 , z i D i , r i F i , i = 1 , 2 , , k .
(EGMFD) Maximize S ( u , v , w , t , q ) = [ S 1 ( u , v , w 1 , t 1 , q 1 ) , S 2 ( u , v , w 2 , t 2 , q 2 ) , , S k ( u , v , w k , t k , q k ) ]
subject to
G f i ( f i ( u , v ) ) s ( v | D i ) + u T w i 1 2 q i T { G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T + G f i ( f i ( u , v ) )
x x f i ( u , v ) } q i S i ( u , v , w i , t i , q i ) [ G g i ( g i ( u , v ) ) + s ( v | F i ) u T t i 1 2 q i T { G g i " ( g i ( u , v ) ) x g i ( u , v )
( x g i ( u , v ) ) T + G g i ( g i ( u , v ) ) x x g i ( u , v ) q i } ] = 0 , i = 1 , 2 , , k .
i = 1 k λ i [ G f i ( f i ( u , v ) ) x f i ( u , v ) + w i + { G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T +
G f i ( f i ( u , v ) ) x x f i ( u , v ) } q i T i ( u , v , w i , t i , q i ) { G g i ( g i ( u , v ) ) x g i ( u , v ) t i + G g i ( g i ( u , v ) )
x g i ( u , v ) ( x g i ( u , v ) ) T + G g i ( g i ( u , v ) ) x x g i ( u , v ) } q i ] C 1 * ,
u T i = 1 k λ i [ G f i ( f i ( u , v ) ) x f i ( u , v ) + w i + { G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T +
G f i ( f i ( u , v ) ) x x f i ( u , v ) } q i T i ( u , v , w i , t i , q i ) { G g i ( g i ( u , v ) ) x g i ( u , v ) t i + G g i ( g i ( u , v ) )
x g i ( u , v ) ( x g i ( u , v ) ) T + G g i ( g i ( u , v ) ) x x g i ( u , v ) } q i ] 0 ,
v C 1 , λ > 0 , w i B i , t i E i , i = 1 , 2 , , k .
Let Z 0 and W 0 be the sets of feasible solutions of (EGMFP) and (EGMFD), respectively. Next, we prove duality theorems for (EGMFP) and (EGMFD), which equally apply to (GMFP) and (GMFD), respectively. Let z = ( z 1 , z 2 , , z k ) , r = ( r 1 , r 2 , , r k ) , w = ( w 1 , w 2 , , w k ) , t = ( t 1 , t 2 , , t k ) and λ = ( λ 1 , λ 2 , , λ k ) .
Theorem 1.
(Weak Duality). Let ( x , y , R , z , r , λ , p ) Z 0 and ( u , v , S , w , t , λ , q ) W 0 . Assume that for i = 1 , 2 , 3 , , k :
(i
f i ( . , v ) is G f i - bonvex and ( . ) T w i is invex at u for fixed v with respective to η 1 .
(ii
g i ( . , v ) is a G g i - boncave and ( . ) T t i is invex at u for fixed v with respective to η 1 .
(iii
f i ( x , . ) is a G f i - boncave and ( . ) T z i is invex at y for fixed x with respective to η 2 .
(iv
g i ( x , . ) is a G g i - bonvex and ( . ) T r i is invex at y for fixed x with respective to η 2 .
(v
η 1 ( x , u ) + u C 1 and η 2 ( v , y ) + y C 2 .
(vi
G g i ( ( x , v ) ) + v T r i x T t i > 0 .
Then, the following can not hold simultaneously:
R i S i , for all i = 1 , 2 , 3 , , k and R j < S j , for some j = 1 , 2 , 3 , , m .
Proof. 
From Assumption (v) and Equation (6), 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 + [ G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T
+ G f i ( f i ( u , v ) ) x x f i ( u , v ) ] q i T i ( u , v , q i ) { G g i ( g i ( u , v ) ) x g i ( u , v ) t i
+ ( G g i ( g i ( u , v ) ) x g i ( u , v ) ( x g i ( u , v ) ) T + G g i ( g i ( u , v ) ) x x g i ( u , v ) ) q i } ] 0 .
Using Equations (7) and (9), we obtain,
η 1 T ( x , u ) [ i = 1 k λ i ( G f i ( f i ( u , v ) ) x f i ( u , v ) + w i + [ G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T
+ G f i ( f i ( u , v ) ) x x f i ( u , v ) ] q i T i ( u , v , q i ) { G g i ( g i ( u , v ) ) x g i ( u , v ) t i
+ ( G g i ( g i ( u , v ) ) x g i ( u , v ) ( x g i ( u , v ) ) T + G g i ( g i ( u , v ) ) x x g i ( u , v ) ) q i } ) ] 0 .
From Assumption (i), we have
G f i ( f i ( x , v ) ) G f i ( f i ( u , v ) ) n 1 T ( x , u ) G f i ( f i ( u , v ) ) x f i ( u , v ) + [ G f i ( f i ( u , v ) ) x f i ( u , v )
( x f i ( u , v ) ) T + G f i ( f i ( u , v ) ) x x f i ( u , v ) ] p i 1 2 p i T [ G f i ( f i ( u , v ) ) x f i ( u , v )
( x f i ( u , v ) ) T + G f i ( f i ( u , v ) ) x x f i ( u , v ) p i ] , i = 1 , 2 , , k .
and
x T w i u T w i η 1 T ( x , u ) w i , i = 1 , 2 , , k .
Since λ > 0 and combining above inequalities, it follows that
i = 1 k [ G f i ( f i ( x , v ) ) + x T w i G f i ( f i ( u , v ) ) u T w i ] n 1 T ( x , u ) i = 1 k λ i [ G f i ( f i ( u , v ) ) x f i ( u , v ) + w i
+ [ G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T + G f i ( f i ( u , v ) ) x x f i ( u , v ) ] p i
1 2 p i T { G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T + G f i ( f i ( u , v ) ) x x f i ( u , v ) } p i ] .
Similarly, from Assumption (ii), we get
G g i ( g i ( x , v ) ) + G g i ( g i ( u , v ) ) η 1 T ( x , u ) [ G g i ( g i ( u , v ) ) x g i ( u , v ) + [ G g i ( g i ( u , v ) )
x g i ( u , v ) ( x g i ( u , v ) ) T + G g i ( g i ( u , v ) ) x x g i ( u , v ) ] p i + 1 2 p i T { G g i ( g i ( u , v ) ) x g i ( u , v )
( x g i ( u , v ) ) T + G g i ( g i ( u , v ) ) x g i ( u , v ) } p i ] , i = 1 , 2 , , k ,
and
x T t i u T t i η 1 T ( x , u ) t i , i = 1 , 2 , , k .
Multiplying by λ i T i in above inequalities and taking summation over i = 1 , 2 , 3 , , k , it follows that
i = 1 ˆ k λ i T i [ G g i ( g i ( x , v ) ) + x T t i + G g i ( g i ( u , v ) ) u T t i ] η 1 T ( x , u ) i = 1 ˆ k λ i T i [ [ G g i ( g i ( u , v ) ) t i +
x g i ( u , v ) [ G g i ( g i ( u , v ) ) x g i ( u , v ) ( x g i ( u , v ) ) T + G g i ( g i ( u , v ) ) x x g i ( u , v ) ] p i
1 2 p i ¯ T { G g i ( g i ( u , v ) ) x g i ( u , v ) ( x g i ( u , v ) ) T + G g i ( g i ( u , v ) ) x g i ( u , v ) p i } ] .
Adding the inequalities in Equations (13) and (16), we get
i = 1 ˆ k λ i [ G f i ( f i ( x , v ) ) G f i ( f i ( u , v ) ) T i ( G g i ( g i ( x , v ) ) G g i ( g i ( u , v ) ) ) ]
i = 1 k λ i q i T 2 [ G f i ( f i ( u , v ) ) x x f i ( u , v ) + G f i ( f i ( u , v ) ) x f i ( u , v ) ( x f i ( u , v ) ) T
T i { G g i ( g i ( u , v ) ) x x g i ( u , v ) + G g i ( g i ( u , v ) ) x g i ( u , v ) ( x g i ( u , v ) ) T } g i ] .
Since v T r i s ( v | F i ) , from Equations (17) and (5), we get
i = 1 k λ i [ G f i ( f i ( x , v ) ) + x T w i s ( v | D i ) + T i ( x T t i v T r i G g i ( g i ( x , v ) ) ) ] 0 .
Similarly, using Hypotheses (iii)–(v) and the primal constraints in Equations (1)–(4), we have
i = 1 k λ i [ G f i ( f i ( x , v ) ) + v T z i s ( x | Q i ) + R i ( x T t i + v T r i + G g i ( g i ( x , v ) ) ) ] 0 .
On adding the inequalities in Equations (18) and (19), we get
i = 1 k λ i [ v T z i s ( v | D i ) + x T w i G f i ( f i ( x , v ) ) s ( x | Q i )
+ ( R i S i ) ( x T t i + v T r i + G g i ( g i ( x , v ) ) ) ] 0 .
Since λ i > 0 , v T z i s ( v | D i ) + x T w i s ( x | C i ) 0 , i = 1 , 2 , 3 , , k , it yields
i = 1 k λ i ( R i T i ) ( G g i ( g i ( x , v ) ) + v T r i x T t i ) 0 .
From Assumption (vi), we have, G g i ( ( x , v ) ) + v T r i x T t i > , i = 1 , 2 , 3 , , k . Since λ > 0 , it follows that R S , hence the result. □
Remark 1.
Since every convex function is pseudoconvex, the above weak duality theorem for the symmetric dual pair (EGMFP) and (EGMFD) can also be obtained under pseudobonvexity assumptions.
Theorem 2.
(Weak Duality). Let ( x , y , R , z , r , λ , p ) Z 0 and ( u , v , S , w , t , λ , q ) W 0 . Assume that for i = 1 , 2 , 3 , , k :
(i
f i ( . , v ) is G f i - pseudobonvex and ( . ) T w i is pseudoinvex at u for fixed v with respective to η 1 .
(ii
g i ( . , v ) is a G g i - pseudoboncave and ( . ) T t i is pseudoinvex at u for fixed v with respective to η 1 .
(iii
f i ( x , . ) is a G f i - pseudoboncave and ( . ) T z i is pseudoinvex at y for fixed x with respective to η 2 .
(iv
g i ( x , . ) is a G g i - pseudobonvex and ( . ) T r i is pseudoinvex at y for fixed x with respective to η 2 .
(v
η 1 ( x , u ) + u C 1 and η 2 ( v , y ) + y C 2 .
(vi
G g i ( ( x , v ) ) + v T r i x T t i > 0 .
Then, the following cannot hold simultaneously:
R i S i , for all i = 1 , 2 , 3 , , k and R j < S j , for some j = 1 , 2 , 3 , , m .
Proof. 
The proof follows on the lines of Theorem 1. □
Theorem 3.
(Strong Duality). Let ( x ¯ , y ¯ , R ¯ , z ¯ , r ¯ , λ ¯ , p ¯ ) be an efficient solution to (EGMFP), fix λ = λ ¯ in (EGMFD). Further, assume that
(i
{ G f i ( f i ( x ¯ , y ¯ ) ) y y f i ( x ¯ , y ¯ ) + G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ) ( y f i ( x ¯ , y ¯ ) ) T R i ¯ { G g i ( g i ( x ¯ , y ¯ ) ) y y g i ( x ¯ , y ¯ )
+ G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ¯ ) ( y g i ( x ¯ , y ¯ ) ) T } ] is positive definite
and
p i T [ G f i ( f i ( x ¯ , y ¯ ) ) y y f i ( x ¯ , y ¯ ) + [ G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ) ( y f i ( x ¯ , y ¯ ) ) T R i ¯ [ G g i ( g i ( x ¯ , y ¯ ) )
y y g i ( x ¯ , y ¯ ) + G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ¯ ) ( y g i ( x ¯ , y ¯ ) ) T 0 , for all i = 1 , 2 , 3 , , k .
(ii
The matrix { G f i ( f i ( x ¯ , y ¯ ) ) y y f i ( x ¯ , y ¯ ) + G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ) ( y f i ( x ¯ , y ¯ ) ) T R i ¯ [ G g i ( g i ( x ¯ , y ¯ ) )
y y g i ( x ¯ , y ¯ ) + G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ¯ ) ( y g i ( x ¯ , y ¯ ) ) T } is positive definite for i = 1 , 2 , 3 , , k .
(iii
For β > 0 and p i ¯ R m , p i ¯ 0 , i = 1 , 2 , , k implies that
i = 1 k β i p i ¯ [ G f i ( f i ( x ¯ , y ¯ ) ) y y f i ( x ¯ , y ¯ ) + [ G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ) ( y f i ( x ¯ , y ¯ ) ) T R i ¯ [ G g i ( g i ( x ¯ , y ¯ ) )
y y g i ( x ¯ , y ¯ ) + G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ) ( y g i ( x ¯ , y ¯ ) ) T 0 .
(iv
[ G f i ( f i ( x ¯ , y ¯ ) ) y y f i ( x ¯ , y ¯ ) + { G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) ( y f i ( x ¯ , y ¯ ) ) T R i ¯ ( G g i ( g i ( x ¯ , y ¯ ) ) y y g i ( x ¯ , y ¯ )
+ G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ) ( y g i ( x ¯ , y ) ) T ) } ] i = 1 k is linearly independent.
(v
R i ¯ > 0 , i = 1 , 2 , 3 , , k .
Then, there exist w ¯ i Q and t ¯ i E i , i = 1 , 2 , 3 , , k such that ( x ¯ , y ¯ , R ¯ , w ¯ , λ ¯ , t ¯ , q ¯ = 0 ) is feasible for (EGMFD). Furthermore, if the assumptions of Theorem 1 or Theorem 2 are satisfied, then ( x ¯ , y ¯ , R ¯ , w ¯ , λ ¯ , t ¯ , q ¯ = 0 ) is an efficient solution to (EGMFD).
Proof. 
Since ( x ¯ , y ¯ , R ¯ , w ¯ , λ ¯ , t ¯ , q ¯ = 0 ) is an efficient solution of (EMFP), by Fritz John necessary conditions [14], there exists α R k , β R + , γ C , δ R and ξ R k such that
( x x ¯ ) T i = 1 k β i [ G f i ( f i ( x ¯ , y ¯ ) ) x f i ( x ¯ , y ¯ ) + w ¯ i 1 2 p ¯ i T x [ { 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 ¯ ) } ] p ¯ i R ¯ i ( G g i ( g i ( x ¯ , y ¯ ) ) x g i ( x ¯ , y ¯ ) + t ¯ i 1 2 p ¯ i T x [ { G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ¯ )
( y g i ( x ¯ , y ¯ ) ) T + G g i ( g i ( x ¯ , y ¯ ) ) y y g i ( x ¯ , y ¯ ) } ] p ¯ i ) ] + ( γ δ 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 ¯ ) + x [ { 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 ¯ ) } p ¯ i ] R ¯ i ( G g i ( g i ( x ¯ , y ¯ ) ) x g i ( x ¯ , y ¯ ) y g i ( x ¯ , y ¯ ) + G g i ( g i ( x ¯ , y ¯ ) ) x y g i ( x ¯ , y ¯ )
+ x [ { G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ¯ ) ( y g i ( x ¯ , y ¯ ) ) T + G g i ( g i ( x ¯ , y ¯ ) ) y y g i ( x ¯ , y ¯ ) } p ¯ i ] ) ] 0 , x C 1 ,
i = 1 k [ ( β i δ λ ¯ i ) { ( G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) z ¯ i + ( G f i ( f i ( x ¯ , y ¯ ) ) y y f i ( x ¯ , y ¯ ) + ( G f i ( f i ( x ¯ , y ¯ ) )
y f i ( x ¯ , y ¯ ) ( y f i ( x ¯ , y ¯ ) ) T ) p ¯ i ) R ¯ i ( ( G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ¯ ) + r ¯ i + ( G g i ( g i ( x ¯ , y ¯ ) ) y y g i ( x ¯ , y ¯ )
+ ( G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ¯ ) ( y g i ( x ¯ , y ¯ ) ) T ) p ¯ i ) } ) + ( ( γ δ y ¯ ) λ ¯ i β i p ¯ i ) { ( G f i ( f i ( x ¯ , y ¯ ) )
y y f i ( x ¯ , y ¯ ) + ( G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ) ( y f i ( x ¯ , y ¯ ) ) T ) R ¯ i ( G g i ( g i ( x ¯ , y ¯ ) ) y y g i ( x ¯ , y ¯ )
+ ( G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ) ( y g i ( x ¯ , y ¯ ) ) T ) } + ( γ δ y ¯ ) λ ¯ i β i p ¯ i 2 { y ( ( G f i ( f i ( x ¯ , y ¯ ) ) y y f i ( x ¯ , y ¯ )
+ ( G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) ( y f i ( x ¯ , y ¯ ) ) T ) p ¯ i ) R ¯ i ( y ( ( G g i ( g i ( x ¯ , y ¯ ) )
y y g i ( x ¯ , y ¯ ) + ( G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ) ( y g i ( x ¯ , y ) ( x ¯ , y ¯ ) ) T ) p ¯ i ) } ] = 0 ,
( γ δ y ¯ ) { ( G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) z ¯ i + ( G f i ( f i ( x ¯ , y ¯ ) ) y y f i ( x ¯ , y ¯ ) + ( G f i ( f i ( x ¯ , y ¯ ) )
y f i ( x ¯ , y ¯ ) ( y f i ( x ¯ , y ¯ ) ) T ) p ¯ i ) R ¯ i ( ( G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ¯ ) + r ¯ i + ( G g i ( g i ( x ¯ , y ¯ ) ) y y g i ( x ¯ , y ¯ )
g i ( x ¯ , y ¯ ) + ( G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ¯ ) ( y g i ( x ¯ , y ¯ ) ) T ) p ¯ i ) ) = 0 , i = 1 , 2 , 3 , , k ,
( λ i ¯ ( γ δ y ¯ ) β i p i ¯ ) T [ G f i ( f i ( x ¯ , y ¯ ) ) y y f i ( x ¯ , y ¯ ) + G f i ( f i ( x ¯ , y ¯ ) ( y f i ( x ¯ , y ¯ ) )
( y f i ( x ¯ , y ¯ ) ) T R i ¯ [ G g i ( g i ( x ¯ , y ¯ ) ) y y g i ( x ¯ , y ¯ ) + G g i ( g i ( x ¯ , y ¯ ) ) ( y g i ( x ¯ , y ¯ ) )
( y g i ( x ¯ , y ¯ ) ) T ] ] = 0 , i = 1 , 2 , 3 , , k .
α i β i [ G g i ( g i ( x ¯ , y ¯ ) ) s ( x ¯ | E i ) + y ¯ T r ¯ i 1 2 p i ¯ T [ G g i ( g i ( x ¯ , y ¯ ) ) y y g i ( x ¯ , y ¯ ) + G g i ( g i ( x ¯ , y ¯ ) )
( y g i ( x ¯ , y ¯ ) ) ( y g i ( x ¯ , y ¯ ) ) T ) p i ] ( γ δ y ¯ ) [ λ i ¯ ( G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ¯ ) + r ¯ i +
( G g i ( g i ( x ¯ , y ¯ ) ) y y g i ( x ¯ , y ¯ ) + G g i ( g i ( x ¯ , y ¯ ) ) ( y g i ( x ¯ , y ¯ ) ) ( y g i ( x ¯ , y ¯ ) ) T ) ) p i ¯ ] = 0 , i = 1 , 2 , , k .
β i y ¯ + ( γ δ y ¯ ) λ ¯ i N D i ( z ¯ i ) , i = 1 , 2 , , K ,
β i R i ¯ y ¯ + ( γ δ y ¯ ) R ¯ i λ ¯ i N F i ( r ¯ i ) , i = 1 , 2 , 3 , , k ,
y ¯ T i = 1 k λ i ¯ [ G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) z ¯ i + ( G f i ( f i ( x ¯ , y ¯ ) ) y y f i ( x ¯ , y ¯ ) + G f i ( f i ( x ¯ , y ¯ ) )
( y f i ( x ¯ , y ¯ ) ) ( y f i ( x ¯ , y ¯ ) ) T ) p i ¯ R i ¯ [ G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) + r ¯ i + { G g i ( g i ( x ¯ , y ¯ ) )
y y g i ( x ¯ , y ¯ ) + G g i ( g i ( x ¯ , y ¯ ) ) ( y g i ( x ¯ , y ¯ ) ) ( y g i ( x ¯ , y ¯ ) ) T ) p i ¯ ] ] = 0 .
δ y ¯ T i = 1 k λ i ¯ [ G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) z ¯ i + ( G f i ( f i ( x ¯ , y ¯ ) ) y y f i ( x ¯ , y ¯ ) + G f i ( f i ( x ¯ , y ¯ ) )
( y f i ( x ¯ , y ¯ ) ) ( y f i ( x ¯ , y ¯ ) ) T ) p i ¯ R i ¯ [ G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) + r ¯ i + { G g i ( g i ( x ¯ , y ¯ ) )
y y g i ( x ¯ , y ¯ ) + G g i ( g i ( x ¯ , y ¯ ) ) . . ( y g i ( x ¯ , y ¯ ) ) ( y g i ( x ¯ , y ¯ ) ) T ) p i ¯ ] ] = 0 .
λ ¯ T ξ = 0 ,
w ¯ i Q i , t ¯ i E i , x ¯ T t ¯ i = S ( x ¯ | E i ) , x ¯ T w ¯ i = S ( x ¯ | Q i ) , i = 1 , 2 , 3 , , k ,
( α , δ , ξ ) 0 , ( α , β , γ , δ , ξ ) 0 .
From Assumption (i) and Equation (24), we have
γ λ ¯ i β i p i ¯ λ i ¯ δ y ¯ = 0 .
We claim that β i 0 , i . The proof is by contradiction. Let β i = 0 for some i . Since λ ¯ > 0 , the relation in Equation (33) yields
γ = δ y ¯ .
From the relation in Equations (22), (33) and (34), we obtain
i = 1 k ( β i δ λ i ¯ ) [ G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) z ¯ i + ( G f i ( f i ( x ¯ , y ¯ ) ) y y f i ( x ¯ , y ¯ ) +
G f i ( f i ( x ¯ , y ¯ ) ) ( y f i ( x ¯ , y ¯ ) ) ( y f i ( x ¯ , y ¯ ) ) T ) p i ¯ R i ¯ [ G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ¯ ) + r ¯ i
+ { G g i ( g i ( x ¯ , y ¯ ) ) ( y g i ( x ¯ , y ¯ ) ) ( y g i ( x ¯ , y ¯ ) ) T ) + G g i ( y y g i ( x ¯ , y ¯ ) ) } p i ¯ ) ] = 0 .
On using Asumption (iv), this gives
β i δ λ i ¯ = 0 , i = 1 , 2 , , k .
Since β i = 0 , we obtain δ λ i ¯ = 0 but λ i ¯ > 0 , i = 1 , 2 , , k and thus the relation in Equation (36) implies δ = 0 . Thus, from the relation in Equations (25), (34) and (36), we get α i = 0 , i = 1 , 2 , , k . In addition, from the relation in Equation (34), we get γ = 0 , which is a contradiction, since ( α , β , γ , δ ) 0 . Hence, we get β i 0 , i = 1 , 2 , , k .
Since λ ¯ > 0 , using Equations (22) and (33), we get
i = 1 k β i p ¯ i [ G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) + w ¯ i + ( G f i ( f i ( x ¯ , y ¯ ) ) y y f i ( x ¯ , y ¯ ) +
G f i ( f i ( x ¯ , y ¯ ) ) ( y f i ( x ¯ , y ¯ ) ) ( y f i ( x ¯ , y ¯ ) ) T ) p i ¯ R i ¯ [ G g i ( g i ( x ¯ , y ¯ ) ) y g i ( x ¯ , y ¯ ) t ¯ i
+ { G g i ( g i ( x ¯ , y ¯ ) ) ( y g i ( x ¯ , y ¯ ) ) ( y g i ( x ¯ , y ¯ ) ) T ) + G g i ( y y g i ( x ¯ , y ¯ ) ) } p i ¯ ) ] = 0 .
Hence, from Assumption (iii), we get p i ¯ = 0 , i = 1 , 2 , , k . From the relation in Equation (33), p i ¯ = 0 , i = 1 , 2 , , k and λ ¯ > 0 , we have γ = δ y ¯ , from Equations (21) and (22), we have
i = 1 k λ i ¯ [ G f i ( f i ( x ¯ , y ¯ ) ) x f i ( x ¯ , y ¯ ) + w ¯ i R i ¯ [ G g i ( g i ( x ¯ , y ¯ ) ) x g i ( x ¯ , y ¯ ) t ¯ i ] ] = 0 .
i = 1 k ( β i δ λ i ¯ ) [ G f i ( f i ( x ¯ , y ¯ ) ) y f i ( x ¯ , y ¯ ) + w ¯ i R i ¯ G g i y g i ( x ¯ , y ¯ ) t ¯ i ] = 0 .
By Assumptions (i) and (iii), we have
β i = δ λ i ¯ , i = 1 , 2 , , k .
Since β i > 0 and λ i ¯ > 0 , i = 1 , 2 , , k , the relation in Equation (40) implies that δ > 0 , and the relation in Equation (38) reduces to
( x x ¯ ) T i = 1 k λ ¯ i [ G f i ( f i ( x ¯ , y ¯ ) ) x f i ( x ¯ , y ¯ ) + w ¯ i R ¯ i ( G g i ( g i ( x ¯ , y ¯ ) ) x g i ( x ¯ , y ¯ ) t ¯ i ) ] 0 , x C 1 .
Let x C 1 . Then, x + x ¯ C 1 as C 1 is a closed convex cone. On substituting x + x ¯ into the place of x in Equation (41), we get
x T i = 1 k λ ¯ i [ ( G f i ( f i ( x ¯ , y ¯ ) ) x f i ( x ¯ , y ¯ ) + w ¯ i ) R ¯ i ( G g i ( g i ( x ¯ , y ¯ ) ) x g i ( x ¯ , y ¯ ) t ¯ i ) ] 0 .
Hence,
i = 1 k λ ¯ i [ ( G f i ( f i ( x ¯ , y ¯ ) ) x f i ( x ¯ , y ¯ ) + w ¯ i ) R ¯ i ( G g i ( g i ( x ¯ , y ¯ ) ) x g i ( x ¯ , y ¯ ) t ¯ i ) ] C 1 * .
In addition, by letting x = 0 and x = 2 x ¯ simultaneously in Equation (41), we have
x ¯ T i = 1 k λ ¯ i [ ( G f i ( f i ( x ¯ , y ¯ ) ) x f i ( x ¯ , y ¯ ) + w ¯ i ) R ¯ i ( G g i ( g i ( x ¯ , y ¯ ) ) x g i ( x ¯ , y ¯ ) t ¯ i ) ] = 0 .
Since γ = δ y ¯ and δ > 0 , we have
y ¯ = γ δ C 2 .
From Equations (26) and (34) and using β > 0 , we get y ¯ N D i ( z ¯ i ) , i = 1 , 2 , 3 , , k This implies
y ¯ T z ¯ i = S ( y ¯ | D i ) , i = 1 , 2 , 3 , , k .
Similarly, by Equation (27) and Assumption (iii), y ¯ N F i ( r ¯ i ) , i = 1 , 2 , 3 , , k , we obtain
y ¯ T r ¯ i = S ( y ¯ | F i ) , i = 1 , 2 , 3 , , k .
Combining Equations (31), (45), (46) and (31), it follows that
( G f i ( f i ( x ¯ , y ¯ ) ) S ( y ¯ | D i ) + x ¯ T w ¯ i ) R ¯ i ( G g i ( g i ( x ¯ , y ¯ ) ) + S ( y ¯ | F i ) x ¯ T t ¯ i ) = 0 , i = 1 , 2 , 3 , , k .
This together with Equations (42), (43) and (47) shows that ( x ¯ , y ¯ , R ¯ , λ ¯ , w ¯ , t ¯ ) W 0 . Now, let ( x ¯ , y ¯ , R ¯ , λ ¯ , w ¯ , t ¯ ) be not an efficient solution of (EGMFD). Then, there exists other ( u , v , R , λ , w , t ) W 0 such that R ¯ i S i , i = 1 , 2 , , k and R j ¯ < S j , for some j = 1 , 2 , , m . This contradicts the result of the Theorems 1 and 2. Hence, the proof is complete.  □
Remark 2.
In the case of symmetric programming problem, the proof of converse duality theorem remains same as Theorem 3.
Theorem 4.
(Converse duality theorem). Let ( u ¯ , v ¯ , S ¯ , t ¯ , w ¯ , λ ¯ , q ¯ ) be an efficient solution to (EGMFD), fix λ = λ ¯ in (EGMFP). Further, assume that
(i
{ G f i ( f i ( u ¯ , v ¯ ) ) x x f i ( u ¯ , v ¯ ) + G f i ( f i ( u ¯ , v ¯ ) ) x f i ( u ¯ , v ¯ ) ( x f i ( u ¯ , v ¯ ) ) T S i ¯ { G g i ( g i ( u ¯ , v ¯ ) ) x x g i ( u ¯ , v ¯ )
+ G g i ( g i ( u ¯ , v ¯ ) ) x g i ( u ¯ , v ¯ ) ( x g i ( u ¯ , v ¯ ) ) T } ] is positive definite and
q i T [ G f i ( f i ( u ¯ , v ¯ ) ) x x f i ( u ¯ , v ¯ ) + [ G f i ( f i ( u ¯ , v ¯ ) ) x f i ( u ¯ , v ¯ ) ( x f i ( u ¯ , v ¯ ) ) T S i ¯ [ G g i ( g i ( u ¯ , v ¯ ) )
x x g i ( u ¯ , v ¯ ) + G g i ( g i ( u ¯ , v ¯ ) ) x g i ( u ¯ , v ¯ ) ( x g i ( u ¯ , v ¯ ) ) T 0 , for all i = 1 , 2 , 3 , , k .
(ii
The matrix { G f i ( f i ( u ¯ , v ¯ ) ) x x f i ( u ¯ , v ¯ ) + [ G f i ( f i ( u ¯ , v ¯ ) ) x f i ( u ¯ , v ¯ ) ( x f i ( u ¯ , v ¯ ) ) T S i ¯ [ G g i ( g i ( u ¯ , v ¯ ) )
x x g i ( u ¯ , v ¯ ) + G g i ( g i ( u ¯ , v ¯ ) ) x g i ( u ¯ , v ¯ ) ( x g i ( u ¯ , v ¯ ) ) T } is positive definite for i = 1 , 2 , 3 , , k .
(iii
For β > 0 and q i ¯ R n , q i ¯ 0 , i = 1 , 2 , , k implies that
i = 1 k β i q i ¯ [ G f i ( f i ( u ¯ , v ¯ ) ) x x f i ( u ¯ , v ¯ ) + [ G f i ( f i ( u ¯ , v ¯ ) ) x f i ( u ¯ , v ¯ ) ( x f i ( u ¯ , v ¯ ) ) T S i ¯ [ G g i ( g i ( u ¯ , v ¯ ) )
x x g i ( u ¯ , v ¯ ) + G g i ( g i ( u ¯ , v ¯ ) ) x g i ( u ¯ , v ¯ ) ( x g i ( u ¯ , v ¯ ) ) T 0 ,
(iv
[ G f i ( f i ( u ¯ , v ¯ ) ) x x f i ( u ¯ , v ¯ ) + { G f i ( f i ( u ¯ , v ¯ ) ) x f i ( u ¯ , v ¯ ) ( x f i ( u ¯ , v ¯ ) ) T S i ¯ ( G g i ( g i ( u ¯ , v ¯ ) )
x x g i ( u ¯ , v ¯ ) + G g i ( g i ( u ¯ , v ¯ ) ) x g i ( u ¯ , v ¯ ) ( x ( g i ( u ¯ , v ¯ ) ) T ) } ] i = 1 k is linearly independent.
(v
S i ¯ > 0 , i = 1 , 2 , 3 , , k . Then, there exist z ¯ i D i and r ¯ i E i , i = 1 , 2 , 3 , , k such that ( u ¯ , v ¯ , S ¯ , z ¯ , λ ¯ , r ¯ , p ¯ = 0 ) is feasible for (EGMFP). Furthermore, if the assumptions of Theorem 1 or Theorem 2 are satisfied, then ( u ¯ , v ¯ , S ¯ , z ¯ , λ ¯ , r ¯ , p ¯ = 0 ) is an efficient solution to (EGMFP).
Proof. 
The results can be obtained on the lines of Theorem 3. □

4. Conclusions

In this paper, we use the concept of G f - bonvex/ G f -pseudobonvex functions to establish duality results for G- Mond–Weir type dual model related to multiobjective nondifferentiable second-order symmetric fractional programming problem over arbitrary cones. Numerical examples are also illustrated to justify the existence of such type of functions. The present work can be further extended to nondifferentiable higher-order symmetric fractional programming over cones. This will orient the future task for the researcher working in this area.

Author Contributions

All authors contributed equally in writing this article. All authors read and approved the final manuscript.

Acknowledgments

The authors wish to thank the referees for useful comments.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Suneja, S.K.; Aggarwal, S.; Davar, S. Multiobjective symmetric duality involving cones. Eur. J. Oper. Res. 2002, 141, 471–479. [Google Scholar] [CrossRef]
  2. Chinchuluun, A.; Pardalos, P.M. A survey of multiobjective optimization. Ann. Oper. Res. 2007, 154, 29–50. [Google Scholar] [CrossRef]
  3. Mangasarian, O.L. Second and higher-order duality in nonlinear programming. J. Math. Anal. Appl. 1975, 51, 607–620. [Google Scholar] [CrossRef]
  4. Kim, D.S.; Yun, Y.B.; Lee, W.J. Multiobjective symmetric duality with cone constraints. Eur. J. Oper. Res. 1998, 107, 686–691. [Google Scholar] [CrossRef]
  5. Suneja, S.K.; Lalitha, C.S.; Khurana, S. Second order symmetric duality in multiobjective programming. Eur. J. Oper. Res. 2003, 144, 492–500. [Google Scholar] [CrossRef]
  6. Khurana, S. Symmetric duality in multiobjective programming involving generalized cone-invex functions. Eur. J. Oper. Res. 2005, 165, 592–597. [Google Scholar] [CrossRef]
  7. Antcza, T. New optimality conditions and duality results of G-type in differentiable mathematical programming. Nonlinear Anal. 2007, 66, 1617–1632. [Google Scholar] [CrossRef]
  8. Dubey, R.; Mishra, L.N.; Mishra, V.N. Duality relations for a class of a multiobjective fractional programming problem involving support functions. Am. J. Oper. Res. 2018, 8, 294–311. [Google Scholar]
  9. Dubey, R.; Mishra, V.N. Symmetric duality results for a nondifferentiable multiobjective programming problem with support function under strongly assumptions. RAIRO-Operation Res. 2019, 53, 539–558. [Google Scholar] [CrossRef]
  10. Dubey, R.; Mishra, L.N.; Ali, R. Special class of second-order non-differentiable symmetric duality problems with (G,αf)-pseudobonvexity assumptions. Mathematics 2019, 7, 763. [Google Scholar] [CrossRef]
  11. Antczak, T. On G-invex multiobjective programming. Part I. Optim. J. Glob. Optim. 2009, 43, 97–109. [Google Scholar] [CrossRef]
  12. Kang, Y.M.; Kim, D.S.; Kim, M.H. Optimality conditions of G-type in locally Lipchitz multiobjective programming. Viet. J. Math. 2014, 40, 275–285. [Google Scholar]
  13. Gao, X. Sufficiency in multiobjective programming under second-order B–(p,r)–V-type Ifunctions. J. Interdiscip. Math. 2014, 17, 385–402. [Google Scholar] [CrossRef]
  14. Brumelle, S. Duality for multiple objective convex programs. Math. Oper. Res. 1981, 6, 159–172. [Google Scholar] [CrossRef]
Figure 1. The function π 2 = x 4 e 4 v , p , x , v π 6 , π 6 is non-negative.
Figure 1. The function π 2 = x 4 e 4 v , p , x , v π 6 , π 6 is non-negative.
Symmetry 11 01348 g001
Figure 2. The function π 3 = x 2 s i n 2 v , p , x , v π 6 , π 6 is non-negative.
Figure 2. The function π 3 = x 2 s i n 2 v , p , x , v π 6 , π 6 is non-negative.
Symmetry 11 01348 g002
Figure 3. The function ξ = x e v becomes negative at some x , v π 6 , π 6 .
Figure 3. The function ξ = x e v becomes negative at some x , v π 6 , π 6 .
Symmetry 11 01348 g003

Share and Cite

MDPI and ACS Style

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. https://doi.org/10.3390/sym11111348

AMA Style

Dubey R, Mishra LN, Sánchez Ruiz LM. Nondifferentiable G-Mond–Weir Type Multiobjective Symmetric Fractional Problem and Their Duality Theorems under Generalized Assumptions. Symmetry. 2019; 11(11):1348. https://doi.org/10.3390/sym11111348

Chicago/Turabian Style

Dubey, Ramu, Lakshmi Narayan Mishra, and Luis Manuel Sánchez Ruiz. 2019. "Nondifferentiable G-Mond–Weir Type Multiobjective Symmetric Fractional Problem and Their Duality Theorems under Generalized Assumptions" Symmetry 11, no. 11: 1348. https://doi.org/10.3390/sym11111348

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