1. Introduction
The complex optimization problem has been applied in many fields in electrical engineering, such as minimal entropy or maximum kurtosis. Levinson published their study on complex linear programming in 1966 [
1]. Since then, case studies on complex nonlinear, fractional, and duality programming problems have been discussed [
2,
3,
4]. Duca formulated the vectorial optimization problem in complex space and obtained the necessary and sufficient conditions [
5,
6,
7,
8]. Datta and Bhatia started their study on a complex minimax problem in 1984 [
9]. Lai and Huang constructed various cases of complex minimax optimal problems. Following that, Huang et. al. constructed several types of second-order duality models for complex fractional and nonfractional minimax programming problems, and also derived the duality theorems under second-order generalized
-bonvexity [
10,
11,
12].
All of the above, the complex optimal problems were focused on the real parts of complex objective functions. Youness and Elbrolosy considered the general case with both real and imaginary parts [
13,
14]. The complex extended programming problem is formulated as follows.
where
S is a polyhedral cone in
,
and
are analytic in
and the set
is a linear manifold over real field. Elbrolosy extended the complex multi-objective vector optimization problem (P), and also defined the concept of optimal efficient solutions and established the optimality conditions of the problem (P) by using the scalarization techniques as follows [
15].
where
is a polyhedral cone, and
,
are analytic in
.
Recently, Huang and Tanaka established the sufficient optimality conditions of problem (P), formulated the parametric dual problem and proved their duality theorems under the generalized convexities [
16]. Usually, the objective function in the complex programming problem was focused on the real part only. The novelty of this paper is extended the case of objective function from the real part to the case of both real and imaginary parts. Moreover, we would formulate the second-ordered parametric dual problem (D) with respect to the problem (P) and prove their duality theorems under the second-ordered generalized
-bonvexity.
2. Notations and Preliminary
Given
, the notations
,
and
are the conjugate, transpose and conjugate transpose of
z. Let
be a polyhedral cone with matrix
where
k is a positive integer. The dual cone
of the convex cone
T is defined by
where
is defined to be the inner product of
z and
in complex spaces. For
the set
is the intersection of those closed half spaces that includes
in their boundaries. Thus, if
,
is the whole space
.
Let
be a pointed, closed convex cone. For any
, the ordered relation notation “
” with respect to cone
T is defined as:
Note that for a nonzero vector
,
Definition 1 (Duca [
8], Definition 3.3.1 (Optimal efficient solution)).
Let X be a nonempty subset of , be a pointed and closed convex cone, and be a map from X to .- (1)
The point is a minimal efficient (or Pareto-minimal) solution of f with respect to T if there exists no other feasible point such that .
- (2)
The point is a maximal efficient (or Pareto-maximal) solution of f with respect to T if there exists no other feasible point such that .
Note that is a minimal efficient solution of f with respect to T if ; analogously, is a maximal efficient solution of f with respect to T if . The minimal efficient solution or maximal efficient solution of f with respect to T in a multi-objective programming problem is called the optimal efficient solution of f with respect to T.
In order to establish the optimality conditions and duality properties, we re-called the gradient expression and second-order gradient expression of the complex functions. Given
and a twice differentiable analytic function
, the gradient expression
is denoted by
with
The second-order gradient expression
,
is denoted by
with
We express the differential form of a complex function by using the gradient representations as the following lemma.
Lemma 1. Given and . Suppose that , and . Then
- (a)
- (b)
The real part of Equation (b) is equal to
Proof. - (a)
Since
is the inner product in complex space,
Moreover, since
, we have
- (b)
Let
where
is the mapping from
to
for
. Then
For , and ,
By formula above, Equation (
1) implies that
and the real part of the above identity is equal to
□
3. Optimality Conditions
We would like to find the minimum efficient solutions to the complex multi-objective programming problem (P). The scalarization technique is going to be applied to the multi-objective programming problem. We would obtain the existence of minimum efficient solutions of problem (P) above by scalarized programming problem (P
τ) below, and the lemmas followed will be stated [
15,
16].
Given a nonzero vector
, we consider the scalarized programming problem with respect to problem (P) as follows.
Lemma 2 (Elbrolosy [
15], Theorem 4.4).
Let be a pointed, closed and convex cone and be a convex set. If point is a minimal efficient solution of (P) with respect to T, then there exists a nonzero vector such that is an optimal solution of (Pτ). Lemma 3 (Elbrolosy [
15], Theorem 4.6).
Let be a pointed, closed and convex cone, and with . Assume that is an optimal solution of (Pτ), and anyone of the following conditions holds,- (1)
nonzero vector ,
- (2)
point is the unique optimal solution of (PPτ).
Then is the minimal efficient solution of (P) with respect to T.
Elbrolosy [
15] established the Kuhn-Tucker necessary optimality conditions of problem (P) by using the scalarization techniques, we described as follows.
Definition 2 (Lai and Huang [
12], Definition 3).
The problem (P) is said to satisfy the constraint qualification Under the gradient expression as in Lemma 1, the constraint qualification can be expressed by
where
Theorem 1 (Elbrolosy [
15], Theorem 4.9 (Necessary optimality conditions)).
Let be a pointed, closed and convex cone, S be a polyhedral cone in and be a convex set. Suppose that the mappings and are analytic on , and is a minimal efficient solution of (P) with respect to T. If problem (P) possesses the constraint qualification at , there are nonzero vectors and satisfying the following conditions: In order to formulate the sufficient optimality conditions and duality theorems, we introduce the generalized convexity in complex spaces as follows.
Definition 3 (Lai and Huang [
12], Definition 1).
The real part of an analytic function is said to be:- (i)
convex (strictly) at if for all ,
- (ii)
pseudoconvex (strictly) at if for all ,
- (iii)
quasiconvex at if for all ,
Huang and Tanaka [
16] established the sufficient optimality conditions below.
Theorem 2 ([
16], Theorem 3.6 (Sufficient optimality conditions)).
Let be a pointed, closed and convex cone, S be a polyhedral cone in , and and be two analytic mappings on , where . Suppose that is a feasible solution of (P), and there are nonzero vectors and satisfying conditions (2) and (3) in Theorem 1. If any one of the following conditions (i)–(iii) holds:- (i)
Either of or is strictly convex and the other is convex at , or both are strictly convex at ,
- (ii)
is quasiconvex at and is strictly pseudoconvex at ,
- (iii)
is strictly pseudoconvex at ,
then is the minimal efficient solution of (P) with respect to T.
4. The Second-Order Parametric Duality Model
We would like to use the following differential notations to simplify the expression. Let
,
,
, and
,
are analytic mappings:
The second-order parametric dual problem of problem (P) is considered as the following form.
where
is the set of all feasible solutions
satisfied the following conditions: For
,
,
and
,
We introduce the second-ordered generalized -bonvexity as follows.
Definition 4 (Huang [
10], Definition 4.1).
The real part of an analytic function is called,- (i)
-bonvex (strictly)at if there exists a suitable mapping such that for any ,
- (ii)
-pseudobonvex (strictly)at if there exists a suitable mapping such that for any ,
- (iii)
-quasibonvexat if there exists a suitable mapping such that for any ,
Using the generalized -bonvexities, we could obtain the weak, strong and strictly converse duality theorem of dual problem (D) with respect to primary problem (P).
Theorem 3 (Weak Duality). Let be (P)-feasible solution, and be (D)-feasible solution. Suppose that any one of the conditions holds:
- (i)
Either one of or is strictly Θ-bonvex and the other is Θ-bonvex at , or both are strictly Θ-bonvex at ,
- (ii)
is Θ-quasibonvex at and is strictly Θ-pseudobonvex at ,
- (iii)
is strictly Θ-pseudoconvex at .
Proof. Suppose on the contrary that
We could pick a nonzero vector
, such that
, or
Since the feasibility of
for problem (P) and the inequality (
6),
We get the following inequality
- (a)
If hypothesis (i) holds, without loss of generality, assume that is strictly -bonvex and is -bonvex at , and let .
From inequality (
8) and
is strictly
-bonvex at
, then there is a mapping
such that
From inequality (
9) and
is
-bonvex at
, then there is a mapping
such that
Combine inequalities (
10) and (
11), then
This implies that
this contradicts the equality (
4).
- (b)
If hypothesis (ii) holds,
is
-quasibonvex at
and according to inequality (
8), then there is a mapping
such that
By inequality (
9) and
is strictly
-pesudobonvex at
, then there is a mapping
such that
We obtain inequality (
12) by summing up the two inequalities above, and then this contradicts the equality of (
4).
- (c)
Combine inequalities (
8) and (
9), and since
is strictly
-pseudoconvex at
, then we get the same inequality (
12), which contradicts the equality (
4).
Therefore, the result of theorem is proved.
□
Theorem 4 (Strong Duality). Let is a pointed, closed and convex cone. Suppose that is a minimal efficient solution of (P) with respect to T, and the problem (P) satisfies the constraint qualification at . Then there exists a feasible solution of the dual problem (D). Moreover, if the hypotheses of Theorem 3 are fulfilled, then is also an optimal solution of (D) with respect to T, and the two problems (P) and (D) have the same optimal values.
Proof. Let
is a minimal efficient solution of problem (P) with optimal value
, and take
. By using Theorem 1 (Necessary optimality conditions), there exist
and
such that
then conditions (
4) and (
6) of dual problem (D) are hold. Because
is the optimal value of problem (P), that is
It implies that
, the condition (
5) of problem (D) holds. Hence,
is a feasible solution of the dual problem (D). From Theorem 3, the optimality of the feasible solution
for (D) reduces to be the optimal value of (D). Indeed, if there exists a feasible solution
of (D) such that
. Since
is the optimal value of problem (P), we obtain
which contradicts to Theorem 3. □
Theorem 5 (Strictly Converse Duality). Let is a pointed, closed and convex cone. Suppose that and are optimal efficient solutions of (P) and (D) with respect to T, respectively, and assume that the assumptions of Theorem 4 are fulfilled. Meanwhile, if is strictly Θ-pseudobonvex at and is Θ-quasibonvex at , then , and the problems of (P) and (D) with the same optimal values.
Proof. We assume that
. Since
is an optimal efficient solution of (P) with optimal value
, and from Theorem 4, then
So, we get
. By condition (
5) and the above inequality,
Using the feasibility of
of (P) with
, and inequality (
6),
If
is strictly
-pseudobonvex at
and by inequality (
13), there is a mapping
such that
If
is
-quasibonvex at
and by inequality (
14), there is a mapping
such that
By considering inequalities (
15) and (
16), we could obtain the following inequality:
which contradicts the equality (
4). This completed the proof. □
5. Conclusions
In this paper, we state the necessary and sufficient optimality conditions of (P), establish the second-ordered parameter dual model (D) with respect to problem (P), and discuss their duality theorems.
Author Contributions
Writing original draft, C.-Y.H. and T.-Y.H. Both authors contributed equally to the manuscript. All authors have read and agreed to the published version of the manuscript.
Funding
This paper is partially supported by Grant No. MOST 111-2115-M-035-002 of the Ministry of Science and Technology of the Republic of China.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Acknowledgments
The authors wish to express their hearty thanks to the anonymous referees for their valuable suggestions and comments.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Levinson, N. Linear programming in complex space. J. Math. Anal. Appl. 1966, 14, 44–62. [Google Scholar] [CrossRef] [Green Version]
- Abrams, R.A.; Ben-Israel, A. Nonlinear programming in complex space: Necessary conditions. SIAM J. Control. 1971, 9, 606–620. [Google Scholar] [CrossRef]
- Abrams, R.A. Nonlinear Programming in complex space: Sufficient conditions and duality. J. Math. Anal. Appl. 1972, 38, 619–632. [Google Scholar] [CrossRef] [Green Version]
- Mond, B.; Craven, B.D. A class of nondifferentiable complex programming problems. J. Math. Oper. Stat. 1975, 6, 581–591. [Google Scholar]
- Duca, D.I. On vectorial programming problem in complex space. Stud. Univ. Babes-Bolya Math. 1979, 24, 51–56. [Google Scholar]
- Duca, D.I. Proper Efficiency in the Complex Vectorial Programing. Stud. Univ. Babes-Bolyai Math. 1980, 25, 73–80. [Google Scholar]
- Duca, D.I. Efficiency Criteria in Vectorial Programming in Complex Space without Convexity. Cah. Cent. Etudes Rech. Oper. 1984, 26, 217–226. [Google Scholar]
- Duca, D.I. Multicriteria Optimization in Complex Spaces; Casa du Cartii de Stiinta: Cluj-Napoca, Romania, 2005. [Google Scholar]
- 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]
- Huang, T.Y. Second-order duality for a non-differentiable minimax programming in complex spaces. Int. J. Comput. Math. 2017, 94, 2508–2519. [Google Scholar] [CrossRef]
- Huang, T.Y. Second-order parametric free dualities for complex minimax fractional programming. Mathematics 2020, 8, 67. [Google Scholar] [CrossRef] [Green Version]
- 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]
- Youness, E.A.; Elbrolosy, M.E. Extension to necessary optimality conditions in complex programming. J. Appl. Math. Comput. 2004, 154, 229–237. [Google Scholar] [CrossRef]
- Youness, E.A.; Elbrolosy, M.E. Extension to sufficient optimality conditions in complex programming. J. Math. Stat. 2005, 1, 40–48. [Google Scholar] [CrossRef] [Green Version]
- Elbrolosy, M.E. Efficiency for a generalized form of vector optimization problems in complex space. Optimization 2016, 65, 1245–1257. [Google Scholar] [CrossRef]
- Huang, T.Y.; Tanaka, T. Optimality and duality for complex multi-objective programming. Numer. Anal. Control Optim. 2022, 12, 121–134. [Google Scholar] [CrossRef]
| Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. 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 (https://creativecommons.org/licenses/by/4.0/).