The aim of this paper is to investigate the optimality conditions for a class of nonsmooth multiobjective fractional optimization problems subject to vanishing constraints. In particular, necessary and sufficient conditions for (weak) Pareto solution are presented in terms of the Clark subdifferential. Furthermore, we construct Wolfe and Mond–Weir-type dual models and derive some duality theorems by using generalized quasiconvexity assumptions. Some examples to show the validity of our conclusions are provided.
Citation: Haijun Wang, Gege Kang, Ruifang Zhang. On optimality conditions and duality for multiobjective fractional optimization problem with vanishing constraints[J]. Electronic Research Archive, 2024, 32(8): 5109-5126. doi: 10.3934/era.2024235
[1] | Xiaopeng Yi, Huey Tyng Cheong, Zhaohua Gong, Chongyang Liu, Kok Lay Teo . Dynamic optimization of a two-stage fractional system in microbial batch process. Electronic Research Archive, 2024, 32(12): 6680-6697. doi: 10.3934/era.2024312 |
[2] | Yun Ni, Jinqing Zhan, Min Liu . Topological design of continuum structures with global stress constraints considering self-weight loads. Electronic Research Archive, 2023, 31(8): 4708-4728. doi: 10.3934/era.2023241 |
[3] | Sida Lin, Lixia Meng, Jinlong Yuan, Changzhi Wu, An Li, Chongyang Liu, Jun Xie . Sequential adaptive switching time optimization technique for maximum hands-off control problems. Electronic Research Archive, 2024, 32(4): 2229-2250. doi: 10.3934/era.2024101 |
[4] | Kai Zheng, Zengshen Ye, Fanchao Wang, Xi Yang, Jianguo Wu . Custom software development of structural dimension optimization software for the buckling of stiffened plates. Electronic Research Archive, 2023, 31(2): 530-548. doi: 10.3934/era.2023026 |
[5] | N. U. Ahmed, Saroj Biswas . Optimal strategy for removal of greenhouse gas in the atmosphere to avert global climate crisis. Electronic Research Archive, 2023, 31(12): 7452-7472. doi: 10.3934/era.2023376 |
[6] | Furong Xie, Yunkai Gao, Ting Pan, De Gao, Lei Wang, Yanan Xu, Chi Wu . Novel lightweight connecting bracket design with multiple performance constraints based on optimization and verification process. Electronic Research Archive, 2023, 31(4): 2019-2047. doi: 10.3934/era.2023104 |
[7] | Yuhai Zhong, Huashan Feng, Hongbo Wang, Runxiao Wang, Weiwei Yu . A bionic topology optimization method with an additional displacement constraint. Electronic Research Archive, 2023, 31(2): 754-769. doi: 10.3934/era.2023037 |
[8] | Chunhua Chu, Yijun Chen, Qun Zhang, Ying Luo . Joint linear array structure and waveform design for MIMO radar under practical constraints. Electronic Research Archive, 2022, 30(9): 3249-3265. doi: 10.3934/era.2022165 |
[9] | Vo Van Au, Jagdev Singh, Anh Tuan Nguyen . Well-posedness results and blow-up for a semi-linear time fractional diffusion equation with variable coefficients. Electronic Research Archive, 2021, 29(6): 3581-3607. doi: 10.3934/era.2021052 |
[10] | Chao Ma, Hong Fu, Pengcheng Lu, Hongpeng Lu . Multi-objective crashworthiness design optimization of a rollover protective structure by an improved constraint-handling technique. Electronic Research Archive, 2023, 31(7): 4278-4302. doi: 10.3934/era.2023218 |
The aim of this paper is to investigate the optimality conditions for a class of nonsmooth multiobjective fractional optimization problems subject to vanishing constraints. In particular, necessary and sufficient conditions for (weak) Pareto solution are presented in terms of the Clark subdifferential. Furthermore, we construct Wolfe and Mond–Weir-type dual models and derive some duality theorems by using generalized quasiconvexity assumptions. Some examples to show the validity of our conclusions are provided.
Recently, there has been a lot of attention on mathematical programming problems with vanishing constraints, which serve as a unified framework for several applications in topological optimization and optimal contral. The optimality conditions and duality theorems of these problems have been extensively researched since their introduction by Achtziger and Kanzow[1]. Mishra et al.[2] developed and analyzed dual models and obtained some duality results under differentiable assumptions. Hu and his co-authors in [3] provided some new dual models based on the dual models proposed by [2], which do not require computing the index sets. Tung [4] extended the single objective programming to multiobjective semi-infinite cases with vanishing constraints and investigated the KKT optimality conditions and duality results of the Wolfe and Mond–Weir-type dual models for this problem. Furthermore, Tung [5] established the KKT optimality conditions and the duality theorems for nonsmooth multiobjective semi-infinite optimization problems with vanishing constraints in terms of Clarke subdifferentials. By proposing new constraints for ACQ and VC-ACQ, Antczak [6] derived optimality conditions and duality results for differentiable semi-infinite multiobjective optimization problems with vanishing constraints. Additionally, Antczak [7] addressed the KKT optimality conditions for a class of nondifferentiable multiobjective programming problems with vanishing constraints under the VC-Cottle constraint qualification. However, duality results are not taken into account in [7]. Meanwhile, for directionally differentiable vector optimization problems, Antczak [8] also discussed the KKT necessary optimality conditions under both ACQ and m-ACQ; the sufficient optimality conditions and Wolfe-type duality theorems were also established under appropriate convexity hypotheses. Huang and Zhu [9] studied optimality conditions for Borwein proper efficient solutions of nonsmooth multiobjective optimization problems with vanishing constraints in terms of Clark subdifferential. Guu et al.[10] provided strong KKT sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints under generalized convexity assumptions. Wang and Wang [11,12] established optimality conditions for a class of nonsmooth interval-valued optimization problems with vanishing constraints, along with duality theorems for the corresponding dual models. The principal challenge inherent in optimization problems with vanishing constraints stems from the inclusion of a product of two functions within the constraint conditions. This situation gives rise to two notable issues: firstly, the feasible set is generally non-convex; secondly, when one of the functions in the product equals zero, the constraint properties of the other function become ineffective.
A fundamental question here is why we should study optimality conditions and duality in the framework of multiobjective fractional programming problems with vanishing constraints, as well as their corresponding Mond–Weir and Wolfe-type dual problems. We try to address this question succinctly. While many studies have been published over the past decade concerning optimization problems with vanishing constraints, there remains a scarcity of research specifically focused on multiobjective fractional programming problems with vanishing constraints (see [1,2,3,4,5,6,7,8,9,10,11,12]). Notably, the Mond–Weir and Wolfe types of dual problems have garnered significant attention in this field due to their practical applicability.
Due to the fact that in numerous optimization problems, the objective functions are expressed as quotients of two functions. There are many authors who established optimality conditions and employed the conditions to search for optimal solutions as well as duality theorems for such vector optimization problems (see [13,14,15,16,17]). Kim et al.[13] derived optimality conditions and duality results for nondifferentiable multiobjective fractional programming. Long[14] discussed similar results for this type of problem using (C,α,ρ,d)-convexity. Later, under higher-order (C,α,γ,ρ,d)-assumptions, Dubey et al.[15] established higher-order optimality conditions and duality results for such a problem. In addition, for nonsmooth fractional multiobjective optimization problems with equality or inequality constraints, several optimality conditions and duality theorems are studied in [16,17,18]. We note that there is relatively little literature on optimality conditions and duality theorems for nonsmooth multiobjective fractional programming problems with vanishing constraints.
Motivated by the above works, this paper aims to investigate nonsmooth multiobjective fractional optimization problems with vanishing constraints (abbreviated as, (FPVC)), and establish necessary and sufficient optimality conditions for (FPVC). Subsequently, duality theorems of Wolfe type and Mond–Weir-type for (FPVC) will be formulated. The organization of this paper is outlined as follows: In Section 2, essential notions and definitions are reviewed for subsequent discussion. Section 3 focuses on the optimality conditions for the (weak) Pareto minimum of (FPVC) subject to VC-Cottle constraints. Section 4 establishes Wolfe-type and Mond–Weir type dual models for (FPVC) and studies the weak, strong and converse duality theorems between (FPVC) and its dual problems.
Let Rn be the n-dimensional Euclidean space. For any a,b∈Rn, we define:
(ⅰ) a<b⇔ai<bi for all i=1,2,…,n;
(ⅱ) a≦b⇔ai≦bi for all i=1,2,…,n;
(ⅲ) a≤b⇔ai≦bi for all i=1,2,…,n and a≠b;
(ⅳ) a≰b is the negation of a≤b.
Row and column vectors will be treated with the same notation in this paper when the interpretation is obvious.
Let f:Rn→R be a locally Lipschitz function. The Clarke subdifferential of f at ˉx is defined as follows:
∂cf(ˉx):={ξ∈Rn: f∘(ˉx;v)≥⟨ξ, v⟩, ∀v∈Rn}, |
where
f∘(ˉx;v):=lim sup(x,t)→(ˉx,0+)f(x+tv)−f(x)t. |
Lemma 2.1. [19] Let f:Rn→R be locally Lipschitz at ˉx∈Rn and attain its minimum at ˉx. Then 0∈∂cf(ˉx).
Lemma 2.2. [19] Let fk:Rn→R, k∈K:={1,…,l} be a locally Lipschitz function at a point ˉx∈Rn. Then
∂c(∑k∈Kλkfk)(ˉx)⊆∑k∈Kλk∂cfk(ˉx), |
where λk∈R. If f(x):=maxk∈Kfk(x), then the function f(x) is also locally Lipschitz at ˉx. In addition,
∂cf(ˉx)⊂conv{∂cfk(ˉx):k∈K(ˉx)}, |
where K(ˉx):={k∈K:f(ˉx)=fk(ˉx)}, and conv is an abbreviation for convex hull.
Lemma 2.3. [19] Let f,g:Rn→R be locally Lipschitz functions at ˉx∈Rn. Then fg is a locally Lipschitz function at ˉx, and
∂c(fg)(ˉx)⊂g(ˉx)∂cf(ˉx)+f(ˉx)∂cg(ˉx). |
If g(ˉx)≠0, fg is also a locally Lipschitz function at ˉx, and
∂c(fg)(ˉx)⊂g(ˉx)∂cf(ˉx)−f(ˉx)∂cg(ˉx)g2(ˉx). |
Accordingly, we consider multiobjective fractional optimization with vanishing constraints (FPVC) as follows:
minF(x)=(f1(x)g1(x),…,fp(x)gp(x))s.t.hj(x)≦0, j∈J={1,…,m}Us(x)≧0, s∈S={1,…,q}Us(x)Vs(x)≦0, s∈S |
where fi,gi,hj,Us,Vs:Rn→R, i∈I:={1,…,p}, j∈J, s∈S, are locally Lipschitz functions. For all i∈I, we set fi(x)≧0, gi(x)>0. The set D stands for the feasible set of problems (FPVC).
Definition 2.1. Let ˉx∈D,
(i) ˉx is said to be a weak Pareto solution for (FPVC) if there is no other x∈D such that F(x)<F(ˉx).
(ii) ˉx is said to be a Pareto solution for (FPVC) if there is no other x∈D such that F(x)≤F(ˉx).
Now, for any feasible point ˉx∈D, we denote the following index sets:
J(ˉx):={j∈J∣hj(ˉx)=0}, |
S+(ˉx):={s∈S∣Us(ˉx)>0}, |
S0(ˉx):={s∈S∣Us(ˉx)=0}, |
S+0(ˉx):={s∈S∣Us(ˉx)>0,Vs(ˉx)=0}, |
S+−(ˉx):={s∈S∣Us(ˉx)>0,Vs(ˉx)<0}, |
S0+(ˉx):={s∈S∣Us(ˉx)=0,Vs(ˉx)>0}, |
S00(ˉx):={s∈S∣Us(ˉx)=0,Vs(ˉx)=0}, |
S0−(ˉx):={s∈S∣Us(ˉx)=0,Vs(ˉx)<0}, |
SUV(ˉx):={s∈S∣Us(ˉx)Vs(ˉx)=0}. |
Obviously, S0(ˉx)=S0+(ˉx)∪S00(ˉx)∪S0−(ˉx), S+(ˉx)=S+0(ˉx)∪S+−(ˉx), SUV(ˉx)=S0(ˉx)∪S+0(ˉx).
In the sequel, the KKT-necessary optimality conditions of the (weak) Pareto solution for (FPVC) are presented. Firstly, we introduce the following VC-Cottle constraint qualification given by Antczak [7].
Definition 3.1. [7] The VC-Cottle constraint qualification is fulfilled at ˉx∈D for (FPVC) if either hj(ˉx)<0, ∀j∈J, Us(ˉx)>0 and Vs(ˉx)<0, ∀s∈S or
0∉conv{∂chj(ˉx), j∈J(ˉx), −∂cUs(ˉx), s∈S, ∂c(VsUs)(ˉx), s∈S}if S00(ˉx)=∅,0∉conv{∂chj(ˉx), j∈J(ˉx), −∂cUs(ˉx), s∈S, ∂cVs(ˉx), s∈S}if S00(ˉx)≠∅. |
Theorem 3.1. Suppose that ˉx∈D is a weak Pareto solution in (FPVC) and that the VC-Cottle constraint qualification is satisfied at ˉx. Then there exist α∈Rp, β∈Rm, γU∈Rq and γV∈Rq such that certain conditions hold:
0∈p∑i=1αi(∂cfi(ˉx)−ri∂cgi(ˉx))+m∑j=1βj∂chj(ˉx)−q∑s=1γUs∂cUs(ˉx)+q∑s=1γVs∂cVs(ˉx), | (3.1) |
βjhj(ˉx)=0, j∈J, | (3.2) |
α≥0, β≧0, | (3.3) |
γUsUs(ˉx)=0, s∈S, | (3.4) |
γVsVs(ˉx)=0, s∈S, | (3.5) |
γUs=0, s∈S+(ˉx), γUs≧0, s∈S00(ˉx)∪S0−(ˉx), γUs∈R, s∈S0+(ˉx), | (3.6) |
γVs=0, s∈S0+(ˉx)∪S00(ˉx)∪S0−(ˉx)∪S+−(ˉx), γVs≧0, s∈S+0(ˉx). | (3.7) |
where ri=fi(ˉx)gi(ˉx) (∀i∈I).
Proof. We define an auxiliary function Ψ(x):Rn→R, where
Ψ(x):=max{fi(x)gi(x)−fi(ˉx)gi(ˉx), hj(x), −Us(x), Us(x)Vs(x), i∈I, j∈J, s∈S}. | (3.8) |
Since ˉx is a weak Pareto solution of (FPVC), it can be deduced that Ψ(x)≧0 for all x∈Rn, and that Ψ(ˉx)=0. Which implies that Ψ attains its global minimum at ˉx. It follows from Lemma 2.1 one has
0∈∂cΨ(ˉx). | (3.9) |
Furthermore, since
∂c(fi(x)gi(x)−fi(ˉx)gi(ˉx))=∂c(fi(x)gi(x)), | (3.10) |
From Lemma 2.2, one has
∂cΨ(ˉx)⊂conv{∂c(fi(ˉx)gi(ˉx)), ∂chj(ˉx), −∂cUs(ˉx), ∂c(UsVs)(ˉx):i∈I, j∈J(ˉx), s∈S0(ˉx), s∈SUV(ˉx)}. | (3.11) |
Case 1. We suppose that hj(ˉx)<0, ∀j∈J, Us(ˉx)>0 and Vs(ˉx)<0, ∀s∈S. Then, by (3.9) and (3.11), one has 0∈conv{∂c(fi(ˉx)gi(ˉx)): i∈I}. Then there exist μ∈Rp, μ≥0, p∑i=1μi=1 such that 0∈p∑i=1μi∂c(fi(ˉx)gi(ˉx)).
From Lemma 2.3, one has
∂c(fi(ˉx)gi(ˉx))⊂gi(ˉx)∂cfi(ˉx)−fi(ˉx)∂cgi(ˉx)g2i(ˉx). | (3.12) |
Thus,
0∈p∑i=1μi1gi(ˉx)(∂cfi(ˉx)−fi(ˉx)gi(ˉx)∂cgi(ˉx)). |
Setting ri=fi(ˉx)gi(ˉx) and αi=μi1gi(ˉx), ∀i∈I, we obtain α≥0 and
0∈p∑i=1αi(∂cfi(ˉx)−ri∂cgi(ˉx)). |
Therefore, we have (3.1)–(3.7) by setting βj=0, j∈J, γUS=0, s∈S+(ˉx), γVS=0, s∈S+−(ˉx).
Case 2. If there exists j∈J such that hj(ˉx)=0 or s∈S such that Us(ˉx)=0 or Vs(ˉx)=0, then there exist μ∈Rp, μ≧0, β∈Rm, β≧0, ω∈RS0(ˉx), ω≧0 and υ∈RSUV(ˉx), υ≧0 with ∑pi=1ui+∑j∈J(ˉx)βj+∑s∈SUV(ˉx)vs=1 such that
0∈p∑i=1μi∂c(fi(ˉx)gi(ˉx))+∑j∈J(ˉx)βj∂chj(ˉx)−∑s∈S0(ˉx)ωs∂cUs(ˉx)+∑s∈SUV(ˉx)υs∂c(UsVs)(ˉx). | (3.13) |
Therefore, we obtain
0∈p∑i=1μi∂c(fi(ˉx)gi(ˉx))+m∑j=1βj∂chj(ˉx)−q∑s=1ωs∂cUs(ˉx)+q∑s=1υs∂c(UsVs)(ˉx), | (3.14) |
where βj=0, j∉J(ˉx), ωs=0, s∉S0(ˉx) and υs=0, s∉SUV(ˉx). From 2.3.13 in [18], one has
∂c(UsVs)(ˉx)⊂Vs(ˉx)∂cUs(ˉx)+Us(ˉx)∂cVs(ˉx). | (3.15) |
Let ri=fi(ˉx)gi(ˉx) and αi=μi1gi(ˉx) for all i∈I. Combining (3.12), (3.14), and (3.15), we have
0∈p∑i=1αi(∂cfi(ˉx)−ri∂cgi(ˉx))+m∑j=1βj∂chj(ˉx)−q∑s=1(ωs−υsVs(ˉx))∂cUs(ˉx)+q∑s=1υsUs(ˉx)∂cVs(ˉx). | (3.16) |
Now, setting γUs=ωs−υsVs(ˉx) and γVs=υsUs(ˉx) for all s∈S, we have
0∈p∑i=1αi(∂cfi(ˉx)−ri∂cgi(ˉx))+m∑j=1βj∂chj(ˉx)−q∑s=1γUs∂cUs(ˉx)+q∑s=1γVs∂cVs(ˉx). | (3.17) |
The proofs of (3.6) and (3.7) are coupled with Theorem 3.1 in [7]. Then, (3.4) and (3.5) hold. By the VC-Cottle constraint qualification, we have Lagrange multiplier α is not equal to 0 (i.e., α≥0). In this case, the conditions (3.1)–(3.7) hold.
Remark 1. When ˉx is a Pareto solution of (FPVC), the conditions (3.1)–(3.7) hold as well. The proof of this statement is similar to that of Theorem 1 and is thus omitted in this paper. Further, note that the conditions (3.1)–(3.7) are KKT necessary optimality conditions due to the fact that α≠0.
Remark 2. It is noted that when gi(x)≡1 (∀i∈I), the nonsmooth multiobjective fractional optimization problems with vanishing constraints (FPVC) transforms into the nonsmooth multiobjective optimization problems with vanishing constraints (MPVC) in [7]. Consequently, Theorem 1 in our study enhances the corresponding conclusions in [7].
Definition 3.2. The point ˉx∈D is called an S-stationary point for (FPVC) if there exist α∈Rp, β∈Rm, γU∈Rq and γV∈Rq not equal to 0, such that the conditions
0∈p∑i=1αi(∂cfi(ˉx)−ri∂cgi(ˉx))+m∑j=1βj∂chj(ˉx)−q∑s=1γUs∂cUs(ˉx)+q∑s=1γVs∂cVs(ˉx), | (3.18) |
α≥0,βj≧0, j∈J(ˉx), βj=0, j∉J(ˉx), | (3.19) |
γUs=0, s∈S+(ˉx), γUs≧0, s∈S00(ˉx)∪S0−(ˉx), γUs∈R, s∈S0+(ˉx), | (3.20) |
γVs=0, s∈S0+(ˉx)∪S00(ˉx)∪S0−(ˉx)∪S+−(ˉx), γVs≧0, s∈S+0(ˉx), | (3.21) |
hold, where ri=fi(ˉx)gi(ˉx) (∀i∈I).
An example is provided to demonstrate the application of Theorem 3.1.
Example 3.1. Consider the problem (FPVC) with the following parameters: I={1,2}, J={1}. For all x=(x1,x2)∈R2,
minF(x)=(f1(x)g1(x), f2(x)g2(x))s.t.h1(x)=−x1−x2≦0U1(x)=x2≧0U1(x)V1(x)=x2(x1+|x2|−1)≦0 |
where f1(x)=x1+x22, f2(x)=|x1|+|x2|, g1(x)=1−x21, g2(x)=−3x21+x2+2, V1(x)=x1+|x2|−1. We have that D={(x1,x2)∈R2:−x1−x2≦0, x2≧0, x2(x1+|x2|−1)≦0} and ˉx=(0,0)∈D. The sets J(ˉx)={1}, S0−(ˉx)={1}, S+0(ˉx)=S+−(ˉx)=S0+(ˉx)=S00(ˉx)=∅, and the parameter (r1,r2)=(0,0). Thus, we have
∂c(f1−r1g1)(ˉx)={(1,0)}, |
∂c(f2−r2g2)(ˉx)=[−1,1]×[−1,1], |
∂ch1(ˉx)={(−1,−1)}, |
∂cU1(ˉx)={(0,1)}, |
∂cV1(ˉx)={1}×[−1,1], |
∂c(U1V1)(ˉx)={(0,−1)}. |
Since 0∉conv{∂ch1(ˉx), −∂cU1(ˉx), ∂c(U1V1)(ˉx)} when S00(ˉx)=∅, the VC-Cottle constraint qualification is fulfilled at ˉx. Further, there exist α1=12, α2=12, β1=12, γU1=0, γV1=0, and ξ1=(1,0)∈∂c(f1−r1g1)(ˉx), ξ2=(0,1)∈∂c(f2−r2g2)(ˉx), ρ1=(−1,−1)∈∂ch1(ˉx), δ1=(0,1)∈∂cU1(ˉx), ν1=(1,−1)∈∂cV1(ˉx) satisfying α1ξ1+α2ξ2+β1ρ1−γU1v1+γV1v2=0, that is
0∈2∑i=1αi(∂cfi(ˉx)−ri∂cgi(ˉx))+β1∂ch1(ˉx)−γU1∂cU1(ˉx)+γV1∂cV1(ˉx). |
Hence, the conditions of Theorem 1 are met.
Definition 3.3. Let f:Rn→R be a locally Lipschitz function.
(i) f is said to be generalized quasiconvex at ˉx if, for each x∈Rn,
f(x)≦f(ˉx)⟹⟨η, x−ˉx⟩≦0,∀η∈∂cf(ˉx). |
(ii) f is said to be strictly generalized quasiconvex at ˉx if, for each x∈Rn with x≠ˉx,
f(x)≦f(ˉx)⟹⟨η, x−ˉx⟩<0,∀η∈∂cf(ˉx). |
Lemma 3.1. [8] Let f0 be strictly generalized quasiconvex and f1,f2,…,fs be generalized quasiconvex at ˉx. If λ0>0 and λl≧0, l=1,…,s, then ∑sl=0λlfl is strictly generalized quasiconvex at ˉx.
Let ˉx∈D be an S-stationary point for (FPVC). According to Definition 3.2, if there exist α∈Rp, β∈Rm, γU∈Rq and γV∈Rq not equal to 0, such that (3.18)–(3.21) are fulfilled at ˉx, then we introduce the following denotations:
SU+0+(ˉx):={s∈S0+(ˉx)∣γUs>0}, |
SU−0+(ˉx):={s∈S0+(ˉx)∣γUs<0}, |
SV++0(ˉx):={s∈S+0(ˉx)∣γVs>0}. |
Theorem 3.2. Let ˉx∈D be an S-stationary point for (FPVC). Suppose that the conditions (3.18)–(3.21) are fulfilled at ˉx and the following assumptions are satisfied:
(a) DV+:=⋃t∈S+0(ˉx){x∈D∖{ˉx}∣Vs>0}=∅ or SV++0(ˉx)=∅,
(b) SU−0+(ˉx)=∅.
Additionally, it is assumed that the functions fi, i∈I, hj, j∈J(ˉx), −gi, i∈I, −Us, s∈S00(ˉx)∪S0−(ˉx)∪SU+0+(ˉx) and Vs, s∈S+0(ˉx) are generalized quasiconvex at ˉx. Among the functions fi−rigi, i∈I, hj, j∈J(ˉx), −Us and Vs, s∈S, at least one is strictly generalized quasiconvex at ˉx. Then, ˉx is a weak Pareto solution of (FPVC).
Proof. Given that ˉx∈S is an S-stationary point for (FPVC), it follows from Definition 3.2 that there exist α∈Rp, β∈Rm, γU∈Rq and γV∈Rq such that
0∈p∑i=1αi(∂cfi(ˉx)−ri∂cgi(ˉx))+m∑j=1βj∂chj(ˉx)−q∑s=1γUs∂cUs(ˉx)+q∑s=1γVs∂cVs(ˉx), |
and (3.19)–(3.21) hold. Then, there are ξi∈∂cfi(ˉx)−ri∂cgi(ˉx), i∈I, ρj∈∂chj(ˉx), j∈J, δs∈∂cUs(ˉx) and νs∈∂cVs(ˉx), s∈S, such that
0=p∑i=1αiξi+m∑j=1βjρj−q∑s=1γUsδs+q∑s=1γVsνs. | (3.22) |
Assuming the contrary, if ˉx is not a weak Pareto solution of (FPVC), then there exists ˜x∈S that satisfies
fi(˜x)gi(˜x)−fi(ˉx)gi(ˉx)<0. |
Therefore, one has
fi(˜x)gi(˜x)−fi(ˉx)gi(ˉx)<0⟺fi(˜x)−rigi(˜x)<0, |
where ri=fi(ˉx)gi(ˉx) (∀i∈I). Thus, there exists α∈Rp, α≥0, such that
p∑i=1αi(fi(˜x)−rigi(˜x))<0=p∑i=1αi(fi(ˉx)−rigi(ˉx)). | (3.23) |
By ˜x∈S and Definition 3.2, we have
m∑j=1βihj(˜x)≦m∑j=1βihj(ˉx). | (3.24) |
According to the conditions (a) and (b), one has
−q∑s=1γUsUs(˜x)≦−q∑s=1γUsUs(ˉx), | (3.25) |
q∑s=1γVsVs(˜x)≦q∑s=1γVsVs(ˉx). | (3.26) |
Thus, combining (3.23)–(3.26), we have
p∑i=1αi(fi(˜x)−rigi(˜x))+m∑j=1βihj(˜x)−q∑s=1γUsUs(˜x)+q∑s=1γVsVs(˜x)<p∑i=1αi(fi(ˉx)−rigi(ˉx))+m∑j=1βihj(ˉx)−q∑s=1γUsUs(ˉx)+q∑s=1γVsVs(ˉx). | (3.27) |
By the generalized quasiconvex hypotheses of the functions fi and −gi, ∀i∈I, it can be deduced that the function fi−rigi(∀i∈I) is generalized quasiconvex at ˉx, where ri=fi(ˉx)gi(ˉx)≧0 for all i∈I. By applying Lemma 2.2, it follows that
p∑i=1αi(fi(x)−rigi(x))+m∑j=1βihj(x)−q∑s=1γUsUs(x)+q∑s=1γVsVs(x) |
is strictly generalized quasiconvex at ˉx, and
p∑i=1αiξi+m∑j=1βjρj−q∑s=1γUsδs+q∑s=1γVsνs∈∂c(p∑i=1αi(fi(ˉx)−rigi(ˉx))+m∑j=1βihj(˜x)−q∑s=1γUsUs(ˉx)+q∑s=1γVsVs(ˉx)). |
Therefore,
⟨p∑i=1αiξi+m∑j=1βjρj−q∑s=1γUsδs+q∑s=1γVsνs, ˜x−ˉx⟩<0, |
which contradicts (3.22).
Example 3.2. In Example 3.1, the functions f1, f2, h1, −g1, −g2, −U1 and V1 are generalized quasiconvex at ˉx on D, gi(x)>0 and ri=fi(ˉx)gi(ˉx)≧0, ∀i∈I. One can see that ˉx=(0,0) is an S-stationary point of the problem in Example 3.1. Since S+0(ˉx)=S0+(ˉx)=∅, the conditions (a) and (b) are satisfied. Furthermore, we can verify that h1 is strictly generalized quasiconvex at ˉx. In fact, for any x=(x1,x2)≠ˉx satisfying h1(x)≦h1(ˉx)=0, then x1+x2>0, and so ⟨η, x−ˉx⟩=−x1−x2<0, where η∈∂ch1(ˉx)={(−1,−1)}}. Therefore, ˉx=(0,0) is a weak Pareto solution.
The aim of this section is to consider the Wolfe and Mond–Weir-type dual problems for (FPVC). We prove the duality results between (FPVC) and its dual problems under the generalized quasiconvexity and strictly generalized quasiconvexity assumptions imposed on the functions involved.
Let y∈Rn, α∈Rp+∖{0}, β∈Rm, γU∈Rq and γV∈Rq. The vector Lagrange function Φ is defined as follows:
Φ(y,α,β,γU,γV)=(f1(y)g1(y),…,fp(y)gp(y))+(m∑j=1βjhj(y)−q∑s=1γUsUs(y)+q∑s=1γVsVs(y))e, |
where e=(1,⋯,1)∈Rp.
For any ˉx∈D, the Wolfe-type dual model (DW(ˉx)) associated with the problem (FPVC) is defined as:
(DW(ˉx)) Rp+−maxΦ(y,α,β,γU,γV)s.t.0∈p∑i=1αi(∂cfi(y)−ri∂cgi(y))+m∑j=1βj∂chj(y)−q∑s=1γUs∂cUs(y)+q∑s=1γVs∂cVs(y),α≥0, p∑i=1αi=1, βj≧0, j∈J,γUs=υsUs(ˉx), υs≧0, s∈S,γVs=ωs−υsVs(ˉx), ωs≧0, s∈S. |
Let
ΩW(ˉx)={(y,α,β,γU,γV,υ,ω):verifying the constraints of (DW(ˉx))}, |
denote the feasible set of (DW(ˉx)).
The other Wolfe-type dual model, which does not rely on ˉx, is
(DW) Rp+−maxΦ(y,α,β,γU,γV)s.t.(y,α,β,γU,γV,υ,ω)∈ΩW |
where the sets ΩW=⋂ˉx∈SΩW(ˉx).
Definition 4.1. The point (˜y,˜α,˜β,˜γU,˜γV,˜υ,˜ω)∈ΩW is said to be a Pareto solution of (DW), if there is no (y,α,β,γU,γV,υ,ω)∈ΩW satisfying
Φ(˜y,˜α,˜β,˜γU,˜γV)≤Φ(y,α,β,γU,γV). |
In what follows, weak, strong, and converse duality theorems between (FPVC) and the Wolfe type duality problem (DW) are given.
Theorem 4.1. (Weak duality) Let ˉx∈D and (y,α,β,γU,γV,υ,ω)∈ΩW be any feasible solutions for (FPVC) and (DW), respectively. If Φ(⋅,α,β,γU,γV) is strictly generalized quasiconvex at y∈Rn, then
F(ˉx)≰Φ(y,α,β,γU,γV). |
Proof. Suppose, contrary to the result, that
F(ˉx)≤Φ(y,α,β,γU,γV). |
That is
F(ˉx)≤F(y)+m∑j=1βjhj(y)−q∑s=1γUsUs(y)+q∑s=1γVsVs(y), | (4.1) |
By ˉx∈D, it holds that
hj(ˉx)=0, βj≧0, j∈J(ˉx), |
hj(ˉx)<0, βj=0, j∉J(ˉx), |
−Us(ˉx)<0, γUs=0, s∈S+(ˉx), |
Us(ˉx)=0, γUs≧0, s∈S00(ˉx)∪S0−(ˉx), |
Us(ˉx)=0, γUs∈R, s∈S0+(ˉx), |
Vs(ˉx)>0, γVs=0,s∈S0+(ˉx), |
Vs(ˉx)=0, γVs≧0,s∈S00(ˉx)∪S+0(ˉx), |
Vs(ˉx)<0, γVs=0,s∈S0−(ˉx)∪S+−(ˉx). |
Thus,
m∑j=1βjhj(ˉx)−q∑s=1γUsUs(ˉx)+q∑s=1γVsVs(ˉx)≦0. | (4.2) |
In (4.1) and (4.2), we have
Φ(ˉx,α,β,γU,γV)≤Φ(y,α,β,γU,γV). |
By utilizing the strictly generalized quasiconvex at y∈Rn of Φ(⋅,α,β,γU,γV), it can be deduced that there exist ¯ξi∈∂cfi(y)−ri∂cgi(y), i∈I, ¯ρj∈∂chj(y), j∈J, ¯δs∈∂cUs(y), ¯νs∈∂cVs(y), s∈S, such that
⟨p∑i=1αi¯ξi+m∑j=1βj¯ρj−q∑s=1γUs¯δs+q∑s=1γVs¯νs, ˉx−y⟩<0. |
This contradicts the constraint of (DW).
Theorem 4.2. (Strong duality) Let ˉx∈D be a weak Pareto solution of problem (FPVC), and suppose the VC-Cottle constraint qualification is fulfilled at ˉx., then there exist Lagrange multipliers α∈Rp, β∈Rm, γU∈Rq, γV∈Rq, υ∈Rq and ω∈Rq such that (ˉx,α,β,γU,γV,υ,ω) is feasible in (DW) and F(ˉx)=Φ(ˉx,α,β,γU,γV). If Φ(⋅,α,β,γU,γV) is strictly generalized quasiconvex at y∈Rn, then (ˉx,α,β,γU,γV,υ,ω) is a Pareto solution of (DW).
Proof. From the assumptions that ˉx∈D and the VC-Cottle constraint qualification holds, there exist α∈Rp, β∈Rm, γU∈Rq and γV∈Rq such that the necessary optimality conditions (Theorem 3.1) are fulfilled. Then, by the definition of ΩW and (3.1)–(3.7), we conclude that (ˉx,α,β,γU,γV,υ,ω) is feasible in (DW) and
m∑j=1βjhj(ˉx)−q∑s=1γUsUs(ˉx)+q∑s=1γVsVs(ˉx)=0. |
Thus, F(ˉx)=Φ(ˉx,α,β,γU,γV).
Suppose, on the contrary, that (ˉx,α,β,γU,γV,υ,ω) is not a Pareto solution of (DW), then we have (˜y,˜α,˜β,~γU,~γV,˜υ,˜ω) such that
Φ(ˉx,α,β,γU,γV)≤Φ(˜y,˜α,˜β,~γU,~γV). |
Then, F(ˉx)≤Φ(˜y,˜α,˜β,~γU,~γV), which contradicts Theorem 4.1.
Theorem 4.3. (Converse duality) Suppose that ˉx∈D is a feasible solution of (FPVC), (y,α,β,γU,γV,υ,ω) is a weak Pareto solution of (DW), and the inequalities
{βjhj(y)≧0,∀ j∈J−γUsUs(y)≧0,∀ s∈SγVsVs(y)≧0,∀ s∈S | (4.3) |
hold, such that y∈D. If one of the following assumptions is fulfilled:
(i) Φ(⋅,α,β,γU,γV) is strictly generalized quasiconvex at y;
(ii) fi≧0, −gi<0(i∈I) are strictly generalized quasiconvex at y, hj, j∈J(ˉx), −Us, s∈S00(ˉx)∪S0−(ˉx)∪SU+0+(ˉx) and Vs, s∈S+0(ˉx) are generalized quasiconvex at ˉx,
then y is a Pareto solution in (FPVC).
Proof. Suppose, on the contrary, that y∈D is not a Pareto solution in (FPVC). Then, there exists ˜y∈D such that
F(˜y)≤F(y). | (4.4) |
For the assumption (i), since ˜y and (y,α,β,γU,γV,υ,ω) are feasible points for (FPVC) and (DW), respectively, combined with (4.2) and (4.3), one gets
m∑j=1βjhj(˜y)−q∑s=1γUsUs(˜y)+q∑s=1γVsVs(˜y)≦m∑j=1βjhj(y)−q∑s=1γUsUs(y)+q∑s=1γVsVs(y), |
Hence,
Φ(˜y,α,β,γU,γV)≦Φ(y,α,β,γU,γV). |
Due to the fact that Φ(⋅,α,β,γU,γV) is strictly generalized quasiconvex at y, there exist ¯ξi∈∂cfi(y)−ri∂cgi(y), i∈I, ¯ρj∈∂chj(y), j∈J, ¯δs∈∂cUs(y) and ¯νs∈∂cVs(y), s∈S, such that
⟨p∑i=1αi¯ξi+m∑j=1βj¯ρj−q∑s=1γUs¯δs+q∑s=1γVs¯νs, ˜y−y⟩<0. |
This contradicts the constraint of (DW).
For the assumption (ii), since ˜y and (y,α,β,γU,γV,υ,ω) are feasible points for (FPVC) and (DW) respectively, by (4.3), we have
βjhj(˜y)≦βjhj(y),∀ j∈J−γUsUs(˜y)≦−γUsUs(y),∀ s∈SγVsVs(˜y)≦γVsGi(y).∀ s∈S |
Thus
{hj(˜y)≦hj(y), ∀ j∈J(˜y)−Us(˜y)≦−Us(y), ∀ s∈S00(˜y)∪S0−(˜y)∪SU+0+(˜y)−Us(˜y)≧−Us(y), ∀ s∈SU−0+(˜y)Vs(˜y)≦Vs(y). ∀ s∈S+0(˜y) | (4.5) |
Using the generalized quasiconvex of the functions in assumption (ii) and (4.5), the inequalities
⟨¯ρj, ˜y−y⟩≦0, βj≧0, ∀¯ρj∈∂chj(y), j∈J(˜y), |
⟨−¯δs, ˜y−y⟩≦0, γUs≧0, ∀¯δs∈∂cUs(y), s∈S00(˜y)∪S0−(˜y)∪SU+0+(˜y), |
⟨−¯δs, ˜y−y⟩≧0, γUs<0, ∀¯δs∈∂cUs(y), s∈SU−0+(˜y), |
⟨¯νs, ˜y−y⟩≦0, γVs≧0, ∀¯νs∈∂cVs(y), s∈S+0(˜y), |
hold, that is
⟨m∑j=1βj¯ρj−q∑s=1γUs¯δs+q∑s=1γVs¯νs, ˜y−y⟩≦0. |
Since 0∈p∑i=1αi(∂cfi(y)−ri∂cgi(y))+m∑j=1βj∂chj(y)−q∑s=1γUs∂cUs(y)+q∑s=1γVs∂cVs(y), there exists ¯ξi∈∂cfi(y)−ri∂cgi(y), i∈I, such that
⟨p∑i=1αi¯ξi, ˜y−y⟩≧0. | (4.6) |
By F(˜y)−F(y)≤0⟺fi(˜y)−ˆrigi(˜y)≤0, where ˆri=fi(y)gi(y), ∀i∈I. Hence, there exists α∈Rp, (α≥0), such that
p∑i=1αi(fi(˜y)−ˆrigi(˜y))≤0=p∑i=1αi(fi(y)−ˆrigi(y)). | (4.7) |
For all i∈I, the functions fi≧0 and −gi<0 are strictly generalized quasiconvex at y and ˆri=fi(y)gi(y)≧0, it follows that fi−ˆri∗gi (∀i∈I) is strictly generalized quasiconvex at y. Then, there exists ¯ξi∈∂cfi(y)−ri∂cgi(y) (∀i∈I) such that
⟨p∑i=1αi¯ξi, ˜y−y⟩<0. |
This contradicts (4.6).
For ˉx∈D, the Mond–Weir type dual model (DMW(ˉx)) is follows:
(DMW(ˉx)) Rp+−maxF(y)s.t.0∈p∑i=1αi(∂cfi(y)−ri∂cgi(y))+m∑j=1βj∂chj(y)−q∑s=1γUs∂cUs(y)+q∑s=1γVs∂cVs(y),α≥0, p∑i=1αi=1,βjhj(y)=0, βj≧0, j∈J,−γUsUs(y)≧0, γVsVs(y)≧0, s∈S,γUs=υsUs(ˉx), υs≧0, s∈S,γVs=ωs−υsVs(ˉx), ωs≧0, s∈S. |
Let
ΩMW(ˉx)={(y,α,β,γU,γV,υ,ω):verifying the constraints of (DMW(ˉx))}, |
denote the feasible set of (DMW(ˉx)).
The other Mond–Weir type dual model, which does not rely on ˉx, is
(DMW) Rp+−maxF(y)s.t.(y,α,β,γU,γV,υ,ω)∈ΩMW |
where ΩMW=⋂ˉx∈SΩMW(ˉx).
Definition 4.2. The point (˜y,˜α,˜β,˜γU,˜γV,˜υ,˜ω)∈ΩMW is said to be a Pareto solution of (DMW), if there is no (y,α,β,γU,γV,υ,ω)∈ΩMW satisfying
F(˜y)≤F(y). |
Next, we present the duality theorems between (FPVC) and the Mond–Weir type dual problem (DMW).
Theorem 4.4. (Weak duality) Let ˉx∈D and (y,α,β,γU,γV,υ,ω)∈ΩMW be any feasible solutions for (FPVC) and (DMW), respectively. If one of the following assumptions is fulfilled:
(i) fi≧0, −gi<0(i∈I) are strictly generalized quasiconvex at y, m∑j=1βjhj(⋅)−q∑s=1γUsUs(⋅)+q∑s=1γVsVs(⋅) is generalized quasiconvex at y;
(ii) fi≧0, −gi<0(i∈I) are strictly generalized quasiconvex at y, hj, j∈J(ˉx), −Us, s∈S00(ˉx)∪S0−(ˉx)∪SU+0+(ˉx) and Vs, s∈S+0(ˉx) are generalized quasiconvex at ˉx,
then
F(ˉx)≰F(y). |
Proof. Suppose, contrary to the result, that
F(ˉx)≤F(y). |
By the strictly generalized quasiconvex at y of fi and −gi (∀i∈I), we have that fi−^rigi(∀i∈I) is strictly generalized quasiconvex at y, where ^ri=fi(y)gi(y)≧0. Then, there exists ¯ξi∈∂cfi(y)−ri∂cgi(y) for all i∈I such that
⟨p∑i=1αi¯ξi, ˜y−y⟩<0. | (4.8) |
For the assumption (i), since ˉx∈D and (y,α,β,γU,γV,υ,ω)∈ΩMW, it follows that
m∑j=1βjhj(ˉx)−q∑s=1γUsUs(ˉx)+q∑s=1γVsVs(ˉx)≦m∑j=1βjhj(y)−q∑s=1γUsUs(y)+q∑s=1γVsVs(y). |
Since m∑j=1βjhj(⋅)−q∑s=1γUsUs(⋅)+q∑s=1γVsVs(⋅) is generalized quasiconvex at y, there are ¯ρj∈∂chj(y), j∈J, ¯δs∈∂cUs(y), ¯νs∈∂cVs(y), s∈S, such that
⟨m∑j=1βj¯ρj−q∑s=1γUs¯δs+q∑s=1γVs¯νs, ˉx−y⟩≦0. |
According to the condition
0∈p∑i=1αi(∂cfi(y)−ri∂cgi(y))+m∑j=1βj∂chj(y)−q∑s=1γUs∂cUs(y)+q∑s=1γVs∂cVs(y), |
there exists ¯ξi∈∂cfi(y)−ri∂cgi(y), i∈I satisfying
⟨p∑i=1αi¯ξi, ˉx−y⟩≧0, |
which contradicts (4.8).
For the assumption (ii), since ˉx∈D and (y,α,β,γU,γV,υ,ω)∈ΩMW, it holds that
{hj(ˉx)≦hj(y), ∀ j∈J(ˉx)−Us(ˉx)≦−Us(y), ∀ s∈S00(ˉx)∪S0−(ˉx)∪SU+0+(ˉx)−Us(ˉx)≧−Us(y), ∀ s∈SU−0+(ˉx)Vs(ˉx)≦Vs(y). ∀ s∈S+0(ˉx) | (4.9) |
By the generalized quasiconvex of the functions in conditions (ii) and (4.9), the inequalities
⟨¯ρj, ˉx−y⟩≦0, βj≧0, ∀¯ρj∈∂chj(y), j∈J(ˉx) |
⟨−¯δs, ˉx−y⟩≦0, γUs≧0, ∀¯δs∈∂cUs(y), s∈S00(ˉx)∪S0−(ˉx)∪SU+0+(ˉx) |
⟨−¯δs, ˉx−y⟩≧0, γUs<0, ∀¯δs∈∂cUs(y), s∈SU−0+(ˉx) |
⟨¯νs, ˉx−y⟩≦0, γUs≧0, ∀¯δs∈∂cUs(y), s∈S+0(ˉx) |
hold, that is
⟨m∑j=1βj¯ρj−q∑s=1γUs¯δs+q∑s=1γVs¯νs, ˉx−y⟩≦0. |
The rest of the proof is omitted because it is consistent with assumption (i).
Theorem 4.5. Let ˉx∈D be a weak Pareto solution of the problem (FPVC). The VC-Cottle constraint qualification holds at ˉx. Then, there exist α∈Rp, β∈Rm, γU∈Rq, γV∈Rq, ˉυ∈Rq and ˉβ∈Rq such that (ˉx,α,β,γU,γV,υ,ω) is feasible in (DMW). If the assumptions of Theorem 4.4 are satisfied, then (ˉx,α,β,γU,γV,υ,ω) is a Pareto solution of (DMW).
Proof. From the assumption that ˉx∈D and the VC-Cottle constraint qualification holds at ˉx, there exist α∈Rp, β∈Rm, γU∈Rq, and γV∈Rq, such that necessary optimality conditions (Theorem 3.1) are fulfilled. Then, by the definitions of ΩMW and (3.1)–(3.7), we conclude that (ˉx,α,β,γU,γV,υ,ω) is feasible in (DMW).
Suppose, on the contrary, that (ˉx,α,β,γU,γV,υ,ω) is not a Pareto solution of (DW), then we get (˜y,˜α,˜β,~γU,~γV,˜υ,˜ω)∈ΩMW such that
F(ˉx)≤F(˜y), |
which contradicts Theorem 4.4.
Theorem 4.6. (Converse duality) Let ˉx∈D be feasible in (FPVC) and (y,α,β,γU,γV,υ,ω) be a weak Pareto solution in (DMW) such that y∈D. If the hypotheses of Theorem 4.4 hold, then y is a Pareto solution in (FPVC).
Proof. Suppose on the contrary that y is not a Pareto solution in (FPVC). Then there exists ˜y∈D such that
F(˜y)≤F(y). | (4.10) |
Since ˜y∈D and (y,α,β,γU,γV,υ,ω) are feasible points for (FPVC) and (DMW), respectively, it holds that F(˜y)≰F(y) by Theorem 4.4, which contradicts to (4.10).
The optimality conditions and duality results for the problem (FPVC) with both inequality and vanishing constraints are presented. Utilizing the Clarke subdifferential, the necessary KKT optimality conditions are derived under the VC-Cottle constraint. By assuming generalized quasiconvexity and strictly generalized quasiconvexity, sufficient optimality conditions and duality theorems are established. The results in this paper improve the existing ones in [7]. In further research, it will be interesting to consider the second-order optimality conditions for (FPVC).
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This work is supported by the special fund for Science and Technology Innovation Teams of Shanxi Province (NO. 202204051002018).
The authors declare there is no conflicts of interest.
[1] |
W. Achtziger, C. Kanzow, Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications, Math. Program., 114 (2008), 69–99. https://doi.org/10.1007/s10107-006-0083-3 doi: 10.1007/s10107-006-0083-3
![]() |
[2] |
S. K. Mishra, V. Singh, V. Laha, On duality for mathematical programs with vanishing constraints, Ann. Oper. Res., 243 (2016), 249–272. https://doi.org/10.1007/s10479-015-1814-8 doi: 10.1007/s10479-015-1814-8
![]() |
[3] |
Q. J. Hu, J. G. Wang, Y. Chen, New dualities for mathematical programs with vanishing constraints, Ann. Oper. Res., 287 (2020), 233–255. https://doi.org/10.1007/s10479-019-03409-6 doi: 10.1007/s10479-019-03409-6
![]() |
[4] |
L. T. Tung, Karush–Kuhn–Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints, Ann. Oper. Res., 311 (2022), 1307–1334. https://doi.org/10.1007/s10479-020-03742-1 doi: 10.1007/s10479-020-03742-1
![]() |
[5] |
L. T. Tung, Karush-Kuhn-Tucker optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems with vanishing constraints, Appl. Set-Valued Anal. Optim., 4 (2022). https://doi.org/10.23952/asvao.4.2022.1.01 doi: 10.23952/asvao.4.2022.1.01
![]() |
[6] |
T. Antczak, Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints, 4OR-Q. J. Oper. Res., 20 (2022), 417–442. https://doi.org/10.1007/s10288-021-00482-1 doi: 10.1007/s10288-021-00482-1
![]() |
[7] |
T. Antczak, Optimality results for nondifferentiable vector optimization problems with vanishing constraints, J. Appl. Anal. Comput., 13 (2023), 2613–2629. https://doi.org/10.11948/20220465 doi: 10.11948/20220465
![]() |
[8] |
T. Antczak, On directionally differentiable multiobjective programming problems with vanishing constraints, Ann. Oper. Res., 328 (2023), 1181–1212. https://doi.org/10.1007/s10479-023-05368-5 doi: 10.1007/s10479-023-05368-5
![]() |
[9] |
H. Huang, H. Zhu, Stationary condition for Borwein proper efffcient solutions of nonsmooth multiobjective problems with vanishing constraints, Mathematics, 10 (2022), 4569. https://doi.org/10.3390/math10234569 doi: 10.3390/math10234569
![]() |
[10] |
S. M. Guu, Y. Singh, S. K. Mishra, On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints, J. Inequal. Appl., 2017 (2017), 282. https://doi.org/10.1186/s13660-017-1558-x doi: 10.1186/s13660-017-1558-x
![]() |
[11] | H. J. Wang, H. H. Wang, Optimality conditions and duality theorems for interval-valued optimization problems with vanishing constraints, Oper. Res. Trans., 27 (2023), 87–102. |
[12] |
H. J. Wang, H. H. Wang, Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints, J. Inequal. Appl., 182 (2021). https://doi.org/10.1186/s13660-021-02717-5 doi: 10.1186/s13660-021-02717-5
![]() |
[13] |
D. S. Kim, S. J. Kim, M. H. Kim, Optimality and duality for a class of nondifferentiable multiobjective fractional programming problems, J. Optim. Theory Appl., 129 (2006), 131–146. https://doi.org/10.1007/s10957-006-9048-1 doi: 10.1007/s10957-006-9048-1
![]() |
[14] |
X. J. Long, Optimality conditions and duality for nondifferentiable multiobjective fractional programming problems with (C,α,ρ,d)-convexity, J. Optim. Theory Appl., 148 (2011), 197–208. https://doi.org/10.1007/s10957-010-9740-z doi: 10.1007/s10957-010-9740-z
![]() |
[15] |
R. Dubey, S. K. Gupta, M. A. Khan, Optimality and duality results for a nondifferentiable multiobjective fractional programming problem, J. Inequal. Appl., 345 (2015). https://doi.org/10.1186/s13660-015-0876-0 doi: 10.1186/s13660-015-0876-0
![]() |
[16] |
T. D. Chuong, Nondifferentiable fractional semi-infinite multiobjective optimization problems, Oper. Res. Lett., 44 (2016), 260–266. https://doi.org/10.1016/j.orl.2016.02.003 doi: 10.1016/j.orl.2016.02.003
![]() |
[17] |
X. K. Sun, X. Feng, K. L. Teo, Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data, Optim. Lett., 16 (2022), 1457–1476. https://doi.org/10.1007/s11590-021-01785-2 doi: 10.1007/s11590-021-01785-2
![]() |
[18] |
S. T. Van, D. D. Hang, Optimality and duality in nonsmooth multiobjective fractional programming problem with constraints, 4OR-Q. J. Oper. Res., 20 (2022), 105–137. https://doi.org/10.1007/s10288-020-00470-x doi: 10.1007/s10288-020-00470-x
![]() |
[19] | F. H. Clarke, Nonsmooth analysis and optimization, in Proceedings of the International Congress of Mathematicians, 5 (1983), 847–853. https://doi.org/10.1137/1.9781611971309 |