Second-Order Parametric Free Dualities for Complex Minimax Fractional Programming

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.


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. 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: 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: where Y is a compact subset in C 2m , T is a polyhedral cone in C p , functions f (·, y) and h(·) are analytic on Q = {x = (x,x)|x ∈ C n } ⊂ C 2n . 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 2n (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: where Y is a specified compact subset in C 2m , T is a polyhedral cone in C p ; for x = (x,x) ∈ C 2n , y = (y, y) ∈ C 2m , 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 2n , 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. Sections 3 and 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.

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(Mx) ≥ 0} be a polyhedral cone. The dual (or polar) cone T * of T is defined by 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 2n and a twice differentiable analytic function Φ : C 2n → C, the gradient expression ∇Φ(x) is denoted by The second-order gradient expression ∇ 2 Φ(x) is denoted by 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).
Then, the twice differentiable analytic functions f (x) and h(x), µ have the second-order gradient representations at x 0 as follows: The real part of the above identity is equal to The real part of the above identity is equal to 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: Now, we could recall the necessary optimality conditions theorem of (P) as follows.
. 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 Note that problem (P) is said to have constraint qualification at x 0 , if, for any nonzero 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
such that, for any x ∈ Q,

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 2n , y i ∈ C 2m , µ ∈ C p , the second-ordered differentiable functions f , g : C 2n × C 2m → C and h : C 2n → C, we denote notations: The second-order Mond-Weir type dual problem (2nd-MWD) of problem (P) is a maximize problem as the following form: . . , 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 2n × C p × C n of (2nd-MWD), which satisfies the following expressions: for z = (z, z) ∈ Q and 0 = µ ∈ T * , such that Denote a function 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: Proof. Suppose, on the contrary, that Then, for all y ∈ Y, Since λ i ≥ 0 with ∑ k i=1 λ 1 = 1 and given y i ∈ Y for i = 1, · · · , k, we obtain For z = (z, z), x = (x, x) and let , we know that Equation (6) is 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 Re s, µ ≥ 0 for s ∈ T. Thus, the constraint condition of problem (P) could be expressed as λ, y, z, µ, ν) is a feasible solution of (2nd-MWD), then Equation (7) holds. That is, Therefore, 1. From the hypotheses (i), Φ 1 (•) is Θ-pseudobonvex at z, and by Equations (8) and (9), there is a mapping Θ : C 2n × C 2n → C 2n such that Since Re h(•), µ is Θ-quasibonvex at z and by Equation (10), we have By Equations (11) and (12) , we obtain Thus, This contradicts the equality of Equation (5). (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). 3. Suppose that the hypothesis (iii) is true. By Equations (8) and (9), we have
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.
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. 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), Then, for all y ∈ Y, Since λ i ≥ 0 with ∑ k i=1 λ 1 = 1 and given y i ∈ Y for i = 1, · · · , k, we have that That is, 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.

Second-Order Wolfe Type Dual Model
The second-order Wolfe type dual problem with respect to problem (P) is the following form: where the set K(z) is the collection of the component (k, λ, y) (here λ = (λ 1 , . . . , λ k ), λ i ≥ 0 for i = 1, . . . , k with ∑ k i=1 and y = (y 1 , . . . , y k ), y i ∈ C 2m 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 Re 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 Denote function Φ 2 (•) by We could state and prove the duality theorems of (2nd-WD) under the second-order generalized Θ-bonvexities as follows.
By the above two inequalities, we get This implies that For z = (z, z), x = (x, x) and let 2 (z, y i ) . (15) and (16) and the above inequality, we know that

From condition Equations
Thus, This contradicts the condition of Equation (14) in dual problem (2nd-WD). This is the complete proof.
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) Then, for all y ∈ Y, Since λ i ≥ 0 with ∑ k i=1 λ 1 = 1 and given y i ∈ Y for i = 1, . . . , k, we have that By a similar process as the proof in Theorem 5, we can obtain 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.

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).