Next Article in Journal
Amended Criteria for Testing the Asymptotic and Oscillatory Behavior of Solutions of Higher-Order Functional Differential Equations
Next Article in Special Issue
The Asymptotic Behavior for Generalized Jiřina Process
Previous Article in Journal
TOPSIS Method Based on Hamacher Choquet-Integral Aggregation Operators for Atanassov-Intuitionistic Fuzzy Sets and Their Applications in Decision-Making
Previous Article in Special Issue
Optimality Conditions and Dualities for Robust Efficient Solutions of Uncertain Set-Valued Optimization with Set-Order Relations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Second-Ordered Parametric Duality for the Multi-Objective Programming Problem in Complex Space

Department of Applied Mathematics, Feng Chia University, Taichung 407102, Taiwan
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Axioms 2022, 11(12), 717; https://doi.org/10.3390/axioms11120717
Submission received: 31 October 2022 / Revised: 6 December 2022 / Accepted: 9 December 2022 / Published: 11 December 2022
(This article belongs to the Special Issue Special Issue in Honor of the 60th Birthday of Professor Hong-Kun Xu)

Abstract

:
We introduced and discussed a second-ordered parametric dual model of a complex multi-objective programming problem (P). Moreover, the authors constructed and proved the weak, strong and strictly converse duality theorems by the second-ordered generalized Θ -bonvexity.

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.
( P 0 ) min f ( z , z ¯ ) such   that X = { ( z , z ¯ ) Q | g ( z , z ¯ ) S } ,
where S is a polyhedral cone in C m , f : C 2 n C and g : C 2 n C m are analytic in z = ( z , z ¯ ) Q , and the set Q = { ( z , z ¯ ) | z C n } C 2 n 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].
( P ) min f ( z ) = ( f 1 ( z ) , , f p ( z ) ) such   that z = ( z , z ¯ ) X = z Q | g ( z ) S ,
where S C q is a polyhedral cone, and f : C 2 n C p , g : C 2 n C q are analytic in z = ( z , z ¯ ) Q = { ( z , z ¯ ) | z C n } C 2 n .
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 z C p , the notations z ¯ , z T and z H are the conjugate, transpose and conjugate transpose of z. Let T = { z C p | Re ( K z ) 0 } C p be a polyhedral cone with matrix K C k × p where k is a positive integer. The dual cone T * of the convex cone T is defined by
T * = { η C p | Re z , η 0 for   all z T } ,
where z , η = η H z is defined to be the inner product of z and η in complex spaces. For z 0 T , the set T ( z 0 ) is the intersection of those closed half spaces that includes z 0 in their boundaries. Thus, if z 0 int ( T ) , T ( z 0 ) is the whole space C p .
Let T C p be a pointed, closed convex cone. For any y , y 0 C p , the ordered relation notation “ T ” with respect to cone T is defined as:
y 0 T y y y 0 T .
Note that for a nonzero vector μ T * ,
y 0 T y Re [ μ H ( y y 0 ) ] 0 .
Definition 1 
(Duca [8], Definition 3.3.1 (Optimal efficient solution)). Let X be a nonempty subset of Q = { z = ( z , z ¯ ) C 2 n | z C n } C 2 n , T C p be a pointed and closed convex cone, and f : X C p be a map from X to C p .
(1) 
The point z 0 = ( z 0 , z 0 ¯ ) X is a minimal efficient (or Pareto-minimal) solution of f with respect to T if there exists no other feasible point z = ( z , z ¯ ) X such that f ( z 0 ) f ( z ) T \ { 0 } .
(2) 
The point z 0 = ( z 0 , z 0 ¯ ) X is a maximal efficient (or Pareto-maximal) solution of f with respect to T if there exists no other feasible point z = ( z , z ¯ ) X such that f ( z ) f ( z 0 ) T \ { 0 } .
Note that z 0 X is a minimal efficient solution of f with respect to T if f ( X ) f ( z 0 ) ( T ) = { 0 } ; analogously, z 0 X is a maximal efficient solution of f with respect to T if f ( z 0 ) f ( X ) ( T ) = { 0 } . 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 z = ( z , z ¯ ) C 2 n and a twice differentiable analytic function f : C 2 n C , the gradient expression f ( z ) is denoted by
f ( z ) = z f ( z ) , z ¯ f ( z ) C p × 2 n
with z f ( z ) = z 1 f 1 ( z ) z n f 1 ( z ) z 1 f p ( z ) z n f p ( z ) , z ¯ f ( z ) = z 1 ¯ f 1 ( z ) z n ¯ f 1 ( z ) z 1 ¯ f p ( z ) z n ¯ f p ( z ) C p × n . The second-order gradient expression 2 f k ( z ) , k = 1 , p is denoted by
2 f k ( z ) = z z f k ( z ) , z z ¯ f k ( z ) z ¯ z f k ( z ) , z ¯ z ¯ f k ( z ) C 2 n × 2 n
with
z z f k ( z ) = 2 z i z j f k ( z ) n × n , i , j = 1 , n , z ¯ z f k ( z ) = 2 z i ¯ z j f k ( z ) n × n , i , j = 1 , n , z z ¯ f k ( z ) = 2 z i z j ¯ f k ( z ) n × n , i , j = 1 , n , z ¯ z ¯ f k ( z ) = 2 z i ¯ z j ¯ f k ( z ) n × n , i , j = 1 , n .
We express the differential form of a complex function by using the gradient representations as the following lemma.
Lemma 1. 
Given z = ( z , z ¯ ) , z 0 = ( z 0 , z 0 ¯ ) C 2 n and ( v , v ¯ ) = ( z z 0 , z z 0 ¯ ) . Suppose that f ( · ) : C 2 n C p , τ = ( τ 1 , , τ p ) C p and Φ ( z ) = f ( z ) , τ = τ H f ( z ) . Then
(a) 
-ok
Re [ Φ ( z 0 ) ( z z 0 ) ] = Re z z 0 , τ T z f ( z 0 ) ¯ + τ H z ¯ f ( z 0 ) .
(b) 
( z z 0 ) T 2 Φ ( z 0 ) ( z z 0 ) = v , v H [ τ T z z f ( z 0 ) ¯ ] + v H [ τ H z ¯ z ¯ f ( z 0 ) ] , v s . + v , v T [ τ T z ¯ z f ( z 0 ) ¯ ] + v T [ τ H z z ¯ f ( z 0 ) ] , v s . .
The real part of Equation (b) is equal to
Re v , v H τ T z z f ( z 0 ) ¯ + τ H z ¯ z ¯ f ( z 0 ) + v T τ T z ¯ z f ( z 0 ) ¯ + τ H z z ¯ f ( z 0 ) .
Proof. 
(a)
Since x , y = y H x is the inner product in complex space,
Φ ( z 0 ) ( z z 0 ) = f ( z 0 ) ( z z 0 ) , τ = z f ( z 0 ) , z ¯ f ( z 0 ) v v ¯ , τ = z f ( z 0 ) v + z f ( z 0 ) v ¯ , τ = τ H z f ( z 0 ) v + τ H z ¯ f ( z 0 ) v ¯ = j = 1 p i = 1 n τ j ¯ z i f j ( z 0 ) v i + j = 1 p i = 1 n τ j ¯ z i ¯ f j ( z 0 ) v i ¯ = j = 1 p i = 1 n τ j · z i f j ( z 0 ) ¯ ¯ · v i + j = 1 p i = 1 n v i ¯ · τ j ¯ · z i ¯ f j ( z 0 ) = v , τ T z f ( z 0 ) ¯ + τ H z ¯ f ( z 0 ) , v .
We obtain
Φ ( z 0 ) ( z z 0 ) = z z 0 , τ T z f ( z 0 ) ¯ + τ H z ¯ f ( z 0 ) , z z 0 .
Moreover, since Re [ x , y ] = Re [ y , x ¯ ] = Re [ y , x ] , we have
Re [ Φ ( z 0 ) ( z z 0 ) ] = Re z z 0 , τ T z f ( z 0 ) ¯ + τ H z ¯ f ( z 0 ) , z z 0 = Re z z 0 , τ T z f ( z 0 ) ¯ + Re z z 0 , τ H z ¯ f ( z 0 ) ¯ = Re z z 0 , τ T z f ( z 0 ) ¯ + Re z z 0 , τ H z ¯ f ( z 0 ) = Re z z 0 , τ T z f ( z 0 ) ¯ + τ H z ¯ f ( z 0 ) .
(b)
Let Φ ( z ) = f ( z ) , τ = k = 1 p τ k ¯ f k ( z 0 ) = τ 1 ¯ f 1 ( z 0 ) + + τ p ¯ f p ( z 0 ) , where f k ( z 0 ) is the mapping from C 2 n to C 1 for k = 1 , , p . Then
( z z 0 ) T 2 f ( z 0 ) , τ ( z z 0 ) = ( z z 0 ) T τ 1 ¯ 2 f 1 ( z 0 ) ( z z 0 ) + + ( z z 0 ) T τ p ¯ 2 f p ( z 0 ) ( z z 0 ) .
For j = 1 , , p , and z z 0 = ( z z 0 , z z 0 ¯ ) = ( v , v ¯ ) ,
( z z 0 ) T τ j ¯ 2 f j ( z 0 ) ( z z 0 ) = v , v ¯ τ j ¯ z z f j ( z 0 ) , τ j ¯ z z ¯ f j ( z 0 ) τ j ¯ z ¯ z f j ( z 0 ) , τ j ¯ z ¯ z ¯ f j ( z 0 ) v v ¯
= l = 1 n k = 1 n v k τ j ¯ 2 f j ( z 0 ) z k z l v l + l = 1 n k = 1 n v k ¯ τ j ¯ 2 f j ( z 0 ) z k ¯ z l v l + l = 1 n k = 1 n v k τ j ¯ 2 f j ( z 0 ) z k z l ¯ v l ¯ + l = 1 n k = 1 n v k ¯ τ j ¯ 2 f j ( z 0 ) z k ¯ z l ¯ v l ¯ = l = 1 n k = 1 n v k ¯ τ j 2 f j ( z 0 ) z k z l ¯ ¯ v l + l = 1 n k = 1 n v k τ j 2 f j ( z 0 ) z k ¯ z l ¯ ¯ v l + l = 1 n v l ¯ k = 1 n v k τ j ¯ 2 f j ( z 0 ) z k z l ¯ + l = 1 n v l ¯ k = 1 n v k ¯ τ j ¯ 2 f j ( z 0 ) z k ¯ z l ¯ = v , v H [ τ j z z f j ( z 0 ) ¯ ] + v T [ τ j ¯ z z ¯ f j ( z 0 ) ] , v s . + v , v T [ τ j z ¯ z f j ( z 0 ) ¯ ] + v H [ τ j ¯ z ¯ z ¯ f j ( z 0 ) ] , v s . .
By formula above, Equation (1) implies that
( z z 0 ) T 2 f ( z 0 ) , τ ( z z 0 ) = v , v H [ τ T z z f ( z 0 ) ¯ ] + v T [ τ H z z ¯ f ( z 0 ) ] , v s . + v , v T [ τ T z ¯ z f ( z 0 ) ¯ ] + v H [ τ H z ¯ z ¯ f ( z 0 ) ] , v s . ,
and the real part of the above identity is equal to
Re v , v H τ T z z f ( z 0 ) ¯ + τ H z ¯ z ¯ f ( z 0 ) + v T τ T z ¯ z f ( z 0 ) ¯ + τ H z z ¯ f ( z 0 ) .

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 τ C p , we consider the scalarized programming problem with respect to problem (P) as follows.
( P τ ) min Re [ τ H f ( z ) ] such   that X = { ζ = ( z , z ¯ ) Q | g ( z ) S } .
Lemma 2 
(Elbrolosy [15], Theorem 4.4). Let T C p be a pointed, closed and convex cone and f ( X ) be a convex set. If point z 0 is a minimal efficient solution of (P) with respect to T, then there exists a nonzero vector τ T * such that z 0 is an optimal solution of (Pτ).
Lemma 3 
(Elbrolosy [15], Theorem 4.6). Let T C p be a pointed, closed and convex cone, and τ T * with τ 0 . Assume that z 0 is an optimal solution of (Pτ), and anyone of the following conditions holds,
(1) 
nonzero vector τ int ( T * ) ,
(2) 
point z 0 is the unique optimal solution of (PPτ).
Then z 0 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
  • at a point z 0 = ( z 0 , z 0 ¯ ) , if for any nonzero μ S * C q ,
