Next Article in Journal
Approximation by Generalized Lupaş Operators Based on q-Integers
Next Article in Special Issue
The Existence of Solutions to Nonlinear Matrix Equations via Fixed Points of Multivalued F-Contractions
Previous Article in Journal
Evaluation of Elite Athletes Training Management Efficiency Based on Multiple Criteria Measure of Conditioning Using Fewer Data
Previous Article in Special Issue
Topological Properties of E-Metric Spaces with Applications to Fixed Point Theory
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Second-Order Parametric Free Dualities for Complex Minimax Fractional Programming

Department of Applied Mathematics, Feng-Chia University, Tai-Chung 40724, Taiwan
Mathematics 2020, 8(1), 67; https://doi.org/10.3390/math8010067
Submission received: 26 November 2019 / Revised: 22 December 2019 / Accepted: 28 December 2019 / Published: 2 January 2020
(This article belongs to the Special Issue Fixed Point Theory and Dynamical Systems with Applications)

Abstract

:
In this paper, we will consider a minimax fractional programming in complex spaces. Since a duality model in a programming problem plays an important role, we will establish the second-order Mond–Weir type and Wolfe type dual models, and derive the weak, strong, and strictly converse duality theorems.

1. Introduction

The minimax theorems are very important results in fixed point theory, game theory, minimax programming problems, etc. John Nash provided an alternative proof of the minimax theorem using Brouwer’s fixed point theorem. Later, Fan [1] established some minimax theorems on nonlinear spaces. For instance, if X , Y are the compact Hausdorff spaces, and if the real-valued functional f : X × Y R satisfies some suitable conditions, then
min x X max y Y f ( x , y ) = max y Y min x X f ( x , y ) .
On the other hand, many authors considered the left-hand side of the above equality with some constraints, as a minimax programming problem. In 1977, Schmittendorf [2] first considered the following real minimax problem:
min x X sup y Y f ( x , y ) s . t . X = { x R n | h ( x ) < 0 } ,
where Y is a compact subset in R m , functions f : R n × R m R and h : R n R p are C 1 mappings. Since then, authors were interested in various types of the real minimax programming problems. They derived the necessary and sufficient optimality conditions, and investigated various types of duality models (see [3,4,5,6,7]). The generalized convexity is an important mathematical tool for studying the sufficient optimality conditions and duality models in programming problems. For instance, Mititelu and Treanţǎ [8] studied the efficiency conditions in vector control problems governed by multiple integrals. Treanţǎ and Mititelu [9] investigated the duality with ( ρ , b ) -quasiinvexity for multidimensional vector fractional control problems. Cipu [10] considered the duality results in quasiinvex variational control problems with curvilinear integral functionals. Treanţǎ [11] also studied the multiobjective fractional variational problem on higher-order jet bundles.
For the minimax programming problems in complex spaces, Datta and Bhatia [12] first considered the following complex minimax programming:
min x X sup y Y Re f ( x , y ) s . t . x X = { x C 2 n | h ( x ) T } ,
where Y is a compact subset in C 2 m , T is a polyhedral cone in C p , functions f ( · , y ) and h ( · ) are analytic on Q = x = ( x , x ¯ ) | x C n C 2 n . Remark that a nonlinear analytic function f : C n C does not have a convex real part. As a consequence, we consider the complex functions defined on a linear manifold of the set Q = x = ( x , x ¯ ) | x C n C 2 n (see Ferrero [13]).
After then, authors considered various types of the complex minimax programming problems, established the optimality conditions, and studied various types of duality models under some generalized convexities (see [14,15,16,17,18]).
In 2017, Huang [19] has constructed the second-order duality for non-differentiable complex minimax programming problems. Huang and Lai [20] also established the second-order parametric duality for complex minimax fractional programming problem, and derived the duality theorems under generalized Θ -bonvexity.
In this paper, we are interested in a complex fractional minimax programming problem:
( P ) min x X sup y Y Re f ( x , y ) Re g ( x , y ) subject   to x X = { x C 2 n | h ( x ) T } ,
where Y is a specified compact subset in C 2 m , T is a polyhedral cone in C p ; for x = ( x , x ¯ ) C 2 n , y = ( y , y ¯ ) C 2 m , functions f ( · , · ) and g ( · , · ) are continuous functions; for each y Y , f ( · , y ) , g ( · , y ) and h ( · ) are analytic on the Q = x = ( x , x ¯ ) | x C n C 2 n , and, without loss of generality, we could assume that Re f ( x , y ) 0 and Re g ( x , y ) > 0 .
Our main goals of this paper will establish two types of second-order parametric free dual model for the complex minimax fractional programming problem (P), and prove that the weak, strong, and strictly converse duality theorems under generalized Θ -bonvexity assumptions.
This paper is divided into five sections. In order to construct the second-order parametric free dual models, the definition of the second-order Θ -bonvexity, some notations and lemmas are introduced in Section 2. Section 3 and Section 4 include main results in this paper: we will formulate the second-order Mond–Weir type (2nd-MWD) and Wolfe type (2nd-WD) dual models for problem (P) using the necessary optimality conditions theorem with some suitable constraints, and derive their duality theorems under generalized Θ -bonvexity. In Section 5, we will talk about the further plausible work.

2. Preliminary

