This study aimed to assess the impact of land consolidation projects and climate change on changes in vegetation in the Loess Plateau during 2012–2021. The study also explored the impacts of human activities and climate change on the ecological quality of the Loess Plateau during this period. The spatial and temporal normalized difference combined meteorological monitoring data, project data, and normalized difference vegetation index (NDVI) data that was used to create the vegetation index dataset spanning from 2012–2021. The study discussed and assessed the effectiveness of the project, revealing the following results: 1) A significant increase was observed in the vegetation index of the Loess Plateau region from 2012 to 2021, with an upward trend of 0.0024 per year (P < 0.05). 2) Contributions to changes in vegetation attributed to climatic factors and the anthropogenic factors of the ditch construction project were 82.74 and 17.62%, respectively, with climatic factors dominating and the degree of response of the ditch construction project increasing annually. 3) In the Loess Plateau, climatic variables dominated changes in vegetation. However, land consolidation projects in vegetation factors played a key role in changes in vegetation, and the degree of influence was gradually increasing.
Citation: Hui Kong, Liangyan Yang, Dan Wu, Juan Li, Shenglan Ye. Ditch control and land reclamation promote vegetation recovery in Loess Plateau[J]. Mathematical Biosciences and Engineering, 2024, 21(3): 3784-3797. doi: 10.3934/mbe.2024168
[1] | Koushik Das, Savin Treanţă, Thongchai Botmart . Set-valued minimax programming problems under σ-arcwisely connectivity. AIMS Mathematics, 2023, 8(5): 11238-11258. doi: 10.3934/math.2023569 |
[2] | Javid Iqbal, Imran Ali, Puneet Kumar Arora, Waseem Ali Mir . Set-valued variational inclusion problem with fuzzy mappings involving XOR-operation. AIMS Mathematics, 2021, 6(4): 3288-3304. doi: 10.3934/math.2021197 |
[3] | Na Mi, Juhe Sun, Li Wang, Yu Liu . Alternating direction method for the fixed point problem of set-valued mappings with second-order cone double constraints. AIMS Mathematics, 2023, 8(3): 6389-6406. doi: 10.3934/math.2023323 |
[4] | Adel Lachouri, Naas Adjimi, Mohammad Esmael Samei, Manuel De la Sen . Non-separated inclusion problem via generalized Hilfer and Caputo operators. AIMS Mathematics, 2025, 10(3): 6448-6468. doi: 10.3934/math.2025294 |
[5] | M. E. Elbrolosy . Semi-(E,F)-convexity in complex programming problems. AIMS Mathematics, 2022, 7(6): 11119-11131. doi: 10.3934/math.2022621 |
[6] | Murugesan Manigandan, Kannan Manikandan, Hasanen A. Hammad, Manuel De la Sen . Applying fixed point techniques to solve fractional differential inclusions under new boundary conditions. AIMS Mathematics, 2024, 9(6): 15505-15542. doi: 10.3934/math.2024750 |
[7] | Yuna Oh, Jun Moon . The infinite-dimensional Pontryagin maximum principle for optimal control problems of fractional evolution equations with endpoint state constraints. AIMS Mathematics, 2024, 9(3): 6109-6144. doi: 10.3934/math.2024299 |
[8] | Ziran Yin, Chongyang Liu, Xiaoyu Chen, Jihong Zhang, Jinlong Yuan . A comprehensive characterization of the robust isolated calmness of Ky Fan k-norm regularized convex matrix optimization problems. AIMS Mathematics, 2025, 10(3): 4955-4969. doi: 10.3934/math.2025227 |
[9] | Morris W. Hirsch . Monotone Dynamical Systems with Polyhedral Order Cones and Dense Periodic Points. AIMS Mathematics, 2017, 2(1): 24-27. doi: 10.3934/Math.2017.1.24 |
[10] | Nashat Faried, Sahar Mohamed Ali Abou Bakr, H. Abd El-Ghaffar, S. S. Solieman Almassri . Towards coupled coincidence theorems of generalized admissible types of mappings on partial satisfactory cone metric spaces and some applications. AIMS Mathematics, 2023, 8(4): 8431-8459. doi: 10.3934/math.2023425 |
This study aimed to assess the impact of land consolidation projects and climate change on changes in vegetation in the Loess Plateau during 2012–2021. The study also explored the impacts of human activities and climate change on the ecological quality of the Loess Plateau during this period. The spatial and temporal normalized difference combined meteorological monitoring data, project data, and normalized difference vegetation index (NDVI) data that was used to create the vegetation index dataset spanning from 2012–2021. The study discussed and assessed the effectiveness of the project, revealing the following results: 1) A significant increase was observed in the vegetation index of the Loess Plateau region from 2012 to 2021, with an upward trend of 0.0024 per year (P < 0.05). 2) Contributions to changes in vegetation attributed to climatic factors and the anthropogenic factors of the ditch construction project were 82.74 and 17.62%, respectively, with climatic factors dominating and the degree of response of the ditch construction project increasing annually. 3) In the Loess Plateau, climatic variables dominated changes in vegetation. However, land consolidation projects in vegetation factors played a key role in changes in vegetation, and the degree of influence was gradually increasing.
Since the last decade researchers have been working in the theory of set-valued optimization problems (in short, SVOPs), a new branch of optimization theory. SVOPs include SVMs as constraints and objective functions. It has applications in viability theory, image processing, mathematical economics and engineering. Borwein [8] proposed the idea of cone convexity of SVMs. It has a significant role to obtain conditions of optimality of SVOPs. Different kinds of differentiability of SVMs have been presented. Jahn and Rauh [23] proposed the idea of contingent epidifferentiation of SVMs. They [6] accordingly proposed the idea of cone preinvexity for SVMs. SVFP is a special class of SVOPs. In the year of 1997, Bhatia and Mehra [6] constituted the Lagrangian theorems of duality for the SVFPs. They [7] additionally formulated the results of duality for Geoffrion solutions of efficiency of the SVFPs under cone convexity supposition. In 2013, Gadhi and Jawhar [22] constituted the necessary conditions of optimality of the SVFPs. Bhatia and Garg [5], Kaul and Lyall [26], Suneja and Lalitha [44] Suneja and Gupta [43], and Lee and Ho [32] constituted the conditions of optimality and studied the theorems of duality for fractional programming using extended convexity. Das and Nahak [10,11,12,13,14,15], Das [9], Das and Treanţă [16,17], Das et al. [18], and Treanţă and Das [46] proposed the idea of σ convex SVMs. They consequently constituted the KKT conditions of sufficiency and derived the results of duality of various kinds of SVOPs under contingent epidifferentiation and σ convexity suppositions.
In 1976, Avriel [4] proposed the idea of arcwisely connectivity in optimization theory. By substituting a continuous arc for the line segment that connects two points, it essentially generalizes convexity. In 2003, Fu and Wang [21] and Lalitha et al. [31] proposed the idea of arcwisely connected SVMs which is an elongation of of convex SVMs. Lalitha et al. [31] provided the sufficient condition of optimality for SVOPs via contingent epidifferentiation and cone arcwisely connectivity suppositions. Qiu and Yang [35] derived the connectivity of the set of Henig weakly efficiency of SVOPs in 2012. In 2013, Yu [49] provided the sufficient as well as necessary conditions of optimality for global proper efficiency in vector optimization problem (in short, VOP) under arcwisely connected SVMs. In the year of 2016, Yihong and Min [48] proposed the idea of nearly arcwisely connected SVMs of α-order. They additionally provided the sufficient as well as necessary conditions of optimality of SVOPs. Yu [50] provided the sufficient as well as necessary conditions of optimality for global proper efficiency of VOPs involving arcwisely connected SVMs. In 2018, Peng and Xu [34] proposed the idea of cone subarcwisely connected SVMs. They accordingly constituted the necessary conditions of optimality of second-order for local global proper efficient elements of SVOPs.
Van Su and Hang [47] examined a non-smooth multiobjective fractional programming problem with set, generalized inequality, and equality constraints. For the local weak minimizers, several primary and dual necessary optimality requirements are given in terms of contingent derivatives. An uncertain nonsmooth multiobjective fractional semi-infinite programming problem is established along with certain robust optimality requirements of the Karush-Kuhn-Tucker type in the article by Thuy and Su [45] in the year of 2022. Su and Hang [42] established second-order optimality requirements for a locally Lipschitz multiobjective fractional programming problem with inequality constraints for a second-order strict and weak local Pareto minimum. In this scenario, second-order differentiability is not a requirement at all. But using a contingent epidifferentiation premise, we establish the KKT conditions of sufficiency for the SVFP in this study. Therefore, under the assumption of cone arcwise connection, we give the duals of parametric, Mond-Weir, Wolfe and mixed kinds and prove the accompanying strong, weak, and converse theorems of duality.
In the study by Agarwal et al. [1] in 2023, fuzzy-valued fractional optimization problems were given KKT optimality requirements. The Dinkelbach algorithm, Lagrange multipliers, and α-cuts were used to build the solution notion. In order to solve the stochastic fuzzy multi-level multi-objective fractional decision making problem (ML-MOFDM), El Sayed et al. [38] introduced a novel modified technique for order preference by similarity to ideal solution (M-TOPSIS). In the year of 2022, El Sayed et al. [39] used a bi-level multi-objective supply chain model that is interactive (BL-MOSCM). A modified Hungarian method-based algorithm for identifying the best fuzzy AP solution was presented by Elsisy et al. [20]. The solution to the fully intuitionistic fuzzy multi-objective fractional transportation problem was illustrated in the work (FIF-MOFTP) by El Sayed and Abo-Sinna [37] in 2021. In the work by Elsisy et al. [19], a new algorithm for the bi-level multi-objective rough nonlinear programming problem was discussed (BL-MRNPP). For other connected ideas, see [27,28,29,30].
This paper is structured as follows. We clarify a few terms and introduce some basic ideas in Section 2 of the set-valued optimization theory. In Section 3, we determine the sufficient conditions of optimality for weak efficiency of the SVFPs under extended cone arcwisely connectivity supposition. We additionally formulate the results of duality of parametric (PD), Mond-Weir (MWD), Wolfe (WD), and mixed (MD) kinds in this section.
Let β be a real normed space (in short, RNS) and Q be a nonvoid subset of β. Then Q is referred to as a cone if ξq∈Q, for every q∈Q and ξ≥0. Furthermore, the cone Q is referred to as pointed if Q∩(−Q)={0β}, solid if int(Q)≠∅, closed if ¯Q=Q, and convex if
ξQ+(1−ξ)Q⊆Q,∀ξ∈[0,1], |
where int(Q) and ¯Q represent the interior and closure of Q, respectively and 0β is the zero element of β.
The positive orthant Rj+ of Rj, specified by
Rj+={q=(q1,...,qj)∈Rj:qi≥0,∀i=1,...,j}, |
is a pointed solid closed convex cone of Rj.
Let Q be a solid pointed convex cone in β. There are two types of cone-orderings in β w.r.t. Q. For any two elements q1,q2∈β, we have
q1≤q2ifq2−q1∈Q |
and
q1<q2ifq2−q1∈int(Q). |
The following notions of minimality are mainly used w.r.t. a solid pointed convex cone Q in a RNS β.
Definition 1. Let ˜β be a nonempty subset of a RNS β. Then ideal minimal, minimal, and weakly minimal points of ˜β are defined as
(i)q′∈˜β is an ideal minimal point of ˜β if q′≤q, for all q∈˜β.
(ii)q′∈˜β is a minimal point of ˜β if there is no q∈˜β∖{q′}, such that q≤q′.
(iii)q′∈˜β is a weakly minimal point of ˜β if there is no q∈˜β, such that q<q′.
The sets of ideal minimal points, minimal points, and weakly minimal points of ˜β are denoted by I-min(˜β), min(˜β), and w-min(˜β) respectively.
The following theorem characterizes contingent epiderivative of set-valued maps.
Theorem 1. [36] Let π:α→2β be a set-valued map and (p′,q′)∈grp(π). Then the contingent epiderivative →Δπ(p′,q′) of π at (p′,q′) exists if and only if the ideal minimal point of the set
{q∈β:(p,q)∈η(epigrp(π),(p′,q′)))} |
exists, for all p∈Π, where Π is the projection of η(epigrp(π),(p′,q′)) onto α. Since Q is a pointed cone, the ideal minimal point of the set
{q∈β:(u,v)∈η(epigrp(π),(p′,q′))}, |
if it exists, is unique, for all p∈Π. In this case, the contingent epiderivative →Δπ(p′,q′) is given by
→Δπ(p′,q′)(p)=I-min{q∈β:(p,q)∈η(epigrp(π),(p′,q′))},∀u∈Π. |
Aubin [2,3] proposed the idea of contingent cone in RNSs.
Definition 2. [2,3] Let N be a nonvoid subset of a RNS β and q′∈¯N. Then, the contingent cone to N at q′, denoted by η(N,q′), is interpreted as:
q∈η(N,q′) if there exist sequences {ξn} in R, together with ξn→0+ and {qn} in β, together with qn→q, satisfying
q′+ξnqn∈N,∀n∈N, |
or, there exist sequences {νn} in R, together with νn>0 and {q′n} in N, together with q′n→q′, satisfying
νn(q′n−q′)→q,asn→∞. |
Let α, β be RNSs, 2β be the set of all subsets of β, and Q be a pointed solid convex cone in β. Let π:α→2β be a SVM from α to β, i.e., π(p)⊆β, for every p∈α. The domain, graph, and epigraph of π are interpreted by
domain(π)={p∈α:π(p)≠∅}, |
grp(π)={(p,q)∈α×β:q∈π(p)}, |
and
epigrp(π)={(p,q)∈α×β:q∈π(p)+Q}. |
In 1997, Jahn and Rauh [23] proposed the idea of contingent epidifferentiation of SVMs.
Definition 3. [23] A function →Δπ(p′,q′):α→β whose epigraph is identical with the contingent cone to the epigraph of π at (p′,q′), i.e.,
epigrp(→Δπ(p′,q′))=η(epigrp(π),(p′,q′)), |
is presumed to be the contingent epidifferentiation of π at (p′,q′).
Borwein [8] proposed the idea of cone convexity of SVMs.
Definition 4. [8] Let M be a nonvoid convex subset of a RNS α. A SVM π:α→2β, together with M⊆domain(π), is referred to as Q-convex on M if ∀p1,p2∈M and ξ∈[0,1],
ξπ(p1)+(1−ξ)π(p2)⊆π(ξp1+(1−ξ)p2)+Q. |
Let α be a RNS and M be a nonvoid subset of α. Let π:α→2Rj, ω:α→2Rj, and ψ:α→2Rl be SVMs, together with
M⊆domain(π)∩domain(ω)∩domain(ψ). |
Everywhere in the paper, we represent
0Rj=(0,...,0)∈Rj |
and
1Rj=(1,...,1)∈Rj. |
Let π=(π1,π2,...,πj), ω=(ω1,ω2,...,ωj), and ψ=(ψ1,ψ2,...,ψl), where the SVMs πi:α→2R, ωi:α→2R, i=1,2,...,j, and ψn:α→2R, n=1,2,...,l, are interpreted by:
domain(πi)=domain(π),domain(ωi)=domain(ω)anddomain(ψn)=domain(ψ), |
p∈M,y=(q1,q2,...,qj)∈π(p)⟺qi∈πi(p),∀i=1,2,...,j, |
r=(r1,r2,...,rj)∈ω(p)⟺ri∈ωi(p),∀i=1,2,...,j, |
and
w=(w1,w2,...,wl)∈ψ(p)⟺wn∈ψn(p),∀n=1,2,...,l. |
Take into account that πi(p)⊆R+ and ωi(p)⊆int(R+),∀i=1,2,...,j and p∈M. Let ξ′=(ξ′1,ξ′2,...,ξ′j)∈Rj+. Define qr∈Rj and ξ′r∈Rj by:
qr=(q1r1,q2r2,...,qjrj) |
and
ξ′r=(ξ′1r1,ξ′1r2,...,ξ′jrj). |
For p∈M, clarify the subset π(p)ω(p) of Rj by:
π(p)ω(p)={qr=(q1r1,q2r2,...,qjrj):qi∈πi(p),ri∈ωi(p),i=1,2,...,j}. |
We assume the SVFP (FP).
minimize p∈Mπ(p)ω(p)=(π1(p)ω1(p),π2(p)ω2(p),...,πj(p)ωj(p))s. t., ψ(p)∩(−Rl+)≠∅. | (FP) |
The set of feasibility of (FP) can be categorized as
S={p∈M:ψ(p)∩(−Rl+)≠∅}. |
Definition 5. A point (p′,q′r′)∈α×Rj, together with p′∈S, q′∈π(p′), and r′∈ω(p′), is referred to as to minimize the problem (FP) if there exist no p∈S, q∈π(p), and r∈ω(p) satisfying
qr−q′r′∈−Rj+∖{0Rj}. |
Definition 6. A point (p′,q′r′)∈α×Rj, together with p′∈S, q′∈π(p′), and r′∈ω(p′), is referred to as to minimize weakly the problem (FP) if there exist no p∈S, q∈π(p), and r∈ω(p) satisfying
qr−q′r′∈−int(Rj+). |
We assume the parametric problem (FPξ′) associated with the SVFP (FP).
minimizep∈Mπ(p)−ξ′ω(p)s. t.,ψ(p)∩(−Rl+)≠∅. | (FPξ′) |
Definition 7. A point (p′,q′−ξ′r′)∈α×Rj, together with p′∈S, q′∈π(p′), and r′∈ω(p′), is referred to as to minimize the problem (FPξ′), if there exist no p∈S, q∈π(p), and r∈ω(p) satisfying
(q−ξ′r)−(q′−ξ′r′)∈−Rj+∖{ 0 Rj}. |
Definition 8. A point (p′,q′−ξ′r′)∈α×Rj, together with p′∈S, q′∈π(p′), and r′∈ω(p′), is referred to as to minimize weakly the problem (FPξ′), if there exist no p∈S, q∈π(p), and r∈ω(p) satisfying
(q−ξ′r)−(q′−ξ′r′)∈−int(Rj+). |
Gadhi and Jawhar [22] demonstrated how the solutions of the problems (FP) and (FPξ′) relate to one another.
Lemma 1. [22] A point (p′,q′r′)∈α×Rj minimizes weakly the problem (FP) if and only if (p′, 0 Rj) minimizes weakly the problem (FPξ′), where ξ′=q′r′.
Avriel [4] proposed the idea of arcwisely connectivity. It is mainly a generalization of convexity.
Definition 9. A subset M of a RNS α is presumed to be an arcwisely connected set if for every p1,p2∈M there exists a continuous arc χp1,p2(ξ) defined on [0,1] with a value in M satisfying χp1,p2(0)=p1 and χp1,p2(1)=p2.
Fu and Wang [21] and Lalitha et al. [31] proposed the idea of arcwisely connected SVMs which is an elongation of the sort of cone convex SVMs.
Definition 10. [21,31] Let M be an arcwisely connected subset of a RNS α and π:α→2β be a SVM, together with M⊆domain(π). Then π is presumed to be Q-arcwisely connected on M if
(1−ξ)π(p1)+ξπ(p2)⊆π(χp1,p2(ξ))+Q,∀p1,p2∈M and ∀ξ∈[0,1]. |
Peng and Xu [34] proposed the idea of cone subarcwisely connected SVMs.
Definition 11. [34] Let M be an arcwisely connected subset of a RNS α, e∈int(Q), and π:α→2β be a SVM, together with M⊆domain(π). Then π is presumed to be Q-subarcwisely connected on M if
(1−ξ)π(p1)+ξπ(p2)+ϵe⊆π(χp1,p2(ξ))+Q,∀p1,p2∈M,∀ϵ>0, and ∀ξ∈[0,1]. |
In this section, we present the notion of σ-arcwisely connectivity of SVMs in the broader sense of arcwisely connected SVMs.
Definition 12. Let M be an arcwisely connected subset of a RNS α, e∈int(Q), and π:α→2β be a SVM, together with M⊆domain(π). Then π is presumed to be σ-Q-arcwisely connected w.r.t. e on M if there exists σ∈R, satisfying
(1−ξ)π(p1)+ξπ(p2)⊆π(χp1,p2(ξ))+σξ(1−ξ)‖p1−p2‖2e+Q,∀p1,p2∈M and ∀ξ∈[0,1]. |
Remark 1. If σ>0, then π is presumed to be strongly σ-Q-arcwisely connected, if σ=0, we get the common concept of Q-arcwisely connectivity, and if σ<0, then π is presumed to be weakly σ-Q-arcwisely connected. Undoubtedly, strongly σ-Q-arcwisely connectivity ⇒Q-arcwisely connectivity ⇒ weakly σ-Q-arcwisely connectivity.
We create a case study of σ-arcwisely connected SVM, which is not necessarily arcwisely connected.
Example 1. Let α=R2,β=R,Q=R+ and
M={p=(p1,p2)|p1+p2≥12,p1≥0,p2≥0}⊆α. |
Define χp,s(ξ)=(1−ξ)u+ξs, where p=(p1,p2),s=(s1,s2) and ξ∈[0,1]. Evidently, M is an arcwisely connected set. For the SVM π:α→2β, defined as follows: π(p)=[0,2],p1+p2≥12,p1≠p2, and π(p)=[3,5] for {p1+p2<12}∪{p1+p2≥12,p1=p2}, we find that π is not Q-arcwisely connected for p=(1,0),s=(0,1) and ξ=12. However, by taking into account σ=−2 and e=[3,3]={3}, we comprehend that π is a σ-Q-arcwisely connected SVM for p=(1,0),s=(0,1).
In the following theorem, we characterize σ-arcwisely connectivity of SVMs in relation to contingent epidifferentiation.
Theorem 2. Let M be an arcwisely connected subset of a RNS α, e∈int(Q), and π:α→2β be σ-Q-arcwisely connected w.r.t. e on M. Let p′∈M and q′∈π(p′). Then,
π(p)−q′⊆→Δπ(p′,q′)(χ′p′,p(0+))+σ‖p−p′‖2e+Q,∀p∈M, |
where
χ′p′,p(0+)=limξ→0+χp′,p(ξ)−χp′,p(0)ξ, |
presuming that χ′p′,p(0+) appears for every p,p′∈M.
Proof. Let p∈M. As π is σ-Q-arcwisely connected w.r.t. e on M,
(1−ξ)π(p′)+ξπ(p)⊆π(χp′,p(ξ))+σξ(1−ξ)‖p−p′‖2e+Q,∀ξ∈[0,1]. |
Let q∈π(p). Choose a sequence {ξn}, together with ξn∈(0,1), n∈N, satisfying ξn→0+ when n→∞. Suppose
pn=χp′,p(ξn) |
and
qn=(1−ξn)q′+ξnq−σξn(1−ξn)‖p−p′‖2e. |
So,
qn∈π(pn)+Q. |
It is undeniable that
pn=χp′,p(ξn)→χp′,p(0)=p′,qn→q′, whenever n→∞, |
pn−p′ξn=χp′,p(ξn)−χp′,p(0)ξn→χ′p′,p(0+), whenever n→∞, |
and
qn−q′ξn=q−q′−σ(1−ξn)‖p−p′‖2e→q−q′−σ‖p−p′‖2e, whenever n→∞. |
So,
(χ′p′,p(0+),q−q′−σ‖p−p′‖2e)∈η(epigrp(π),(p′,q′))=epigrp(→Δπ(p′,q′)). |
Accordingly,
q−q′−σ‖p−p′‖2e∈→Δπ(p′,q′)(χ′p′,p(0+))+Q, |
that is accurate, for every q∈π(p). Hence,
π(p)−q′⊆→Δπ(p′,q′)(χ′p′,p(0+))+σ‖p−p′‖2e+Q,∀p∈M. |
Thus, the theorem is implied.
We determine the sufficient conditions of optimality for the problem (FP) under σ-arcwisely connectivity and contingent epidifferentiation suppositions.
Theorem 3. (Sufficient conditions of optimality) Let M be an arcwisely connected subset of α, p′ be an element of the set of feasibility S of (FP), q′∈π(p′), r′∈ω(p′), ξ′=q′r′, and s′∈ψ(p′)∩(−Rl+). Take into account that π is σ1-Rj+-arcwisely connected w.r.t. 11Rj, −ξ′ω is σ2-Rj+-arcwisely connected w.r.t. 11Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 11Rl, on M. Let π be contingent epidifferentiable at (p′,q′), −ξ′ω be contingent epidifferentiable at (p′,−ξ′r′), and ψ be contingent epidifferentiable at (p′,s′). Presume that there exists (q∗,r∗)∈Rj+×Rl+, together with q∗≠00Rj, and
(σ1+σ2)⟨q∗,11Rj⟩+σ3⟨r∗,11Rl⟩≥0, | (3.1) |
satisfying
⟨q∗,→Δπ(p′,q′)(χ′p′,p(0+))+→Δ(−ξ′ω)(p′,−ξ′r′)(χ′p′,p(0+))⟩+⟨r∗,→Δψ(p′,s′)(χ′p′,p(0+))⟩≥0,∀p∈M, | (3.2) |
q′−ξ′r′=0, | (3.3) |
and
⟨r∗,s′⟩=0. | (3.4) |
Then (p′,q′r′) minimizes weakly the problem (FP).
Proof. Presume that (p′,q′r′) does not minimize the problem (FP). Then there exist p∈S, q∈π(p) and r∈ω(p) satisfying
qr<q′r′. |
As q′−ξ′r′=0, we have
qr<ξ′. |
So,
q−ξ′r<0. |
Hence,
⟨q∗,q−ξ′r⟩<0,since0Rj≠q∗∈Rj+. |
Again, as q′−ξ′r′=0, we have
⟨q∗,q′−ξ′r′⟩=0. |
Since p∈S, there exists an element r∈ψ(p)∩(−Rl+).
Therefore,
⟨r∗,r⟩≤0. |
So,
⟨r∗,s−s′⟩≤0, as ⟨r∗,s′⟩=0. |
Hence,
⟨q∗,q−ξ′r−(q′−ξ′r′)⟩+⟨r∗,s−s′⟩<0. | (3.5) |
As π is σ1-Rj+-arcwisely connected w.r.t. 1Rj, −ξ′ω is σ2-Rj+-arcwisely connected w.r.t. 1Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 1Rl, on M,
π(p)−q′⊆→Δπ(p′,q′)(χ′p′,p(0+))+σ1‖p−p′‖21Rj+Rj+, |
(−ξ′ω)(p)+ξ′r⊆→Δ(−ξ′ω)(p′,−ξ′r′)(χ′p′,p(0+))+σ2‖p−p′‖21Rj+Rj+, |
and
ψ(p)−s′⊆→Δψ(p′,s′)(χ′p′,p(0+))+σ3‖p−p′‖21Rl+Rl+. |
Hence,
q−q′∈→Δπ(p′,q′)(χ′p′,p(0+))+σ1‖p−p′‖21Rj+Rj+, |
−ξ′r+ξ′r′∈→Δ(−ξ′ω)(p′,−ξ′r′)(χ′p′,p(0+))+σ2‖p−p′‖21Rj+Rj+, |
and
s−s′∈→Δψ(p′,s′)(χ′p′,p(0+))+σ3‖p−p′‖21Rl+Rl+. |
So, (3.1) and (3.2) imply that
⟨q∗,q−ξ′r−(q′−ξ′r′)⟩+⟨r∗,s−s′⟩≥0, |
which is in conflict with (3.5). Accordingly, (p′,q′) minimizes weakly the problem (FP).
We can accordingly prove the following theorem by the same approach.
Theorem 4. (Sufficient conditions of optimality) Let M be an arcwisely connected subset of α, p′ be an element of the set of feasibility S of the problem (FP), q′∈π(p′), r′∈ω(p′), and s′∈ψ(p′)∩(−Rl+). Take into account that r′π is σ1-Rj+-arcwisely connected w.r.t. 11Rj, −q′ω is σ2-Rj+-arcwisely connected w.r.t. 11Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 11Rl, on M. Presume that there exists (q∗,r∗)∈Rj+×Rl+, together with q∗≠00Rj, and (3.1) and (3.4) are fulfilled, together with
⟨q∗,→Δ(r′π)(p′,q′r′)(χ′p′,p(0+))+→Δ(−q′ω)(p′,−q′r′)(χ′p′,p(0+))⟩+⟨r∗,→Δψ(p′,s′)(χ′p′,p(0+))⟩≥0,∀p∈M. | (3.6) |
Then (p′,q′r′) minimizes weakly the problem (FP).
We construct the duals of parametric (PD), Mond-Weir (MWD), Wolfe (WD), and mixed (MD) kinds associated with (FP). We consequently explore the related theorems of duality.
We assume the parametric kind dual (PD) connected with the problem (FP).
maximize ξ′,s. t., ⟨q∗,→Δπ(p′,q′)(χ′p′,p(0+))+→Δ(−ξ′ω)(p′,−ξ′r′)(χ′p′,p(0+))⟩+⟨r∗,→Δψ(p′,s′)(χ′p′,p(0+))⟩≥0,∀p∈M,q′i−ξ′ir′i≥0,∀i=1,...,j,p′∈M,q′∈π(p′),r′∈ω(p′),ξ′∈π(p)ω(p),s′∈ψ(p′),q∗∈Rj+,r∗∈Rl+,⟨r∗,s′⟩≥0and⟨q∗,1Rj⟩=1. | (PD) |
A point (p′,q′,r′,ξ′,s′,q∗,r∗) meeting all the requirements of the problem (PD) is referred to as feasible to (PD).
Definition 13. A point (p′,q′,r′,ξ′,s′,q∗,r∗) in the set of feasibility of the problem (PD) is referred to as a weak maximizer of (PD) if there exists no point (p,q,r,ξ,s,q∗1,r∗1) in the set of feasibility of (PD) satisfying
ξ−ξ′∈int(Rj+). |
Theorem 5. (Weak Duality) Let M be an arcwisely connected subset of α, ¯p be an element of the set of feasibility S of the problem (FP), and (p′,q′,r′,ξ′,s′,q∗,r∗) be feasible to the problem (PD). Take into account that π is σ1-Rj+-arcwisely connected w.r.t. 11Rj, −ξ′ω is σ2-Rj+-arcwisely connected w.r.t. 11Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 11Rl, on M, satisfying
(σ1+σ2)+σ3⟨r∗,11Rl⟩≥0. | (3.7) |
Then,
π(¯p)ω(¯p)−ξ′⊆Rj∖−int(Rj+). |
Proof. Presume that for some ¯q∈π(¯p) and ¯r∈ω(¯p),
¯q¯r−ξ′∈−int(Rj+). |
So,
¯q¯r<ξ′. |
Therefore,
¯qi¯ri<ξ′i,∀i=1,...,j. |
So,
¯qi−ξ′i¯ri<0,∀i=1,...,j. |
Therefore,
⟨q∗,¯q−ξ′¯r⟩<0,since0Rj≠q∗∈Rj+. |
From the requirements of (PD),
q′i−ξ′ir′i≥0,∀i=1,...,j. |
So,
⟨q∗,q′−ξ′r′⟩≥0. |
As ¯p∈S, we have
ψ(¯p)∩(−Rl+)≠∅. |
We select ¯s∈ψ(¯p)∩(−Rl+).
So,
⟨r∗,¯s⟩≤0. |
From the requirements of (PD),
⟨r∗,s′⟩≥0. |
So,
⟨r∗,¯s−s′⟩=⟨r∗,¯s⟩−⟨r∗,s′⟩≤0. |
Hence,
⟨q∗,¯q−ξ′¯r−(q′−ξ′r′)⟩+⟨r∗,¯s−s′⟩<0. | (3.8) |
As π is σ1-Rj+-arcwisely connected w.r.t. 1Rj, −ξ′ω is σ2-Rj+-arcwisely connected w.r.t. 1Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 1Rl, on M,
π(¯p)−q′⊆→Δπ(p′,q′)(χ′p′,¯p(0+))+σ1‖¯p−p′‖21Rj+Rj+, |
(−ξ′ω)(¯p)+ξ′r′⊆→Δ(−ξ′ω)(p′,−ξ′r′)(χ′p′,¯p(0+))+σ2‖¯p−p′‖21Rj+Rj+, |
and
ψ(¯p)−s′⊆→Δψ(p′,s′)(χ′p′,¯p(0+))+σ3‖¯p−p′‖21Rl+Rl+. |
Hence,
¯q−q′∈→Δπ(p′,q′)(χ′p′,¯p(0+))+σ1‖¯p−p′‖21Rj+Rj+, |
−ξ′¯r+ξ′r′∈→Δ(−ξ′ω)(p′,−ξ′r′)(χ′p′,¯p(0+))+σ2‖¯p−p′‖21Rj+Rj+, |
and
¯s−s′∈→Δψ(p′,s′)(χ′p′,¯p(0+))+σ3‖¯p−p′‖21Rl+Rl+. |
From the requirements of (PD) and (3.7), we have
⟨q∗,¯q−ξ′¯r−(q′−ξ′r′)⟩+⟨r∗,¯s−s′⟩≥0, |
which is in conflict with (3.8).
So,
¯q¯r−ξ′∉−int(Rj+). |
Since ¯q∈F(¯p) is chosen arbitrarily,
π(¯p)ω(¯p)−ξ′⊆Rj∖−int(Rj+). |
Theorem 6. (Strong Duality) Let (p′,q′r′) minimize weakly the problem (FP) and s′∈ψ(p′)∩(−Rl+). Take into account that for some (q∗,r∗)∈Rj+×Rl+, together with ⟨q∗,1Rj⟩=1 and ξ′∈Rj, (3.2)–(3.4) are fulfilled at (p′,q′,r′,ξ′,s′,q∗,r∗). Then (p′,q′,r′,ξ′,s′,q∗,r∗) is feasible to the problem (PD). Furthermore, If the Theorem 5 between (FP) and (PD) remains, then (p′,q′,r′,ξ′,s′,q∗,r∗) maximizes weakly (PD).
Proof. As the (3.2)–(3.4) are fulfilled at (p′,q′,r′,ξ′,s′,q∗,r∗), we have
⟨q∗,→Δπ(p′,q′)(χ′p′,p(0+))+→Δ(−ξ′ω)(p′,−ξ′r′)(χ′p′,p(0+))⟩+⟨r∗,→Δψ(p′,s′)(χ′p′,p(0+))⟩≥0,∀p∈M, |
q′−ξ′r′=0, |
and
⟨r∗,s′⟩=0. |
So (p′,q′,r′,ξ′,s′,q∗,r∗) is feasible to (PD). Presume that the Theorem 5 between (FP) and (PD) stays and (p′,q′,r′,ξ′,s′,q∗,r∗) does not maximize weakly (PD). Then there exists a point (p,q,r,ξ,s,q∗1,r∗1) in the set of feasibility of (PD) satisfying
ξ−ξ′∈int(Rj+). |
As q′−ξ′r′=0,
ξ−q′r′∈int(Rj+). |
which is in conflict with the Theorem 5 between (FP) and (PD). Accordingly, (p′,q′,r′,ξ′,s′,q∗,r∗) maximizes weakly (PD).
Theorem 7. (Converse Duality) Let M be an arcwisely connected subset of α and (p′,q′,r′,ξ′,s′,q∗,r∗) be feasible to (PD), where ξ′=q′r′. Take into account that π is σ1-Rj+-arcwisely connected w.r.t. 11Rj, −ξ′ω is σ2-Rj+-arcwisely connected w.r.t. 11Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 11Rl, on M, satisfying (3.7). If p′ is an element of the set of feasibility S of (FP), then (p′,q′r′) minimizes weakly the problem (FP).
Proof. Suppose (p′,q′r′) does not minimize the problem (FP). Therefore there exist p∈S, q∈π(p) and r∈ω(p) satisfying
qr<q′r′. |
Since ξ′=q′r′,
qr<ξ′. |
So,
q−ξ′r<0. |
Hence,
⟨q∗,q−ξ′r⟩<0,since0Rj≠q∗∈Rj+. |
From the requirements of (PD),
q′i−ξ′ir′i≥0,∀i=1,...,j. |
Therefore,
⟨q∗,q′−ξ′r′⟩≥0. |
As p∈S, there exists an element
r∈ψ(p)∩(−Rl+). |
Therefore,
⟨r∗,r⟩≤0. |
We have
⟨r∗,s−s′⟩≤0,as⟨r∗,s′⟩=0. |
Hence,
⟨q∗,q−ξ′r−(q′−ξ′r′)⟩+⟨r∗,s−s′⟩<0. | (3.9) |
As π is σ1-Rj+-arcwisely connected w.r.t. 1Rj, −ξ′ω is σ2-Rj+-arcwisely connected w.r.t. 1Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 1Rl, on M,
π(p)−q′⊆→Δπ(p′,q′)(χ′p′,p(0+))+σ1‖p−p′‖21Rj+Rj+, |
(−ξ′ω)(p)+ξ′r⊆→Δ(−ξ′ω)(p′,−ξ′r′)(χ′p′,p(0+))+σ2‖p−p′‖21Rj+Rj+, |
and
ψ(p)−s′⊆→Δψ(p′,s′)(χ′p′,p(0+))+σ3‖p−p′‖21Rl+Rl+. |
Hence,
q−q′∈→Δπ(p′,q′)(χ′p′,p(0+))+σ1‖p−p′‖21Rj+Rj+, |
−ξ′r+ξ′r′∈→Δ(−ξ′ω)(p′,−ξ′r′)(χ′p′,p(0+))+σ2‖p−p′‖21Rj+Rj+, |
and
s−s′∈→Δψ(p′,s′)(χ′p′,p(0+))+σ3‖p−p′‖21Rl+Rl+. |
From the requirements of (PD) and (3.7), we have
⟨q∗,q−ξ′r−(q′−ξ′r′)⟩+⟨r∗,s−s′⟩≥0, |
which is in conflict with (3.9). So, (p′,q′r′) minimizes weakly the problem (FP).
We assume the Mond-Weir kind dual (MWD) connected with the problem (FP).
Maximize q′r′,s. t., ⟨q∗,→Δ(r′π)(p′,q′r′)(χ′p′,p(0+))+→Δ(−q′ω)(p′,−q′r′)(χ′p′,p(0+))⟩+⟨r∗,→Δψ(p′,s′)(χ′p′,p(0+))⟩≥0,∀p∈M,⟨r∗,s′⟩≥0,p′∈M,q′∈π(p′),r′∈ω(p′),s′∈ψ(p′),q∗∈Rj+,r∗∈Rl+and⟨q∗,1Rj⟩=1. | (MWD) |
A point (p′,q′,r′,s′,q∗,r∗) which fulfills all the constraints of (MWD) is referred to as feasible to (MWD).
Definition 14. A point (p′,q′,r′,s′,q∗,r∗) in the set of feasibility of the problem (MWD) is referred to as a weak maximizer of (MWD) if there exists no point (p,q,r,s,q∗1,r∗1) in the set of feasibility of (MWD) satisfying
qr−q′r′∈int(Rj+). |
Theorem 8. (Weak Duality) Let M be an arcwisely connected subset of α, ¯p be an element of the set of feasibility S of the problem (FP), and (p′,q′,r′,s′,q∗,r∗) be feasible to the problem (MWD). Take into account that r′π is σ1-Rj+-arcwisely connected w.r.t. 11Rj, −q′ω is σ2-Rj+-arcwisely connected w.r.t. 11Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 11Rl, on M, satisfying (3.7).
Then,
π(¯p)ω(¯p)−q′r′⊆Rj∖−int(Rj+). |
Proof. Presume that for some ¯q∈π(¯p) and ¯r∈ω(¯p),
¯q¯r−q′r′∈−int(Rj+). |
Therefore,
¯q¯r<q′r′. |
So,
¯qr′−q′¯r<0. |
Hence,
⟨q∗,¯qr′−q′¯r⟩<0,since0Rj≠q∗∈Rj+. |
As ¯p∈S, we have
ψ(¯p)∩(−Rl+)≠∅. |
We select ¯s∈ψ(¯p)∩(−Rl+).
So,
⟨r∗,¯s⟩≤0. |
From the requirements of (MWD), we have
⟨r∗,s′⟩≥0. |
So,
⟨r∗,¯s−s′⟩=⟨r∗,¯s⟩−⟨r∗,s′⟩≤0. |
Hence,
⟨q∗,¯qr′−q′¯r⟩+⟨r∗,¯s−s′⟩<0. | (3.10) |
As r′π is σ1-Rj+-arcwisely connected w.r.t. 1Rj, −q′ω is σ2-Rj+-arcwisely connected w.r.t. 1Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 1Rl, on M,
r′π(¯p)−q′r′⊆→Δπ(p′,q′)(χ′p′,¯p(0+))+σ1‖¯p−p′‖21Rj+Rj+, |
(−q′ω)(¯p)+q′r′⊆→Δ(−q′ω)(p′,−q′r′)(χ′p′,¯p(0+))+σ2‖¯p−p′‖21Rj+,Rj+, |
and
ψ(¯p)−s′⊆→Δψ(p′,s′)(χ′p′,¯p(0+))+σ3‖¯p−p′‖21Rl+Rl+. |
Hence,
¯qr′−q′r′∈→Δ(r′π)(p′,q′r′)(χ′p′,¯p(0+))+σ1‖¯p−p′‖21Rj+Rj+, |
−r′¯r+q′r′∈→Δ(−q′ω)(p′,−q′r′)(χ′p′,¯p(0+))+σ2‖¯p−p′‖21Rj+Rj+, |
and
¯s−s′∈→Δψ(p′,s′)(χ′p′,¯p(0+))+σ3‖¯p−p′‖21Rl+Rl+. |
From the requirements of (MWD) and (3.7),
⟨q∗,¯qr′−q′¯r⟩+⟨r∗,¯s−s′⟩≥0, |
which is in conflict with (3.10).
Therefore,
¯q¯r−q′r′∉−int(Rj+). |
Since ¯q∈F(¯p) is chosen arbitrarily,
π(¯p)ω(¯p)−q′r′⊆Rj∖−int(Rj+). |
Theorem 9. (Strong Duality) Let (p′,q′r′) minimize weakly the problem (FP) and s′∈ψ(p′)∩(−Rl+). Take into account that for some (q∗,r∗)∈Rj+×Rl+, together with ⟨q∗,1Rj⟩=1, (3.4) and (3.6) are fulfilled at (p′,q′,r′,s′,q∗,r∗). Then (p′,q′,r′,s′,q∗,r∗) is feasible to the problem (MWD). Furthermore, If the Theorem 8 between the problems (FP) and (MWD) remains, then (p′,q′,r′,s′,q∗,r∗) maximizes weakly (MWD).
Proof. As (3.4) and (3.6) are fulfilled at (p′,q′,r′,s′,q∗,r∗), we have
⟨q∗,→Δ(r′π)(p′,q′r′)(χ′p′,p(0+))+→Δ(−q′ω)(p′,−q′r′)(χ′p′,p(0+))⟩+⟨r∗,→Δψ(p′,s′)(χ′p′,p(0+))⟩≥0,∀p∈M, |
and
⟨r∗,s′⟩=0. |
So, (p′,q′,r′,s′,q∗,r∗) is feasible to (MWD). Presume that the Theorem 8 between (FP) and (MWD) stays and (p′,q′,r′,s′,q∗,r∗) does not maximize weakly (MWD). Then there exists a point (p,q,r,s,q∗1,r∗1) in the set of feasibility of (MWD) satisfying
q′r′<qr, |
which is in conflict with the Theorem 8 between (FP) and (MWD). Accordingly, (p′,q′,r′,s′,q∗,r∗) maximizes weakly (MWD).
Theorem 10. (Converse Duality) Let M be an arcwisely connected subset of α and (p′,q′,r′,s′,q∗,r∗) be feasible to the problem (MWD). Take into account that r′π is σ1-Rj+-arcwisely connected w.r.t. 11Rj, −q′ω is σ2-Rj+-arcwisely connected w.r.t. 11Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 11Rl, on M, satisfying (3.7). If p′ is an element of the set of feasibility S of the problem (FP), then (p′,q′r′) minimizes weakly the problem (FP).
Proof. Suppose (p′,q′r′) does not minimize the problem (FP). Therefore there exist p∈S, q∈π(p) and r∈ω(p) satisfying
qr<q′r′. |
So,
qr′−q′r<0. |
Therefore,
⟨q∗,qr′−q′r⟩<0,since0Rj≠q∗∈Rj+. |
As p∈S,
ψ(p)∩(−Rl+)≠∅. |
We select r∈ψ(p)∩(−Rl+).
So,
⟨r∗,r⟩≤0. |
From the requirements of (WD),
⟨r∗,s′⟩≥0. |
So,
⟨r∗,s−s′⟩=⟨r∗,r⟩−⟨r∗,s′⟩≤0. |
Hence,
⟨q∗,qr′−q′r⟩+⟨r∗,s−s′⟩<0. | (3.11) |
As r′π is σ1-Rj+-arcwisely connected w.r.t. 1Rj, −q′ω is σ2-Rj+-arcwisely connected w.r.t. 1Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 1Rl, on M,
r′π(p)−q′r′⊆→Δπ(p′,q′)(χ′p′,p(0+))+σ1‖p−p′‖21Rj+Rj+, |
(−q′ω)(p)+q′r′⊆→Δ(−q′ω)(p′,−q′r′)(χ′p′,p(0+))+σ2‖p−p′‖21Rj+Rj+, |
and
ψ(p)−s′⊆→Δψ(p′,s′)(χ′p′,p(0+))+σ3‖p−p′‖21Rl+Rl+. |
Hence,
yz′−q′r′∈→Δ(r′π)(p′,q′r′)(χ′p′,p(0+))+σ1‖p−p′‖21Rj+Rj+, |
−r′z+q′r′∈→Δ(−q′ω)(p′,−q′r′)(χ′p′,p(0+))+σ2‖p−p′‖21Rj+Rj+, |
and
s−s′∈→Δψ(p′,s′)(χ′p′,p(0+))+σ3‖p−p′‖21Rl+Rl+. |
So, from the requirements of (WD) and (3.7),
⟨q∗,qr′−q′r⟩+⟨r∗,s−s′⟩≥0, |
which is in conflict with (3.11). Therefore (p′,q′r′) minimizes weakly (FP).
We assume the Wolfe kind dual (WD) connected with the problem (FP).
Maximize q′+⟨r∗,s′⟩1Rjr′,s. t., ⟨q∗,→Δ(r′π)(p′,q′r′)(χ′p′,p(0+))+→Δ(−q′ω)(p′,−q′r′)(χ′p′,p(0+))⟩+⟨r∗,→Δψ(p′,s′)(χ′p′,p(0+))⟩≥0,∀p∈M,p′∈M,q′∈π(p′),r′∈ω(p′),s′∈ψ(p′),q∗∈Rj+,r∗∈Rl+and⟨q∗,1Rj⟩=1. | (WD) |
A point (p′,q′,r′,s′,q∗,r∗) which fulfills all the constraints of (WD) is referred to as feasible to (WD).
Definition 15. A point (p′,q′,r′,s′,q∗,r∗) in the set of feasibility of the problem (WD) is referred to as a weak maximizer of (WD) if there exists no point (p,q,r,s,q∗1,r∗1) in the set of feasibility of (WD) satisfying
q+⟨r∗1,s⟩11Rjr−q′+⟨r∗,s′⟩11Rjr′∈int(Rj+). |
Theorem 11. (Weak Duality) Let M be an arcwisely connected subset of α, ¯p be an element of the set of feasibility S of the problem (FP) and (p′,q′,r′,s′,q∗,r∗) be feasible to the problem (WD). Take into account that r′π is σ1-Rj+-arcwisely connected w.r.t. 11Rj, −q′ω is σ2-Rj+-arcwisely connected w.r.t. 11Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 11Rl, on M, satisfying (3.7).
Then,
π(¯p)ω(¯p)−q′+⟨r∗,s′⟩11Rjr′⊆Rj∖−int(Rj+). |
Proof. The proof is comparable to that of Theorems 5 and 8. It is therefore omitted.
Theorem 12. (Strong Duality) Let (p′,q′r′) minimize weakly the problem (FP) and s′∈ψ(p′)∩(−Rl+). Take into account that for some (q∗,r∗)∈Rj+×Rl+, together with ⟨q∗,11Rj⟩=1, (3.4) and (3.6) are fulfilled at (p′,q′,r′,s′,q∗,r∗). Then (p′,q′,r′,s′,q∗,r∗) is feasible to the problem (WD). Furthermore, If the Theorem 11 between (FP) and (WD) remains, then (p′,q′,r′,s′,q∗,r∗) maximizes weakly (WD).
Proof. The proof is comparable to that of Theorems 6 and 9. It is therefore omitted.
Theorem 13. (Converse Duality) Let M be an arcwisely connected subset of α, (p′,q′,r′,s′,q∗,r∗) be feasible to the problem (WD) and ⟨r∗,s′⟩≥0. Take into account that r′π is σ1-Rj+-arcwisely connected w.r.t. 11Rj, −q′ω is σ2-Rj+-arcwisely connected w.r.t. 11Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 11Rl, on M, satisfying (3.7). If p′ is an element of the set of feasibility S of the problem (FP), then (p′,q′r′) minimizes weakly the problem (FP).
Proof. The proof is comparable to that of Theorems 7 and 10. It is therefore omitted.
We assume the mixed kind dual (MD) connected with the problem (FP).
maximize q′+⟨r∗,s′⟩1Rjr′,s. t., ⟨q∗,→Δ(r′π)(p′,q′r′)(χ′p′,p(0+))+→Δ(−q′ω)(p′,−q′r′)(χ′p′,p(0+))⟩+⟨r∗,→Δψ(p′,s′)(χ′p′,p(0+))⟩≥0,∀p∈M,⟨r∗,s′⟩≥0,p′∈M,q′∈π(p′),r′∈ω(p′),s′∈ψ(p′),q∗∈Rj+,r∗∈Rl+and⟨q∗,1Rj⟩=1. | (MD) |
A point (p′,q′,r′,s′,q∗,r∗) meeting all the requirements of the problem (MD) is referred to as feasible to (MD).
Definition 16. A point (p′,q′,r′,s′,q∗,r∗) in the set of feasibility of the problem (MD) is referred to as a weak maximizer of (MD) if there exists no point (p,q,r,s,q∗1,r∗1) in the set of feasibility of (MD) satisfying
q+⟨r∗1,s⟩11Rjr−q′+⟨r∗,s′⟩11Rjr′∈int(Rj+). |
Theorem 14. (Weak Duality) Let M be an arcwisely connected subset of α, ¯p be an element of the set of feasibility S of the problem (FP) and (p′,q′,r′,s′,q∗,r∗) be feasible to the problem (MD). Take into account that r′π is σ1-Rj+-arcwisely connected w.r.t. 11Rj, −q′ω is σ2-Rj+-arcwisely connected w.r.t. 11Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 11Rl, on M, satisfying (3.7).
Then,
π(¯p)ω(¯p)−q′+⟨r∗,s′⟩11Rjr′⊆Rj∖−int(Rj+). |
Proof. The proof is comparable to that of Theorems 5 and 8. It is therefore omitted.
Theorem 15. (Strong Duality) Let (p′,q′r′) minimize weakly the problem (FP) and s′∈ψ(p′)∩(−Rl+). Take into account that for some (q∗,r∗)∈Rj+×Rl+, together with ⟨q∗,11Rj⟩=1, (3.4) and (3.6) are fulfilled at (p′,q′,r′,s′,q∗,r∗). Then (p′,q′,r′,s′,q∗,r∗) is feasible to the problem (MD). Furthermore, If the Theorem 14 between (FP) and (MD) remains, then (p′,q′,r′,s′,q∗,r∗) maximizes weakly (MD).
Proof. The proof is comparable to that of Theorems 6 and 9. It is therefore omitted.
Theorem 16. (Converse Duality) Let M be an arcwisely connected subset of α and (p′,q′,r′,s′,q∗,r∗) be feasible to the problem (MD). Take into account that r′π is σ1-Rj+-arcwisely connected w.r.t. 11Rj, −q′ω is σ2-Rj+-arcwisely connected w.r.t. 11Rj, and ψ is σ3-Rl+-arcwisely connected w.r.t. 11Rl, on M, satisfying (3.7). If p′ is an element of the set of feasibility S of the problem (FP), then (p′,q′r′) minimizes weakly the problem (FP).
Proof. The proof is comparable to that of Theorems 7 and 10. It is therefore omitted.
To clarify the conclusions, we have included the following example.
Example 2. Let α=R2 and M={(t,0):t∈[−1,1]}⊆R2. Let p=(p1,p2)∈R2 and p′=(p′1,p′2)∈R2. Let us consider a continuous arc χp′,p:[0,1]→R2 defined by
χp′,p(ξ)=(1−ξ2)p′+ξ2p,∀ξ∈[0,1]. |
Clearly, M is an arcwisely connected subset of α. Now,
χ′p′,p(0+)=limξ→0+χp′,p(ξ)−χp′,p(0)ξ=(0,0). |
We consider three set-valued maps π:M⊆R2→2R2, ω:M⊆R2→2R2, and ψ:M⊆R2→2R, with domain(π)=domain(ω)=domain(ψ)=M, defined by
π(t,0)={{(x−10t2,x2−10t2):x≥0},if0≤t≤1,{(x−10t2,x−10t2):x<0},if−1≤t<0, |
ω(t,0)=(1,1),∀t∈[−1,1], |
and
ψ(t,0)={{x2+11t2:x≥0},if0≤t≤1,{x+11t2:x>0},if−1≤t<0. |
We can show that π is (−10)-R2+-arcwisely connected w.r.t. (1,1), −ξ′ω is 0-R2+-arcwisely connected w.r.t. (1,1) for any ξ′∈R2, and ψ is 11-R+-arcwisely connected w.r.t. 1 on A. So σ1=−10, σ2=0, and σ3=11. Now, we have
epigrp(π)={(u,v)∈R2×R2:u∈A,v∈π(u)+R2+}={((t,0),(v1,v2)):u=(t,0),v=(v1,v2),t∈[−1,1],v∈π(u)+R2+}={((t,0),(v1,v2)):0≤t≤1,v1≥x−10t2,v2≥x2−10t2,x≥0}∪{((t,0),(v1,v2)):−1≤t<0,v1≥x−10t2,v2≥x−10t2,x<0}. |
Therefore,
η(epigrp(π),((t′,0),(v′1,v′2)))={R+×{0}×R+×R+,ift′=0,v′1=v′2=0,R×{0}×R×R,otherwise. |
It is obvious that I-min{(v1,v2):((t,0),(v1,v2))∈η(epigrp(π),((t′,0),(v′1,v′2)))} exists for 0≤t≤1 if and only if t′=0,v′1=0, and v′2=0. Clearly,
I-min{(v1,v2):((t,0),(v1,v2))∈η(epigrp(π),((0,0),(0,0)))}={(0,0)},for0≤t≤1. |
Now, we have
→Δπ((0,0),(0,0))(t,0)=I-min{(v1,v2):((t,0),(v1,v2))∈η(epigrp(π),((0,0),(0,0)))}. |
So, π is contingent epidifferentiable only at ((0,0),(0,0)) with
→Δπ((0,0),(0,0))(t,0)={(0,0)},∀t, with 0≤t≤1. |
Similarly, we can show that ω is contingent epidifferentiable everywhere on M and ψ is contingent epidifferentiable only at ((0,0),0) with
→Δψ((0,0),0)(t,0)={0},∀t, with 0≤t≤1. |
Let p′=(0,0), q′=(0,0)∈π(p′), r′=(1,1)∈ω(p′), and s′=0∈ψ(p′)∩(−R+). So, ξ′=q′r′=(0,0). The feasible set of the problem (FP) is S={(t,0):ψ(t,0)∩(−R+)≠∅}={(0,0)}. Therefore, (p′,q′r′)=((0,0),(0,0)) minimizes weakly the problem (FP).
Now, we have
→Δπ(p′,q′)(χ′p′,p(0+))=→Δπ(p′,q′)(0,0)=(0,0), |
→Δ(−ξ′ω)(p′,−ξ′r′)(χ′p′,p(0+))=→Δ(−ξ′ω)(p′,−ξ′r′)(0,0)=(0,0), |
and
→Δψ(p′,s′)(χ′p′,p(0+))=→Δψ(p′,s′)(0,0)=0. |
It is clear that for q∗=(12,12) and r∗=1, the sufficient optimality conditions (3.1)–(3.4) are satisfied and ⟨q∗,(1,1)⟩=1. So (p′,q′,r′,s′,q∗,r∗) is feasible to the (MWD). Again, (σ1+σ2)⟨q∗,(1,1)⟩+σ3⟨r∗,1⟩=1≥0. Hence the weak duality Theorem 7 holds between (FP) and (MWD). We prove that (p′,q′,r′,s′,q∗,r∗) maximizes weakly (MWD). Let any point feasible to the Mond-Weir type dual (MWD) be (p,q,r,s,q∗1,r∗1) where p∈M,q∈π(p),r∈ψ(p),s∈ψ(p)∩(−R+),q∗1∈R2+,r∗1∈R+, and ⟨q∗1,(1,1)⟩=1. Since π and ψ are contingent epidifferentiable only at ((0,0),(0,0)) and the conditions of the Mond-Weir type dual (MWD) are satisfied at the point (p,q,r,s,q∗1,r∗1), we have p=(0,0), q=(0,0), r=(1,1), and s=0. Hence (p′,q′,r′,s′,q∗,r∗), with p′=(0,0), q′=(0,0), r′=(1,1), and s′=0, maximizes weakly the problem (MWD). Hence Theorem 8 is satisfied. Similarly, we can verify the weak, strong, and converse duality results for parametric (PD), Wolfe (WD), and mixed (MD) kinds for the problem (FP).
In this paper, we determine the KKT conditions of sufficiency for the SVFP (FP) via contingent epidifferentiation supposition. We accordingly present the duals of parametric (PD), Mond-Weir (MWD), Wolfe (WD), and mixed (MD) kinds and derive the associated strong, weak, and converse theorems of duality under cone arcwisely connectivity supposition.
The authors declare no conflict of interest.
[1] |
F. Ji, D. Han, L. Yan, S. Yan, J. Zha, J. Shen, Assessment of benthic invertebrate diversity and river ecological status along an urbanized gradient using environmental DNA metabarcoding and a traditional survey method, Sci. Total Environ., 806 (2022), 150587. https://doi.org/10.1016/j.scitotenv.2021.150587 doi: 10.1016/j.scitotenv.2021.150587
![]() |
[2] |
X. Yao, Y. Cao, G. Zheng, A. T. Devlin, J. S. Khim, Use of life cycle assessment and water quality analysis to evaluate the environmental impacts of the bioremediation of polluted water. Sci. Total Environ., 761 (2021), 143260. https://doi.org/10.1016/j.scitotenv.2020.143260 doi: 10.1016/j.scitotenv.2020.143260
![]() |
[3] |
R. Pascual-Rico, Z. Morales-Reyes, N. Aguilera-Alcalá, A. Olszańska, E. Sebastián-González, R. Naidoo, et al., Usually hated, sometimes loved: A review of wild ungulates' contributions to people, Sci. Total Environ., 801 (2021), 149652. https://doi.org/10.1016/j.scitotenv.2021.149652 doi: 10.1016/j.scitotenv.2021.149652
![]() |
[4] |
H. Liu, G. Liu, W. Xing, Functional traits of submerged macrophytes in eutrophic shallow lakes affect their ecological functions, Sci. Total Environ., 760 (2021), 143332. https://doi.org/10.1016/j.scitotenv.2020.143332 doi: 10.1016/j.scitotenv.2020.143332
![]() |
[5] |
Z. Q. Gao, J. Y. Liu, D. F. Zhuang, The relations analysis between ecological environmental quality of Chinese land resources and population, Can. J. Remote Sens., 1 (1999), 66–70. https://doi.org/10.11834/jrs.19990110 doi: 10.11834/jrs.19990110
![]() |
[6] |
D. Jarvis, N. Stoeckl, S. Larson, D. Grainger, J. Addison, A. Larson, The learning generated through indigenous natural resources management programs increases quality of life for indigenous people–improving numerous contributors to Wellbeing, Ecol. Econ., 180 (2021), 106899. https://doi.org/10.1016/J.ECOLECON.2020.106899 doi: 10.1016/J.ECOLECON.2020.106899
![]() |
[7] |
P. Huang, C. Ma, A. Zhou, Assessment of groundwater sustainable development considering geo-environment stability and ecological environment: a case study in the Pearl River Delta, China, Environ. Sci. Pollut. R, 29 (2021), 18010–18035. https://doi.org/10.1007/s11356-021-16924-6 doi: 10.1007/s11356-021-16924-6
![]() |
[8] |
N. Chai, X. Yi, J. Xiao, T. Liu, Y. Liu, L. Deng, Spatiotemporal variations, sources, water quality and health risk assessment of trace elements in the Fen River, Sci. Total Environ., 757 (2021), 143882. https://doi.org/ 10.1016/j.scitotenv.2020.143882 doi: 10.1016/j.scitotenv.2020.143882
![]() |
[9] |
T. Zhai, J. Wang, Y. Fang, Y. Qin, L. Huang, Y. Chen, Assessing ecological risks caused by human activities in rapid urbanization coastal areas: Towards an integrated approach to determining key areas of terrestrial-oceanic ecosystems preservation and restoration, Sci. Total Environ., 708 (2020), 135153. https://doi.org/10.1016/j.scitotenv.2019.135153 doi: 10.1016/j.scitotenv.2019.135153
![]() |
[10] |
F. Shi, S. Liu, Y. Sun, Y. An, S. Zhao, Y. Liu, et al., Ecological network construction of the heterogeneous agro-pastoral areas in the upper Yellow River basin, Agr. Ecosyst. Environ., 302 (2020), 107069. https://doi.org/10.1016/j.agee.2020.107069 doi: 10.1016/j.agee.2020.107069
![]() |
[11] |
J. Li, Study on the impact of seashore leisure behavior on ecological environment based on water quality analysis, J. Coastal. Res., 115 (2020), 193. https://doi.org/10.2112/JCR-SI115-060.1 doi: 10.2112/JCR-SI115-060.1
![]() |
[12] |
M. Höglind, D. Cameron, T. Persson, X. Huang, M. V. Oijen, BASGRA_N: A model for grassland productivity, quality and greenhouse gas balance, Ecol. Model., 417 (2020), https://doi.org/10.1016/j.ecolmodel.2019.108925 doi: 10.1016/j.ecolmodel.2019.108925
![]() |
[13] |
Y. X. Gao, Study on water resources carrying capacity of ChangjiArea based on water quality-ecological system, Ground Water, 26 (2019) 11000–11011, https://doi.org/10.1007/s11356-019-04414-9 doi: 10.1007/s11356-019-04414-9
![]() |
[14] |
G. Sun, S. J. Hoff, B. C. Zelle, M. A. Nelson, Forecasting daily source air quality using multivariate statistical analysis and radial basis function networks, J. Air Waste Manage., 58 (2019), 1571–1578. https://doi.org/10.3155/1047-3289.58.12.1571 doi: 10.3155/1047-3289.58.12.1571
![]() |
[15] |
L. C. Evans, R. M. Sibly, P. Thorbek, I. Sims, T. H. Oliver, R. J. Walters, Quantifying the effectiveness of agri-environment schemes for a grassland butterfly using individual-based models, Ecol. Model., 411 (2019), 108798. https://doi.org/10.1016/j.ecolmodel.2019.108798 doi: 10.1016/j.ecolmodel.2019.108798
![]() |
[16] |
S. R. Corsi, L. A. De Cicco, D. L. Villeneuve, B. R. Blackwell, K. A. Fay, G. T. Ankley, et al., Prioritizing chemicals of ecological concern in Great Lakes tributaries using high-throughput screening data and adverse outcome pathways, Sci. Total Environ., 686 (2019), 995–1009. https://doi.org/10.1016/j.scitotenv.2019.05.457 doi: 10.1016/j.scitotenv.2019.05.457
![]() |
[17] |
D. Saadoud, M. Hassani, F. J. M. Peinado, M. S. Guettouche, Application of fuzzy logic approach for wind erosion hazard mapping in Laghouat region (Algeria) using remote sensing and GIS, Aeolian Res., 32 (2018), 762–781. https://doi.org/10.3390/sym11060762 doi: 10.3390/sym11060762
![]() |
1. |
Koushik Das, Chandal Nahak,
Sufficiency and duality for set-valued optimization problems with κ -cone arcwise connectedness of higher-order,
2025,
0030-3887,
10.1007/s12597-025-00922-0
|
|
2. | Bhuwan Chandra Joshi, Murari Kumar Roy, Savin Treanţă, Cristina-Mihaela Cebuc, On some nonsmooth equilibrium constrained minimization models using epiderivative, 2025, 59, 0399-0559, 1665, 10.1051/ro/2025062 |