g z ( z 0 ) ( z z 0 ) , μ 0 , f o r   z z 0 .
Under the gradient expression as in Lemma 1, the constraint qualification can be expressed by
μ T z g ( z 0 ) ¯ + μ H z ¯ g ( z 0 ) 0 , for   μ 0   in   S * ,
where μ H = μ T ¯ .
Theorem 1 
(Elbrolosy [15], Theorem 4.9 (Necessary optimality conditions)). Let T C p be a pointed, closed and convex cone, S be a polyhedral cone in C q and f ( X ) be a convex set. Suppose that the mappings f ( · ) : C 2 n C p and g ( · ) : C 2 n C q are analytic on X Q , and z 0 is a minimal efficient solution of (P) with respect to T. If problem (P) possesses the constraint qualification at z 0 , there are nonzero vectors τ T * C p and μ S * C q satisfying the following conditions:
τ T z f ( z 0 ) ¯ + τ H z ¯ f ( z 0 ) + μ T z g ( z 0 ) ¯ + μ H z ¯ g ( z 0 ) = 0 ,
Re μ H g ( z 0 ) = 0 .
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 f ( · ) is said to be:
(i) 
convex (strictly) at z 0 Q C 2 n if for all z Q ,
   Re f ( z ) f ( z 0 ) ( > ) Re f ( z 0 ) ( z z 0 ) ,