In this section, we recall notations, definitions and introduce some lemmas from [15,19]. Given x C p , the notations x ¯ , x T and x H are conjugate, transpose, and transpose conjugate of x . Let M C k × p be a k × p matrix, and the set T = { x C p | Re ( M x ) 0 } be a polyhedral cone. The dual (or polar) cone T * of T is defined by
T * = { μ C p | Re x , μ 0   for   x T } ,
where x , μ = μ H x is the inner product in complex spaces. Remark that T = ( T * ) * if T is a polyhedral cone.
Given x = ( x , x ¯ ) C 2 n and a twice differentiable analytic function Φ : C 2 n C , the gradient expression Φ ( x ) is denoted by
Φ ( x ) = x Φ ( x ) , x ¯ Φ ( x ) C 2 n ,
where x Φ ( x ) = Φ x 1 ( x ) , , Φ x n ( x ) C n , x ¯ Φ ( x ) = Φ x 1 ¯ ( x ) , , Φ x n ¯ ( x ) C n .
The second-order gradient expression 2 Φ ( x ) is denoted by
2 Φ ( x ) = x x Φ ( x ) , x x ¯ Φ ( x ) x ¯ x Φ ( x ) , x ¯ x ¯ Φ ( x ) C 2 n × 2 n ,
with
x x Φ ( x ) = Φ x i x j ( x ) n × n , i , j = 1 , n , x ¯ x Φ ( x ) = Φ x i ¯ x j ( x ) n × n , i , j = 1 , n ,
x x ¯ Φ ( x ) = Φ x i x j ¯ ( x ) n × n , i , j = 1 , n , x ¯ x ¯ Φ ( x ) = Φ x i ¯ x j ¯ ( x ) n × n , i , j = 1 , n .
In order to introduce the optimality conditions and duality models, we need the following lemmas. For the complete proofs, one can refer to the papers: ([15] Lemma 2) and ([19] Lemma 3.1).
Lemma 1.
For y Y C 2 m , x = ( x , x ¯ ) Q C 2 n and nonzero vector μ C p . Suppose that function
Φ ( x ) = f ( x , y ) + h ( x ) , μ
is differentiable at x 0 = ( x 0 , x 0 ¯ ) Q . Then,
Re [ Φ ( x 0 ) ( x x 0 ) ] = Re x x 0 , x f ( x 0 , y ) ¯ + x ¯ f ( x 0 , y ) + μ T x h ( x 0 ) ¯ + μ H x ¯ h ( x 0 ) .
Lemma 2.
Given x = ( x , x ¯ ) , x 0 = ( x 0 , x 0 ¯ ) Q C 2 n , nonzero vector μ C p and let v = ( v , v ¯ ) = x x 0 . Then, the twice differentiable analytic functions f ( x ) and h ( x ) , μ have the second-order gradient representations at x 0 as follows:
(a) 
( x x 0 ) T 2 f ( x 0 ) ( x x 0 ) = v , v H [ x x f ( x 0 ) ¯ ] + v H [ x ¯ x ¯ f ( x 0 ) ] , v + v , v T [ x ¯ x f ( x 0 ) ¯ ] + v T [ x x ¯ f ( x 0 ) ] , v .
The real part of the above identity is equal to
Re v , v H x x f ( x 0 ) ¯ + x ¯ x ¯ f ( x 0 ) + v T x ¯ x f ( x 0 ) ¯ + x x ¯ f ( x 0 ) .
(b) 
( x x 0 ) T 2 h ( x 0 ) , μ ( x x 0 ) = v , v H [ μ T x x h ( x 0 ) ¯ ] + v H [ μ H x ¯ x ¯ h ( x 0 ) ] , v + v , v T [ μ T x ¯ x h ( x 0 ) ¯ ] + v T [ μ H x x ¯ h ( x 0 ) ] , v .
The real part of the above identity is equal to
Re v , v H μ T x x h ( x 0 ) ¯ + μ H x ¯ x ¯ h ( x 0 ) + v T μ T x ¯ x h ( x 0 ) ¯ + μ H x x ¯ h ( x 0 ) .
Let x Q C 2 n be any feasible solution of problem (P). Denote a set
Y ( x ) = y Y | Re f ( x , y ) Re g ( x , y ) = sup ν Y Re f ( x , ν ) Re g ( x , ν ) .
Since f ( x , · ) and g ( x , · ) are continuous on the compact set Y, the set Y ( x ) is also a compact subset of Y, and then the objective function of problem (P) can be expressed by the form:
Ψ ( x ) = sup y Y Re f ( x , y ) Re g ( x , y ) = i = 1 k λ i Re f ( x , y i ) i = 1 k λ i Re g ( x , y i ) ,
where y i Y ( x ) for i = 1 , , k , λ i > 0 , with i = 1 k λ i = 1 , and the problem (P) become
( P ) min x X Ψ ( x ) .
Now, we could recall the necessary optimality conditions theorem of (P) as follows.
Theorem 1
([14] Theorem 3.1). Let x 0 = ( x 0 , x 0 ¯ ) be a (P)-optimal with optimal value γ * . Suppose that the problem (P) satisfies the constraint qualification at x 0 . Then, there exists a positive integer k, scalars λ i 0 with i = 1 k λ i = 1 , vectors y i Y ( x 0 ) for i = 1 , , k and non-zero vector μ T * C p such that
i = 1 k λ i x f ( x 0 , x i ) ¯ + x ¯ f ( x 0 , y i ) γ * x g ( x 0 , y i ) ¯ + x ¯ g ( x 0 , y i ) + μ T x h ( x 0 ) ¯ + μ H x ¯ h ( x 0 ) = 0 ,
Re [ f ( x 0 , y i ) γ * g ( x 0 , y i ) ] = 0 , i = 1 , 2 , , k ,
Re μ , h ( x 0 ) = 0 .
Note that problem (P) is said to have constraint qualification at x 0 , if, for any nonzero μ T * C p , it results μ T x h ( x 0 ) ¯ + μ H x ¯ h ( x 0 ) 0 .
We state the definition of the generalized second-order Θ -bonvexity as follows.
Definition 1
([19] Definition 4.1). The real part of a twice differentiable analytic function Φ ( · ) from C 2 n to R is called, respectively,
(i) 
(strictly) Θ -bonvexat x 0 Q C 2 n if there exists a certain mapping Θ : C 2 n × C 2 n C 2 n such that for any x Q ,
Re Φ ( x ) Φ ( x 0 ) + 1 2 ( x x 0 ) T 2 Φ ( x 0 ) ( x x 0 ) ( > ) Re [ Φ ( x 0 ) + ( x x 0 ) T 2 Φ ( x 0 ) ] Θ ( x , x 0 ) ,
(ii) 
(strictly) Θ -pseudobonvexat x 0 Q C 2 n if there exists a certain mapping Θ : C 2 n × C 2 n C 2 n such that, for any x Q ,
Re [ Φ ( x 0 ) + ( x x 0 ) T 2 Φ ( x 0 ) ] Θ ( x , x 0 ) 0 Re Φ ( x ) Φ ( x 0 ) + 1 2 ( x x 0 ) T 2 Φ ( x 0 ) ( x x 0 ) 0 ( > 0 ) ,
(iii) 
Θ -quasibonvexat x 0 Q if there exists a certain mapping Θ : C 2 n × C 2 n C 2 n such that, for any x Q ,
Re Φ ( x ) Φ ( x 0 ) + 1 2 ( x x 0 ) T 2 Φ ( x 0 ) ( x x 0 ) 0 Re [ Φ ( x 0 ) + ( x x 0 ) T 2 Φ ( x 0 ) ] Θ ( x , x 0 ) 0 .

