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 are the compact Hausdorff spaces, and if the real-valued functional satisfies some suitable conditions, then
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 , functions and are 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 -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 , T is a polyhedral cone in , functions and are analytic on . Remark that a nonlinear analytic function does not have a convex real part. As a consequence, we consider the complex functions defined on a linear manifold of the set (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 , T is a polyhedral cone in ; for , , functions and are continuous functions; for each , and are analytic on the , and, without loss of generality, we could assume that and .
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 , the notations , and are conjugate, transpose, and transpose conjugate of . Let be a matrix, and the set be a polyhedral cone. The dual (or polar) cone of T is defined by
where is the inner product in complex spaces. Remark that if T is a polyhedral cone.
Given and a twice differentiable analytic function , the gradient expression is denoted by
where , .
The second-order gradient expression is denoted by
with
, , , ,
, , , .
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 , and nonzero vector . Suppose that function
is differentiable at . Then,
Lemma 2.
Given , nonzero vector and let . Then, the twice differentiable analytic functions and have the second-order gradient representations at as follows:
- (a)
- The real part of the above identity is equal to
- (b)
- The real part of the above identity is equal to
Let be any feasible solution of problem (P). Denote a set
Since and are continuous on the compact set Y, the set is also a compact subset of Y, and then the objective function of problem (P) can be expressed by the form:
where for , , with , and the problem (P) become
Now, we could recall the necessary optimality conditions theorem of (P) as follows.
Theorem 1
([14] Theorem 3.1). Let be a (P)-optimal with optimal value . Suppose that the problem (P) satisfies the constraint qualification at . Then, there exists a positive integer k, scalars with , vectors for and non-zero vector such that
Note that problem (P) is said to have constraint qualification at , if, for any nonzero , it results .
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 to is called, respectively,
- (i)
- (strictly) -bonvexat if there exists a certain mapping such that for any ,
- (ii)
- (strictly) -pseudobonvexat if there exists a certain mapping such that, for any ,
- (iii)
- -quasibonvexat if there exists a certain mapping such that, for any ,
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 , , , the second-ordered differentiable functions and , we denote notations:
The second-order Mond–Weir type dual problem (2nd-MWD) of problem (P) is a maximize problem as the following form:
where the set is the collection of the component (here, , for with and , for ) satisfying the necessary optimality conditions of problem (P) for any given feasible solution with constraint qualification holding, then there exists a nonzero multiplier such that for . Thus, as . The constraint set is the collection of all feasible solutions of (2nd-MWD), which satisfies the following expressions:
for and , 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 be a (P)-feasible solution, be (2nd-MWD)-feasible solution. If any one of the following conditions holds:
- (i)
- is Θ-pseudobonvex and is Θ-quasibonvex at ,
- (ii)
- is Θ-quasibonvex and is strictly Θ-pseudobonvex at ,
- (iii)
- and are both Θ-bonvex at ,
then
Proof.
Suppose, on the contrary, that
Then, for all ,
Since with and given for , we obtain
The above inequality is . Since , we have
For and let , we know that Equation (6) is
On the other hand, if is a feasible solution of problem (P), and since Theorem 1 holds, then there exists a nonzero multiplier such that for . Thus, the constraint condition of problem (P) could be expressed as
If is a feasible solution of (2nd-MWD), then Equation (7) holds. That is,
Therefore,
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 be an optimal solution of problem (P). Then, there are and such that is a feasible solution of the dual problem (2nd-MWD). If the hypotheses of a weak duality theorem are fulfilled, then is an optimal solution of (2nd-MWD), and problems (P) and (2nd-MWD) have the same optimal values.
Proof.
Let be an optimal solution of (P) with optimal value
From Theorem 1, we could obtain the nonzero , positive integer k with , multipliers for and such that
If we take and replace by , then
and the component is satisfying conditions Equations (5)–(7) of problem (2nd-MWD). It follows that is a feasible solution of (2nd-MWD). If the hypotheses of Theorem 2 are fulfilled, then 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 and be optimal solutions of (P) and (2nd-MWD), and assume that the assumptions of strong duality theorem are fulfilled. In addition, if is strictly Θ-pseudobonvex and is Θ-quasibonvex at , then and the optimal values of (P) and (2nd-MWD) are equal.
Proof.
Assume that , and reach a contradiction.
By strong duality theorem (Theorem 3),
Then, for all ,
Since with and given for , we have that
That is,
If is strictly -pseudobonvex at , then, by using a similar process of the proof as in Theorem 2, we get Equation (11). Since is -quasibonvex at , 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:
where the set is the collection of the component (here , for with and , for ) satisfying the necessary optimality conditions of problem (P) for any given feasible solution with constraint qualification hold, then there exists a nonzero multiplier such that for . Thus, as . The constraint set satisfies the following conditions:
for and , such that
Denote function by
We could state and prove the duality theorems of (2nd-WD) under the second-order generalized -bonvexities as follows.
Theorem 5
(Weak Duality). Let be (P)-feasible solution, be (2nd-WD)-feasible solution, and if is Θ-pseudobonvex at . Then,
Proof.
Suppose, on the contrary, that
Then, for all ,
Since with and given for , we have that
Let be the feasible solution of (P) that is
By the above two inequalities, we get
This implies that
For and let . From Lemma 2,
If is -pseudobonvex at , then there is a mapping such that
Thus,
This contradicts the condition of Equation (14) in dual problem (2nd-WD). This is the complete proof. □
Theorem 6
(Strong Duality). Let be an optimal solution of problem (P). Then, there are and such that is a feasible solution of the dual problem (2nd-WD). If the hypotheses of weak duality theorem are fulfilled, then 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 and be optimal solutions of (P) and (2nd-WD), and assume that the assumptions of a strong duality theorem are fulfilled. In addition, if is strictly Θ-pseudobonvex at , then , and the optimal values of (P) and (2nd-WD) are equal.
Proof.
Assume that and reach a contradiction.
By strong duality theorem (Theorem 6),
Then, for all ,
Since with and given for , we have that
By a similar process as the proof in Theorem 5, we can obtain
and
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
- Fan, K. Minimax theorems. Proc. Natl. Acad. Sci. USA 1953, 39, 42–47. [Google Scholar] [CrossRef] [PubMed]
- 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]
- 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]
- Bector, C.R.; Chandra, S.; Husain, I. Second-order duality for a minimax programming problem. Opsearch 1991, 28, 249–263. [Google Scholar]
- Husain, Z.; Ahmad, I.; Sharma, S. Second order duality for minimax fractional programming. Optim. Lett. 2009, 3, 277–286. [Google Scholar] [CrossRef]
- 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]
- Tanimoto, S. Duality for a class of nondifferentiable mathematical programming problems. J. Math. Anal. Appl. 1981, 79, 286–294. [Google Scholar] [CrossRef][Green Version]
- Mititelu, Ş.; Treanţǎ, S. Efficiency conditions in vector control problems governed by multiple integrals. J. Appl. Math. Comput. 2018, 57, 647–665. [Google Scholar] [CrossRef]
- Treanţǎ, S.; Mititelu, Ş. Duality with (ρ,b)-quasiinvexity for multidimensional vector fractional control problems. J. Inform. Optim. Sci. 2019, 40, 1429–1445. [Google Scholar] [CrossRef]
- Cipu, E.C. Duality results in quasiinvex variational control problems with curvilinear integral functionals. Mathematics 2019, 7, 811. [Google Scholar] [CrossRef]
- Treanţǎ, S. Multiobjective fractional variational problem on higher-order jet bundles. Commun. Math. Stat. 2016, 4, 323–340. [Google Scholar] [CrossRef]
- 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]
- Ferrero, O. On nonlinear programming in complex space. J. Math. Anal. Appl. 1992, 164, 399–416. [Google Scholar] [CrossRef][Green Version]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
© 2020 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).