(ii) 
pseudoconvex (strictly) at z 0 Q if for all z Q ,
   Re f ( z 0 ) ( z z 0 ) 0 Re f ( z ) f ( z 0 ) 0 ( > 0 ) ,
(iii) 
quasiconvex at z 0 Q if for all z Q ,
   Re f ( z ) f ( z 0 ) 0 Re f ( z 0 ) ( z z 0 ) 0 .
Huang and Tanaka [16] established the sufficient optimality conditions below.
Theorem 2 
([16], Theorem 3.6 (Sufficient optimality conditions)). Let T C p be a pointed, closed and convex cone, S be a polyhedral cone in C q , and f ( · ) : C 2 n C p and g ( · ) : C 2 n C q be two analytic mappings on X Q , where Q C 2 n . Suppose that z 0 is a feasible solution of (P), and there are nonzero vectors τ T * C p and μ S * C q satisfying conditions (2) and (3) in Theorem 1. If any one of the following conditions (i)–(iii) holds:
(i) 
Either of Re [ τ H f ( · ) ] or Re [ μ H g ( · ) ] is strictly convex and the other is convex at z 0 Q , or both are strictly convex at z 0 Q ,
(ii) 
Re [ τ H f ( · ) ] is quasiconvex at z 0 Q and Re [ μ H g ( · ) ] is strictly pseudoconvex at z 0 Q ,
(iii) 
Re [ τ H f ( · ) + μ H g ( · ) ] is strictly pseudoconvex at z 0 Q ,
then z 0 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 u = ( u , u ¯ ) C 2 n , τ C p , μ C q , and f : C 2 n C p , g : C 2 n C q are analytic mappings:
F ( 1 ) ( u , τ ) = τ T z f ( u ) ¯ + τ H z ¯ f ( u ) ; F 1 ( 2 ) ( u , τ ) = τ T z z f ( u ) ¯ + τ H z ¯ z ¯ f ( u ) ; F 2 ( 2 ) ( u , τ ) = τ T z ¯ z f ( u ) ¯ + τ H z z ¯ f ( u ) . G ( 1 ) ( u , μ ) = μ T z g ( u ) ¯ + μ H z ¯ g ( u ) ; G 1 ( 2 ) ( u , μ ) = μ T z z g ( u ) ¯ + μ H z ¯ z ¯ g ( u ) ; G 2 ( 2 ) ( u , μ ) = μ T z ¯ z g ( u ) ¯ + μ H z z ¯ g ( u ) .
The second-order parametric dual problem of problem (P) is considered as the following form.
( D ) max F D γ = ( γ 1 , , γ p ) ,
where F D is the set of all feasible solutions ( τ , u , μ , ν , γ ) satisfied the following conditions: For u = ( u , u ¯ ) Q , τ C p , ν C n and μ S * ,
F ( 1 ) ( u , τ ) + G ( 1 ) ( u , μ ) + ν H F 1 ( 2 ) ( u , τ ) + G 1 ( 2 ) ( u , μ ) + ν T F 2 ( 2 ) ( u , τ ) + G 2 ( 2 ) ( u , μ ) = 0 ,
Re f ( u ) γ , τ 1 2 Re ν , ν H F 1 ( 2 ) ( u , τ ) + ν T F 2 ( 2 ) ( u , τ ) ,
Re g ( u ) , μ 1 2 Re ν , ν H G 1 ( 2 ) ( u , μ ) + ν T G 2 ( 2 ) ( u , μ ) .
We introduce the second-ordered generalized Θ -bonvexity as follows.
Definition 4 
(Huang [10], Definition 4.1). The real part of an analytic function f ( · ) is called,
(i) 
Θ -bonvex (strictly)at z 0 Q C 2 n if there exists a suitable mapping Θ : C 2 n × C 2 n C 2 n such that for any z Q ,
Re f ( z ) f ( z 0 ) + 1 2 ( z z 0 ) T 2 f ( z 0 ) ( z z 0 ) ( > ) Re [ f ( z 0 ) + ( z z 0 ) T 2 f ( z 0 ) ] Θ ( z , z 0 ) ,
(ii) 
Θ -pseudobonvex (strictly)at z 0 Q C 2 n if there exists a suitable mapping Θ : C 2 n × C 2 n C 2 n such that for any z Q ,
Re [ f ( z 0 ) + ( z z 0 ) T 2 f ( z 0 ) ] Θ ( z , z 0 ) 0 Re f ( z ) f ( z 0 ) + 1 2 ( z z 0 ) T 2 f ( z 0 ) ( z z 0 ) 0 ( > 0 ) ,
(iii) 
Θ -quasibonvexat z 0 Q if there exists a suitable mapping Θ : C 2 n × C 2 n C 2 n such that for any z Q ,
Re f ( z ) f ( z 0 ) + 1 2 ( z z 0 ) T 2 f ( z 0 ) ( z z 0 ) 0 Re [ f ( z 0 ) + ( z z 0 ) T 2 f ( z 0 ) ] Θ ( z , z 0 ) 0 .
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 z = ( z , z ¯ ) be (P)-feasible solution, and ( τ , u , μ , ν , γ ) be (D)-feasible solution. Suppose that any one of the conditions holds:
(i) 
Either one of Re [ τ H f ( · ) ] or Re [ μ H g ( · ) ] is strictly Θ-bonvex and the other is Θ-bonvex at u Q , or both are strictly Θ-bonvex at u Q ,
(ii) 
Re [ τ H f ( · ) ] is Θ-quasibonvex at u Q and Re [ μ H g ( · ) ] is strictly Θ-pseudobonvex at u Q ,
(iii) 
Re [ τ H f ( · ) + μ H g ( · ) ] is strictly Θ-pseudoconvex at u Q .
Then
f ( z ) T γ .
Proof. 
Suppose on the contrary that
γ f ( z ) T \ { 0 } .
We could pick a nonzero vector τ T * , such that Re γ f ( z ) , τ 0 , or
Re f ( z ) γ , τ 0 .
By inequality (5), then
Re f ( z ) γ , τ 0 Re f ( u ) γ , τ 1 2 Re ν , ν H F 1 ( 2 ) ( u , τ ) + ν T F 2 ( 2 ) ( u , τ ) .
That is
Re f ( z ) f ( u ) , τ + 1 2 Re ν , ν H F 1 ( 2 ) ( u , τ ) + ν T F 2 ( 2 ) ( u , τ ) 0 .
Since the feasibility of z for problem (P) and the inequality (6),
Re g ( z ) , μ 0 Re g ( u ) , μ 1 2 Re ν , ν H G 1 ( 2 ) ( u , μ ) + ν T G 2 ( 2 ) ( u , μ ) .
We get the following inequality
Re g ( z ) g ( u ) , μ + 1 2 Re ν , ν H G 1 ( 2 ) ( u , μ ) + ν T G 2 ( 2 ) ( u , μ ) 0 .
(a)
If hypothesis (i) holds, without loss of generality, assume that Re [ τ H f ( · ) ] is strictly Θ -bonvex and Re [ μ H g ( · ) ] is Θ -bonvex at u Q , and let ( ν , ν ¯ ) = z u .
From inequality (8) and Re [ τ H f ( · ) ] is strictly Θ -bonvex at u Q , then there is a mapping Θ : C 2 n × C 2 n C 2 n such that
Re [ τ H f ( u ) + ( ν , ν ¯ ) T 2 τ H f ( u ) ] Θ ( z , u ) < 0 .
From inequality (9) and Re [ μ H g ( · ) ] is Θ -bonvex at u Q , then there is a mapping Θ : C 2 n × C 2 n C 2 n such that
Re [ μ H g ( u ) + ( ν , ν ¯ ) T 2 μ H g ( u ) ] Θ ( z , u ) 0 .
Combine inequalities (10) and (11), then
Re [ τ H f ( u ) μ H g ( u ) ] + ( ν , ν ¯ ) T 2 [ τ H f ( u ) + μ H g ( u ) ] Θ ( z , u ) < 0 .
This implies that
F ( 1 ) ( u , τ ) + G ( 1 ) ( u , μ ) + ν H F 1 ( 2 ) ( u , τ ) + G 1 ( 2 ) ( u , μ ) + ν T F 2 ( 2 ) ( u , τ ) + G 2 ( 2 ) ( u , μ ) 0 ,
this contradicts the equality (4).
(b)
If hypothesis (ii) holds, Re [ τ H f ( · ) ] is Θ -quasibonvex at u and according to inequality (8), then there is a mapping Θ : C 2 n × C 2 n C 2 n such that
Re [ τ H f ( u ) + ( ν , ν ¯ ) T 2 τ H f ( u ) ] Θ ( z , u ) 0 .
By inequality (9) and Re [ μ H g ( · ) ] is strictly Θ -pesudobonvex at u Q , then there is a mapping Θ : C 2 n × C 2 n C 2 n such that
Re { [ μ H g ( u ) + ( ν , ν ¯ ) T 2 μ H g ( u ) ] Θ ( z , u ) } < 0 .
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 Re [ τ H f ( · ) + μ H g ( · ) ] is strictly Θ -pseudoconvex at u Q , then we get the same inequality (12), which contradicts the equality (4).
Therefore, the result of theorem is proved.
Theorem 4 
(Strong Duality). Let T C p is a pointed, closed and convex cone. Suppose that z 0 is a minimal efficient solution of (P) with respect to T, and the problem (P) satisfies the constraint qualification at z 0 . Then there exists ( τ , z 0 , μ , ν , γ ) a feasible solution of the dual problem (D). Moreover, if the hypotheses of Theorem 3 are fulfilled, then ( τ , z 0 , μ , ν , γ ) 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 z 0 = ( z 0 , z 0 ¯ ) Q is a minimal efficient solution of problem (P) with optimal value γ , and take ν = z 0 z 0 = 0 . By using Theorem 1 (Necessary optimality conditions), there exist τ T * C p and μ S * C q such that
τ T z f ( z 0 ) ¯ + τ H z ¯ f ( z 0 ) + μ T z g ( z 0 ) ¯ + μ H z ¯ g ( z 0 ) = 0 , Re [ μ H g ( z 0 ) ] = 0 ,
then conditions (4) and (6) of dual problem (D) are hold. Because γ is the optimal value of problem (P), that is γ = min f ( z ) = f ( z 0 ) . It implies that Re f ( z 0 ) γ , τ = 0 , the condition (5) of problem (D) holds. Hence, ( τ , z 0 , μ , ν = 0 , γ ) is a feasible solution of the dual problem (D). From Theorem 3, the optimality of the feasible solution ( τ , z 0 , μ , ν , γ ) for (D) reduces to be the optimal value of (D). Indeed, if there exists a feasible solution ( τ , z , μ , ν , γ ) of (D) such that γ γ T \ { 0 } . Since γ = f ( z 0 ) is the optimal value of problem (P), we obtain
γ f ( z 0 ) T \ { 0 } ,
which contradicts to Theorem 3. □
Theorem 5 
(Strictly Converse Duality). Let T C p is a pointed, closed and convex cone. Suppose that z ^ and ( τ , u ^ , μ , ν , γ ) 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 Re [ τ H f ( · ) ] is strictly Θ-pseudobonvex at u ^ Q and Re [ μ H g ( · ) ] is Θ-quasibonvex at u ^ Q , then z ^ = u ^ , and the problems of (P) and (D) with the same optimal values.
Proof. 
We assume that z ^ u ^ . Since z ^ is an optimal efficient solution of (P) with optimal value γ , and from Theorem 4, then
γ = min f ( z ^ ) = f 1 ( z ^ ) , , f p ( z ^ ) .
So, we get Re f ( z ^ ) γ , τ = 0 for nonzero τ T * . By condition (5) and the above inequality,
Re f ( z ^ ) γ , τ = 0 Re f ( u ^ ) γ , τ 1 2 Re ν , ν H F 1 ( 2 ) ( u ^ , τ ) + ν T F 2 ( 2 ) ( u ^ , τ ) .
That is,
Re f ( z ^ ) f ( u ^ ) , τ + 1 2 Re ν , ν H F 1 ( 2 ) ( u ^ , τ ) + ν T F 2 ( 2 ) ( u ^ , τ ) 0 .
Using the feasibility of z ^ of (P) with μ S * , and inequality (6),
Re [ μ H g ( z ^ ) ] 0 Re [ μ H g ( u ^ ) ] 1 2 Re ν , ν H G 1 ( 2 ) ( u , μ ) + ν T G 2 ( 2 ) ( u , μ ) .
Then
Re [ μ H g ( z ^ ) μ H g ( u ^ ) ] + 1 2 Re ν , ν H G 1 ( 2 ) ( u , μ ) + ν T G 2 ( 2 ) ( u , μ ) 0 .
If Re [ τ H f ( · ) ] is strictly Θ -pseudobonvex at u ^ Q and by inequality (13), there is a mapping Θ : C 2 n × C 2 n C such that
Re [ τ H f ( u ) + ( ν , ν ¯ ) T 2 τ H f ( u ) ] Θ ( z , u ) < 0 .
If Re [ μ H g ( · ) ] is Θ -quasibonvex at u ^ Q and by inequality (14), there is a mapping Θ : C 2 n × C 2 n C such that
Re [ μ H g ( u ) + ( ν , ν ¯ ) T 2 μ H g ( u ) ] Θ ( z , u ) 0 .
By considering inequalities (15) and (16), we could obtain the following inequality:
F ( 1 ) ( u ^ , τ ) + G ( 1 ) ( u ^ , μ ) + ν H F 1 ( 2 ) ( u ^ , τ ) + G 1 ( 2 ) ( u ^ , μ ) + ν T F 2 ( 2 ) ( u ^ , τ ) + G 2 ( 2 ) ( u ^ , μ ) 0 ,
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

  1. Levinson, N. Linear programming in complex space. J. Math. Anal. Appl. 1966, 14, 44–62. [Google Scholar] [CrossRef] [Green Version]
  2. Abrams, R.A.; Ben-Israel, A. Nonlinear programming in complex space: Necessary conditions. SIAM J. Control. 1971, 9, 606–620. [Google Scholar] [CrossRef]
  3. 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]
  4. Mond, B.; Craven, B.D. A class of nondifferentiable complex programming problems. J. Math. Oper. Stat. 1975, 6, 581–591. [Google Scholar]
  5. Duca, D.I. On vectorial programming problem in complex space. Stud. Univ. Babes-Bolya Math. 1979, 24, 51–56. [Google Scholar]
  6. Duca, D.I. Proper Efficiency in the Complex Vectorial Programing. Stud. Univ. Babes-Bolyai Math. 1980, 25, 73–80. [Google Scholar]
  7. Duca, D.I. Efficiency Criteria in Vectorial Programming in Complex Space without Convexity. Cah. Cent. Etudes Rech. Oper. 1984, 26, 217–226. [Google Scholar]
  8. Duca, D.I. Multicriteria Optimization in Complex Spaces; Casa du Cartii de Stiinta: Cluj-Napoca, Romania, 2005. [Google Scholar]
  9. 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]
  10. 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]
  11. Huang, T.Y. Second-order parametric free dualities for complex minimax fractional programming. Mathematics 2020, 8, 67. [Google Scholar] [CrossRef] [Green Version]
  12. 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]
  13. 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]
  14. 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]
  15. Elbrolosy, M.E. Efficiency for a generalized form of vector optimization problems in complex space. Optimization 2016, 65, 1245–1257. [Google Scholar] [CrossRef]
  16. 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.

Share and Cite

MDPI and ACS Style

Hsu, C.-Y.; Huang, T.-Y. Second-Ordered Parametric Duality for the Multi-Objective Programming Problem in Complex Space. Axioms 2022, 11, 717. https://doi.org/10.3390/axioms11120717

AMA Style

Hsu C-Y, Huang T-Y. Second-Ordered Parametric Duality for the Multi-Objective Programming Problem in Complex Space. Axioms. 2022; 11(12):717. https://doi.org/10.3390/axioms11120717

Chicago/Turabian Style

Hsu, Chia-Yu, and Tone-Yau Huang. 2022. "Second-Ordered Parametric Duality for the Multi-Objective Programming Problem in Complex Space" Axioms 11, no. 12: 717. https://doi.org/10.3390/axioms11120717

APA Style

Hsu, C. -Y., & Huang, T. -Y. (2022). Second-Ordered Parametric Duality for the Multi-Objective Programming Problem in Complex Space. Axioms, 11(12), 717. https://doi.org/10.3390/axioms11120717

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