3. Second-Order Mond–Weir Type Dual Model

We are going to establish two types of second-order parametric free dual model with respect to problem (P). These dual models are called the second-order Mond–Weir type dual model and the second-order Wolfe type dual model. For convenience, we give some symbols as follows. For z C 2 n , y i C 2 m , μ C p , the second-ordered differentiable functions f , g : C 2 n × C 2 m C and h : C 2 n C , we denote notations:
F ( 1 ) ( z , y i ) = x f ( z , y i ) ¯ + x ¯ f ( z , y i ) ; F 1 ( 2 ) ( z , y i ) = x x f ( z , y i ) ¯ + x ¯ x ¯ f ( z , y i ) ; F 2 ( 2 ) ( z , y i ) = x ¯ x f ( z , y i ) ¯ + x x ¯ f ( z , y i ) ; G ( 1 ) ( z , y i ) = x g ( z , y i ) ¯ + x ¯ g ( z , y i ) ; G 1 ( 2 ) ( z , y i ) = x x g ( z , y i ) ¯ + x ¯ x ¯ g ( z , y i ) ; G 2 ( 2 ) ( z , y i ) = x ¯ x g ( z , y i ) ¯ + x x ¯ g ( z , y i ) ; H ( 1 ) ( z , μ ) = μ T x h ( z ) ¯ + μ H x ¯ h ( z ) ; H 1 ( 2 ) ( z , μ ) = μ T x x h ( z ) ¯ + μ H x ¯ x ¯ h ( z ) ; H 2 ( 2 ) ( z , μ ) = μ T x ¯ x h ( z ) ¯ + μ H x x ¯ h ( z ) .
The second-order Mond–Weir type dual problem (2nd-MWD) of problem (P) is a maximize problem as the following form:
( 2 nd MWD ) max ( k , λ ˜ , y ˜ ) K ( z ) max ( z , μ , ν ) X 1 ( k , λ ˜ , y ˜ ) i = 1 k λ i Re f ( z , y i ) i = 1 k λ i Re g ( z , y i ) ,
where the set K ( z ) is the collection of the component ( k , λ ˜ , y ˜ ) (here, λ ˜ = ( λ 1 , , λ k ) , λ i 0 for i = 1 , , k with i = 1 k λ i = 1 and y ˜ = ( y 1 , , y k ) , y i C 2 m for i = 1 , , k ) satisfying the necessary optimality conditions of problem (P) for any given feasible solution z = ( z , z ¯ ) Q with constraint qualification holding, then there exists a nonzero multiplier μ T * C p such that Re s , μ 0 for s T . Thus, Re h ( z ) , μ 0 as h ( z ) T C p . The constraint set X 1 ( k , λ ˜ , y ˜ ) is the collection of all feasible solutions ( z , μ , ν ) C 2 n × C p × C n of (2nd-MWD), which satisfies the following expressions:
for z = ( z , z ¯ ) Q and 0 μ T * , such that
H ( 1 ) ( z , μ ) + ν H H 1 ( 2 ) ( z , μ ) + ν T H 2 ( 2 ) ( z , μ ) + i = 1 k λ i F ( 1 ) ( z , y i ) + ν H F 1 ( 2 ) ( z , y i ) + ν T F 2 ( 2 ) ( z , y i ) · i = 1 k λ i Re g ( z , y i ) i = 1 k λ i Re f ( z , y i ) · i = 1 k λ i G ( 1 ) ( z , y i ) + ν H G 1 ( 2 ) ( z , y i ) + ν T G 2 ( 2 ) ( z , y i ) = 0 ,
i = 1 k λ i Re f ( z , y i ) · i = 1 k λ i Re ν , ν H G 1 ( 2 ) ( z , y i ) + ν T G 2 ( 2 ) ( z , y i ) i = 1 k λ i Re ν , ν H F 1 ( 2 ) ( z , y i ) + ν T F 2 ( 2 ) ( z , y i ) · i = 1 k λ i Re g ( z , y i ) ,
Re h ( z ) , μ 1 2 Re ν , ν H H 1 ( 2 ) ( z , μ ) + ν T H 2 ( 2 ) ( z , μ ) .
Denote a function
Φ 1 ( ) = i = 1 k λ i Re f ( , y i ) · i = 1 k λ i Re g ( z , y i ) i = 1 k λ i Re f ( z , y i ) · i = 1 k λ i Re g ( , y i ) .
The duality theorems of (2nd-MWD) with respect to primary problem (P) are established as follows. First, we will prove that the feasible value of (P) is not less than the feasible value of (2nd-MWD) under some suitable assumptions.
Theorem 2
(Weak Duality). Let x = ( x , x ¯ ) be a (P)-feasible solution, ( k , λ ˜ , y ˜ , z , μ , ν ) be (2nd-MWD)-feasible solution. If any one of the following conditions holds:
(i) 
Φ 1 ( ) is Θ-pseudobonvex and Re h ( ) , μ is Θ-quasibonvex at z Q ,
(ii) 
Φ 1 ( ) is Θ-quasibonvex and Re h ( ) , μ is strictly Θ-pseudobonvex at z Q ,
(iii) 
Φ 1 ( ) and Re h ( ) , μ are both Θ-bonvex at z Q ,
then
sup y Y Re f ( x , y ) Re g ( x , y ) i = 1 k λ i Re f ( z , y i ) i = 1 k λ i Re g ( z , y i ) .
Proof. 
Suppose, on the contrary, that
sup y Y Re f ( x , y ) Re g ( x , y ) < i = 1 k λ i Re f ( z , y i ) i = 1 k λ i Re g ( z , y i ) .
Then, for all y Y ,
[ Re f ( x , y ) ] · i = 1 k λ i Re g ( z , y i ) < [ Re g ( x , y ) ] · i = 1 k λ i Re f ( z , y i ) .
Since λ i 0 with i = 1 k λ 1 = 1 and given y i Y for i = 1 , , k , we obtain
[ i = 1 k λ i Re f ( x , y i ) ] · i = 1 k λ i Re g ( z , y i ) [ i = 1 k λ i Re g ( x , y i ) ] · i = 1 k λ i Re f ( x , y i ) < 0 .
The above inequality is Φ 1 ( x ) < 0 . Since Φ 1 ( z ) = 0 , we have
Φ 1 ( x ) < Φ 1 ( z ) .
For z = ( z , z ¯ ) , x = ( x , x ¯ ) and let x z = ( v , v ¯ ) = ( x z , x z ¯ ) , we know that Equation (6) is
( x z ) T 2 Φ 1 ( z ) ( x z ) 0 .
On the other hand, if x = ( x , x ¯ ) is a feasible solution of problem (P), and since Theorem 1 holds, then there exists a nonzero multiplier μ T * C p such that R e s , μ 0 for s T . Thus, the constraint condition of problem (P) could be expressed as
Re h ( x ) , μ 0 .
If ( k , λ ˜ , y ˜ , z , μ , ν ) is a feasible solution of (2nd-MWD), then Equation (7) holds. That is,
0 Re h ( z ) , μ 1 2 Re ν , ν H H 1 ( 2 ) ( z , μ ) + ν T H 2 ( 2 ) ( z , μ ) .
Therefore,
Re h ( x ) h ( z ) , μ + 1 2 Re ν , ν H H 1 ( 2 ) ( z , μ ) + ν T H 2 ( 2 ) ( z , μ ) 0 .
  • From the hypotheses (i), Φ 1 ( ) is Θ -pseudobonvex at z , and by Equations (8) and (9), there is a mapping Θ : C 2 n × C 2 n C 2 n such that
    Re [ Φ 1 ( z ) + ( x z ) T 2 Φ 1 ( z ) ] Θ ( x , z ) < 0 .
    Since Re h ( ) , μ is Θ -quasibonvex at z and by Equation (10), we have
    Re [ h ( z ) + ( x z ) T 2 h ( z ) ] Θ ( x , z ) 0 .
    By Equations (11) and (12), we obtain
    Re ( Φ 1 ( z ) + h ( z ) ) + ( x z ) T ( 2 Φ 1 ( z ) + 2 h ( z ) ) Θ ( x , z ) < 0 .
    Thus,
    H ( 1 ) ( z , μ ) + ν H H 1 ( 2 ) ( z , μ ) + ν T H 2 ( 2 ) ( z , μ ) + i = 1 k λ i F ( 1 ) ( z , y i ) + ν H F 1 ( 2 ) ( z , y i ) + ν T F 2 ( 2 ) ( z , y i ) · i = 1 k λ i Re g ( z , y i ) i = 1 k λ i Re f ( z , y i ) · i = 1 k λ i G ( 1 ) ( z , y i ) + ν H G 1 ( 2 ) ( z , y i ) + ν T G 2 ( 2 ) ( z , y i ) 0 .
    This contradicts the equality of Equation (5).
  • If hypothesis ( i i ) is true, Φ 1 ( ) is Θ -quasibonvex at z , then Equation (11) becomes less than or equal to zero. Since Re h ( ) , μ is strictly Θ -pseudobonvex at z , then Equation (12) becomes less than zero. Thus, Equation (13) holds, and it still contradicts the equality of Equation (5).
  • Suppose that the hypothesis ( i i i ) is true. By Equations (8) and (9), we have
    Re [ Φ 1 ( x ) Φ 1 ( z ) ] + 1 2 ( x z ) T 2 Φ 1 ( z ) ( x z ) < 0 .
    If Φ 1 ( ) is Θ -bonvex at z Q , and from the above inequality, then there is a mapping Θ : C 2 n × C 2 n C 2 n such that the Equation (11) holds. From Equation (10) and if Re h ( ) , μ is Θ -bonvex at z Q , then we obtain Equation (12). Equation (13) still holds, and it contradicts the equality of Equation (5).
Therefore, the result of the theorem is proved. □
Given an optimal solution of problem (P), we can obtain a feasible solution of the dual problem (2nd-MWD), and the following strong duality theorem will be proved.
Theorem 3
(Strong Duality). Let x 0 = ( x 0 , x 0 ¯ ) be an optimal solution of problem (P). Then, there are ( k , λ ˜ , y ˜ ) K ( x 0 ) and ( x 0 , μ , v ) X ( k , λ ˜ , y ˜ ) such that ( k , λ ˜ , y ˜ , x 0 , μ , v ) is a feasible solution of the dual problem (2nd-MWD). If the hypotheses of a weak duality theorem are fulfilled, then ( k , λ ˜ , y ˜ , x 0 , μ , v ) is an optimal solution of (2nd-MWD), and problems (P) and (2nd-MWD) have the same optimal values.
Proof. 
Let x 0 be an optimal solution of (P) with optimal value
γ * = Ψ ( x 0 ) = i = 1 k λ i Re f ( x 0 , y i ) i = 1 k λ i Re g ( x 0 , y i ) .
From Theorem 1, we could obtain the nonzero μ T * C p , positive integer k with y i Y ( x 0 ) , multipliers λ i 0 for i = 1 , , k and i = 1 k λ i = 1 such that
i = 1 k λ i x f ( x 0 , y i ) ¯ + x ¯ f ( x 0 , y i ) + μ T x h ( x 0 ) ¯ + μ H x ¯ h ( x 0 ) × i = 1 k λ i Re g ( x 0 , y i ) i = 1 k λ i Re f ( x 0 , y i ) × i = 1 k λ i x g ( x 0 , y i ) ¯ + x ¯ g ( x 0 , y i ) = 0 .
If we take ν = x 0 x 0 = 0 and replace μ by μ × i = 1 k λ i Re g ( x 0 , y i ) , then
H ( 1 ) ( x 0 , μ ) + ν H H 1 ( 2 ) ( x 0 , μ ) + ν T H 2 ( 2 ) ( x 0 , μ ) + i = 1 k λ i F ( 1 ) ( x 0 , y i ) + ν H F 1 ( 2 ) ( x 0 , y i ) + ν T F 2 ( 2 ) ( x 0 , y i ) · i = 1 k λ i Re g ( x 0 , y i ) i = 1 k λ i Re f ( x 0 , y i ) · i = 1 k λ i G ( 1 ) ( x 0 , y i ) + ν H G 1 ( 2 ) ( x 0 , y i ) + ν T G 2 ( 2 ) ( x 0 , y i ) = 0 ,
and the component ( x 0 , μ , ν = 0 ) X 1 ( k , λ ˜ , y ˜ ) is satisfying conditions Equations (5)–(7) of problem (2nd-MWD). It follows that ( k , λ ˜ , y ˜ , x 0 , μ , ν = 0 ) is a feasible solution of (2nd-MWD). If the hypotheses of Theorem 2 are fulfilled, then ( k , λ ˜ , y ˜ , x 0 , μ , ν = 0 ) is an optimal solution of (2nd-MWD), and the two problems (P) and (2nd-MWD) have the same optimal values. □
If both optimal solutions of primary problem (P) and dual problem (2nd-MWD) exist, then the optimal values of (P) and (2nd-MWD) are equal under some assumptions. We could prove this result as the following theorem.
Theorem 4.
(Strictly Converse Duality) Let x and ( k , λ ˜ , y ˜ , z , μ , v ) be optimal solutions of (P) and (2nd-MWD), and assume that the assumptions of strong duality theorem are fulfilled. In addition, if Φ 1 ( ) is strictly Θ-pseudobonvex and Re h ( ) , μ is Θ-quasibonvex at z Q , then x = z ; and the optimal values of (P) and (2nd-MWD) are equal.
Proof. 
Assume that x z , and reach a contradiction.
By strong duality theorem (Theorem 3),
sup y Y Re f ( x , y ) Re g ( x , y ) = i = 1 k λ i Re f ( z , y i ) i = 1 k λ i Re g ( z , y i ) .
Then, for all y Y ,
[ Re f ( x , y ) ] · i = 1 k λ i Re g ( z , y i ) [ Re g ( x , y ) ] · i = 1 k λ i Re f ( z , y i ) .
Since λ i 0 with i = 1 k λ 1 = 1 and given y i Y for i = 1 , , k , we have that
[ i = 1 k λ i Re f ( x , y i ) ] · i = 1 k λ i Re g ( z , y i ) [ i = 1 k λ i Re g ( x , y i ) ] · i = 1 k λ i Re f ( z , y i ) 0 .
That is,
Φ 1 ( x ) Φ 1 ( z ) 0 .
If Φ 1 ( ) is strictly Θ -pseudobonvex at z , then, by using a similar process of the proof as in Theorem 2, we get Equation (11). Since Re h ( ) , μ is Θ -quasibonvex at z , we obtain Equation (12). By Equations (11) and (12), Equation (13) still holds. It contradicts the equality of Equation (5). This is the complete proof. □

4. Second-Order Wolfe Type Dual Model

The second-order Wolfe type dual problem with respect to problem (P) is the following form:
( 2 nd WD ) max ( k , λ ˜ , y ˜ ) K ( z ) max ( z , μ , v ) X 2 ( k , λ ˜ , y ˜ ) i = 1 k λ i Re [ f ( z , y i ) + h ( z ) , μ ] i = 1 k λ i Re g ( z , y i ) ,
where the set K ( z ) is the collection of the component ( k , λ ˜ , y ˜ ) (here λ ˜ = ( λ 1 , , λ k ) , λ i 0 for i = 1 , , k with i = 1 k and y ˜ = ( y 1 , , y k ) , y i C 2 m for i = 1 , , k ) satisfying the necessary optimality conditions of problem (P) for any given feasible solution z = ( z , z ¯ ) Q with constraint qualification hold, then there exists a nonzero multiplier μ T * C p such that R e s , μ 0 for s T . Thus, Re h ( z ) , μ 0 as h ( z ) T C p . The constraint set X 2 ( k , λ ˜ , y ˜ ) satisfies the following conditions:
for z = ( z , z ¯ ) Q and 0 μ T * , such that
{ i = 1 k λ i ( F ( 1 ) ( z , y i ) + H ( 1 ) ( z , μ ) + ν H F 1 ( 2 ) ( z , y i ) + H 1 ( 2 ) ( z , μ ) + ν T F 2 ( 2 ) ( z , y i ) + H 2 ( 2 ) ( z , μ ) ) } × i = 1 k λ i Re g ( z , y i ) i = 1 k λ i Re [ f ( z , y i ) + h ( z ) , μ ] × i = 1 k λ i G ( 1 ) ( z , y i ) + ν H G 1 ( 2 ) ( z , y i ) + ν T G 2 ( 2 ) ( z , y i ) = 0 ,
i = 1 k λ i R e [ f ( z , y i ) + h ( z ) , μ ] × i = 1 k λ i Re ν , ν H G 1 ( 2 ) ( z , y i ) + ν T G 2 ( 2 ) ( z , y i ) i = 1 k λ i Re ν , ν H F 1 ( 2 ) ( z , y i ) + H 1 ( 2 ) ( z , μ ) + ν T F 2 ( 2 ) ( z , y i ) + H 2 ( 2 ) ( z , μ ) × i = 1 k λ i Re g ( z , y i ) .
Denote function Φ 2 ( ) by
Φ 2 ( ) = i = 1 k λ i Re [ f ( , y i ) + h ( ) , μ ] × i = 1 k λ i Re g ( z , y i ) i = 1 k λ i Re [ f ( z , y i ) + h ( z ) , μ ] × i = 1 k λ i Re g ( , y i ) .
We could state and prove the duality theorems of (2nd-WD) under the second-order generalized Θ -bonvexities as follows.
Theorem 5
(Weak Duality). Let x = ( x , x ¯ ) be (P)-feasible solution, ( k , λ ˜ , y ˜ , z , μ , ν ) be (2nd-WD)-feasible solution, and if Φ 2 ( ) is Θ-pseudobonvex at z Q . Then,
max y Y Re f ( x , y ) Re g ( x , y ) i = 1 k λ i Re [ f ( z , y i ) + h ( z ) , μ ] i = 1 k λ i Re g ( z , y i ) .
Proof. 
Suppose, on the contrary, that
max y Y Re f ( x , y ) Re g ( x , y ) < i = 1 k λ i Re [ f ( z , y i ) + h ( z ) , μ ] i = 1 k λ i Re g ( z , y i ) .
Then, for all y Y ,
[ Re f ( x , y ) ] · i = 1 k λ i Re g ( z , y i ) < [ Re g ( x , y ) ] · i = 1 k λ i Re [ f ( z , y i ) + h ( z ) , μ ] .
Since λ i 0 with i = 1 k λ 1 = 1 and given y i Y for i = 1 , , k , we have that
[ i = 1 k λ i Re f ( x , y i ) ] · i = 1 k λ i Re g ( z , y i ) [ i = 1 k λ i Re g ( x , y i ) ] · i = 1 k λ i Re [ f ( z , y i ) + h ( z ) , μ ] < 0 .
Let x = ( x , x ¯ ) be the feasible solution of (P) that is
Re h ( x ) , μ 0 .
By the above two inequalities, we get
i = 1 k λ i Re [ f ( x , y i ) + h ( x ) , μ ] · i = 1 k λ i Re g ( z , y i ) [ i = 1 k λ i Re g ( x , y i ) ] · i = 1 k λ i Re [ f ( z , y i ) + h ( z ) , μ ] < 0 .
This implies that
Φ 2 ( x ) < 0 = Φ 2 ( z ) .
For z = ( z , z ¯ ) , x = ( x , x ¯ ) and let x z = ( v , v ¯ ) = ( x z , x z ¯ ) . From Lemma 2,
Re ( x z ) T 2 Φ 2 ( z ) ( x z ) = { i = 1 k λ i Re ν , ν H F 1 ( 2 ) ( z , y i ) + H 1 ( 2 ) ( z , μ ) + ν T F 2 ( 2 ) ( z , y i ) + H 2 ( 2 ) ( z , μ ) } × i = 1 k λ i Re g ( z , y i ) i = 1 k λ i R e [ f ( z , y i ) + h ( z ) , μ ] × i = 1 k λ i Re ν , ν H G 1 ( 2 ) ( z , y i ) + ν T G 2 ( 2 ) ( z , y i ) .
From condition Equations (15) and (16) and the above inequality, we know that
Re Φ 2 ( x ) Φ 2 ( z ) + 1 2 ( x z ) T 2 Φ 2 ( z ) ( x z ) < 0 .
If Φ 2 ( ) is Θ -pseudobonvex at z , then there is a mapping Θ : C 2 n × C 2 n C 2 n such that
Re [ Φ 2 ( z ) + ( x z ) T 2 Φ 2 ( z ) ] Θ ( x , z ) < 0 .
Thus,
{ i = 1 k λ i ( F ( 1 ) ( z , y i ) + H ( 1 ) ( z , μ ) + ν H F 1 ( 2 ) ( z , y i ) + H 1 ( 2 ) ( z , μ ) + ν T F 2 ( 2 ) ( z , y i ) + H 2 ( 2 ) ( z , μ ) ) } × i = 1 k λ i Re g ( z , y i ) i = 1 k λ i R e [ f ( z , y i ) + h ( z ) , μ ] × i = 1 k λ i G ( 1 ) ( z , y i ) + ν H G 1 ( 2 ) ( z , y i ) + ν T G 2 ( 2 ) ( z , y i ) 0 .
This contradicts the condition of Equation (14) in dual problem (2nd-WD). This is the complete proof. □
Theorem 6
(Strong Duality). Let x 0 = ( x 0 , x 0 ¯ ) be an optimal solution of problem (P). Then, there are ( k , λ ˜ , y ˜ ) K ( x 0 ) and ( x 0 , μ , v ) X ( k , λ ˜ , y ˜ ) such that ( k , λ ˜ , y ˜ , x 0 , μ , v ) is a feasible solution of the dual problem (2nd-WD). If the hypotheses of weak duality theorem are fulfilled, then ( k , λ ˜ , y ˜ , x 0 , μ , v ) is an optimal solution of (2nd-WD), and problems (P) and (2nd-WD) have the same optimal values.
Proof. 
It follows by the same way as the proof of strong duality theorem in (2nd-MWD). □
Theorem 7
(Strictly Converse Duality). Let x and ( k , λ ˜ , y ˜ , z , μ , v ) be optimal solutions of (P) and (2nd-WD), and assume that the assumptions of a strong duality theorem are fulfilled. In addition, if Φ 2 ( ) is strictly Θ-pseudobonvex at z Q , then x = z , and the optimal values of (P) and (2nd-WD) are equal.
Proof. 
Assume that x z and reach a contradiction.
By strong duality theorem (Theorem 6),
sup y Y Re f ( x , y ) Re g ( x , y ) = i = 1 k λ i Re [ f ( z , y i ) + h ( z ) , μ ] i = 1 k λ i Re g ( z , y i ) .
Then, for all y Y ,
[ Re f ( x , y ) ] · i = 1 k λ i Re g ( z , y i ) [ Re g ( x , y ) ] · i = 1 k λ i Re [ f ( z , y i ) + h ( z ) , μ ] .
Since λ i 0 with i = 1 k λ 1 = 1 and given y i Y for i = 1 , , k , we have that
[ i = 1 k λ i Re f ( x , y i ) ] · i = 1 k λ i Re g ( z , y i ) [ i = 1 k λ i Re g ( x , y ) ] · i = 1 k λ i Re [ f ( z , y i ) + h ( z ) , μ ] 0 .
By a similar process as the proof in Theorem 5, we can obtain
Φ 2 ( x ) Φ 2 ( z ) 0
and
R e Φ 2 ( x ) Φ 2 ( z ) + 1 2 ( x z ) T 2 Φ 2 ( z ) ( x z ) 0 .
If Φ 2 ( ) is strictly Θ -pseudobonvex at z , then we obtain Equation (17); this contradicts the condition of Equation (14) in dual problem (2nd-WD). Therefore, the result of the theorem is proved. □

5. Conclusions and Further Plausible Work

In this paper, we formulated the second-order Mond–Weir type and Wolfe type dual models with respect to problem (P), and derived their duality theorems. In further plausible work, we will establish the second-order mixed type dual problem (2nd-MD) of problem (P), and then we would like to show that the dual problems (2nd-MWD) and (2nd-WD) are the special cases of dual problem (2nd-MD).

Funding

This research was supported by MOST 108-2115-M-035-005-, Taiwan.

Acknowledgments

The authors express their sincere gratitude to the unknown reviewers for their detailed reading and valuable advice.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Fan, K. Minimax theorems. Proc. Natl. Acad. Sci. USA 1953, 39, 42–47. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  2. Schmittendorf, W.E. Necessary conditions and sufficient conditions for static minmax problems. J. Math. Anal. Appl. 1977, 57, 683–693. [Google Scholar] [CrossRef] [Green Version]
  3. Ahmad, I.; Husain, Z.; Sharma, S. Second order duality in nondifferentiable minimax programming involving type-I functions. J. Comput. Appl. Math. 2008, 215, 91–102. [Google Scholar] [CrossRef] [Green Version]
  4. Bector, C.R.; Chandra, S.; Husain, I. Second-order duality for a minimax programming problem. Opsearch 1991, 28, 249–263. [Google Scholar]
  5. Husain, Z.; Ahmad, I.; Sharma, S. Second order duality for minimax fractional programming. Optim. Lett. 2009, 3, 277–286. [Google Scholar] [CrossRef]
  6. Husain, Z.; Jayswal, A.; Ahmad, I. Second-order duality for nondifferentiable minimax programming problems with generalized convexity. J. Glob. Optim. 2009, 44, 593–608. [Google Scholar] [CrossRef]
  7. Tanimoto, S. Duality for a class of nondifferentiable mathematical programming problems. J. Math. Anal. Appl. 1981, 79, 286–294. [Google Scholar] [CrossRef] [Green Version]
  8. Mititelu, Ş.; Treanţǎ, S. Efficiency conditions in vector control problems governed by multiple integrals. J. Appl. Math. Comput. 2018, 57, 647–665. [Google Scholar] [CrossRef]
  9. Treanţǎ, S.; Mititelu, Ş. Duality with (ρ,b)-quasiinvexity for multidimensional vector fractional control problems. J. Inform. Optim. Sci. 2019, 40, 1429–1445. [Google Scholar] [CrossRef]
  10. Cipu, E.C. Duality results in quasiinvex variational control problems with curvilinear integral functionals. Mathematics 2019, 7, 811. [Google Scholar] [CrossRef] [Green Version]
  11. Treanţǎ, S. Multiobjective fractional variational problem on higher-order jet bundles. Commun. Math. Stat. 2016, 4, 323–340. [Google Scholar] [CrossRef]
  12. Datta, N.; Bhatia, D. Duality for a class of nondifferentiable mathematical programming problems in complex space. J. Math. Anal. Appl. 1984, 101, 1–11. [Google Scholar] [CrossRef] [Green Version]
  13. Ferrero, O. On nonlinear programming in complex space. J. Math. Anal. Appl. 1992, 164, 399–416. [Google Scholar] [CrossRef] [Green Version]
  14. Lai, H.C.; Liu, J.C.; Schaible, S. Complex minimax fractional programming of analytic functions. J. Optim. Theory Appl. 2008, 137, 171–184. [Google Scholar] [CrossRef]
  15. Lai, H.C.; Huang, T.Y. Optimality conditions for a nondifferentiable minimax programming in complex spaces. Nonlinear Anal. 2009, 71, 1205–1212. [Google Scholar] [CrossRef]
  16. Lai, H.C.; Huang, T.Y. Optimality conditions for nondifferentiable minimax fractional programming with complex variables. J. Math. Anal. Appl. 2009, 359, 229–239. [Google Scholar] [CrossRef] [Green Version]
  17. Lai, H.C.; Huang, T.Y. Nondifferentiable minimax fractional programming in complex spaces with parametric duality. J. Glob. Optim. 2012, 53, 243–254. [Google Scholar] [CrossRef]
  18. Lai, H.C.; Huang, T.Y. Mixed type duality for a nondifferentiable minimax fractional complex programming. Pac. J. Optim. 2014, 10, 305–319. [Google Scholar]
  19. Huang, T.Y. Second-order duality for a non-differentiable minimax programming in complex spaces. Int. J. Compu. Math. 2017, 94, 2508–2519. [Google Scholar] [CrossRef]
  20. Huang, T.Y.; Lai, H.C. Second-order parametric duality for a minimax fractional programming in complex spaces. J. Nonlinear Convex Anal. 2017, 18, 1685–1697. [Google Scholar]

Share and Cite

MDPI and ACS Style

Huang, T.-Y. Second-Order Parametric Free Dualities for Complex Minimax Fractional Programming. Mathematics 2020, 8, 67. https://doi.org/10.3390/math8010067

AMA Style

Huang T-Y. Second-Order Parametric Free Dualities for Complex Minimax Fractional Programming. Mathematics. 2020; 8(1):67. https://doi.org/10.3390/math8010067

Chicago/Turabian Style

Huang, Tone-Yau. 2020. "Second-Order Parametric Free Dualities for Complex Minimax Fractional Programming" Mathematics 8, no. 1: 67. https://doi.org/10.3390/math8010067

APA Style

Huang, T. -Y. (2020). Second-Order Parametric Free Dualities for Complex Minimax Fractional Programming. Mathematics, 8(1), 67. https://doi.org/10.3390/math8010067

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