Abstract
In this research, we investigate a novel class of granular type optimality guidelines for the fuzzy multi-objective optimizations based on guidelines of vector granular convexity and granular differentiability. Firstly, the concepts of vector granular convexity is introduced to the vector fuzzy-valued function. Secondly, several properties of vector granular convex fuzzy-valued functions are provided. Thirdly, the granular type Karush-Kuhn-Tucker(KKT) optimality guidelines are derived for the fuzzy multi-objective optimizations.
1. Introduction
The optimality guidelines can be used to identify the possible candidates for optimal solutions, which plays a significant effect in the field of optimization principle and has been researched for more than a century. However, since the data utilized in real-world issues sometimes include uncertain or inaccurate data due to measurement mistakes or other unforeseen factors, fuzzy optimization model is often used to deal with this actual optimization problem containing fuzzy data.
In the past two decades, many results have been achieved in the research of optimality guidelines for the fuzzy optimizations. As we all know, the comparison of fuzzy numbers is often in partial order, so the resulting fuzzy difference and the derivative of the fuzzy function are not as simple as the difference of the real function and the definition of the derivative. Differentiability and convexity are two important conditions that are indispensable in the research of optimality guidelines of fuzzy optimization. For example, under the Hukuhara difference and Hukuhara differentiability, the notion of convexity for real-valued functions has been extended by Wu to LU-convexity for fuzzy-valued functions.The KKT guidelines [1,2,3,4] for an optimization problem with a fuzzy-valued objective function based on the premise of LU-convexity were then created. By using generalized Hukuhara difference and generalized Hukuhara differentiability, Chalco-Cano et al. [5,6,7] researched the optimality guidelines for the fuzzy optimizations. Zhang, Liu and Li researched the optimality guidelines for the fuzzy optimizations based on the assumptions of univexity [8] and invexity [9].
However, the Hukuhara differentiability or generalized Hukuhara differentiability of the fuzzy optimizations have some disadvantages [10,11]. Recently, Mazandarani et al. [11] have introduced the notion of a new fuzzy function differentiation as granular differentiability (gr-differentiability). This result has brought many new results in the field of fuzzy dynamic systems [12,13,14,15] and fuzzy differential equations [16,17,18,19]. Compared with generalized Hukuhara differential, a very important advantage of gr-differential is that it is relatively simple in calculation. Zhang et al. [20] proposed the granular convexity for fuzzy functions and researched the optimality guidelines for the fuzzy optimizations. However, there are three essential differences between [20] and this article. Firstly, the object of study is different from that of this paper. The fuzzy single-objective optimisation problem is studied in [20], while the fuzzy multi-objective optimisation problem is studied in this paper. The objective value for fuzzy single-objective optimization is the fuzzy number, while the objective value for fuzzy multi-objective optimization is the fuzzy vector. Secondly, the concept of solution is different. The solution in [20] is the optimal solution, while the solution in this paper is the efficient solution. Thirdly, the convexity condition is different. The condition of granular convexity of fuzzy function is studied in the [20], but this paper is the condition of vector convexity of fuzzy function. For multi-objective fuzzy optimizations [21,22], the computational complexity brought by Hukuhara or generalized Hukuhara differentiation are particularly obvious.
Convexity is one of the important basic assumptions in the study of optimality conditions. For the proof of the validity of convexity, Kalsoom [23] have proved some new Ostrowsk’s type inequalities for q-differentiable preinvex functions by using the newly offered identity. Butt [24] gave some new results by using convexity of exponential s-convex functions of any positive integer order differentiable function. Kızıl [25] obtained new results for strongly convex functions with the help of Atangana-Baleanu integral operators. Ekinci [26] obtained new inequalities for the class of functions whose absolute values of first derivatives are convex on [a, b].
The purposes of this paper is to propose the optimality guidelines to fuzzy multi-objective optimizations under the conditions of vector granular convexity and granular differentiability. Firstly, we present the concepts of vector granular convexity for a fuzzy function. Secondly, we present the attributes for the vector granular convexity for a fuzzy function. Thirdly, we recommend the optimality guidelines for the fuzzy multi-objective optimization issue based on the assumptions of vector granular convexity and granular differentiability. Several examples are given to motivate our studies.
2. Preliminaries
This section covers some fundamental notions and arithmetics of fuzzy-valued functions. The abbreviations used in this paper are collected in Table 1.
Table 1.
The abbreviations have been used in this paper.
2.1. Some Notions of the Fuzzy-Valued Functions
Assume that is the dimensional Euclidean space, and E is the space representing all fuzzy numbers(FNs) on R. The parametric form can be expressed as . The horizontal membership function(HMF) [27] of is denoted by For simplicity, can be abbreviated to , otherwise it would be too long. For a triangular FN , The trapezoidal FN , the HMF is , for
There are two FNs and . Then, for all , and ; for all , and .
Remark 1
([18]). The HMF is a linear map. The following guidelines are met for any , and any constant ,
(1)
(2)
Definition 1
([11]). The following is the definition of the granular distance between and in E.
Assume that is a fuzzy function with n distinct parameters The HMF of is where .
Definition 2
([11]). The fuzzy function is regarded as granular-differentiable (gr-differentiable) at if there exists an element such that the following limit,
exists for adequately value close to 0. is regarded as gr-derivative of at . If the gr-derivative exists for the is gr-differentiable on The space of fuzzy-valued functions of all constantly gr-differentiable on is defined as .
Theorem 1
([11]). The fuzzy-valued function is gr-differentiable at at that point its HMF is differentiable with reference to ζ. Furthermore,
A multivariate fuzzy function’s partial derivative is defined by Zhang et al. [20]. Assume , , and which with n distinct FNs , . We denote that , with respect to the distinct FNs , , and .
Definition 3
([20]). Assume that is a fixed element and be a fuzzy function. The has the ith partial gr-derivative at if is gr-differentiable at , denoted by and , where .
is gr-differentiable at , if all the partial gr-derivative , ⋯, exist on some neighborhood of and are consecutive at .
Definition 4
([20]). We say that
is the granular gradient of at , where is the jth partial gr-derivative of at .
From Definition 1, the fuzzy functions’ distance measure is defined as follows:
Definition 5.
It is assumed that , are two fuzzy-valued functions. The distance measure between and can be defined by
where and with respect to the distinct FNs and and .
At present, we cope with fuzzy vector mapping For , with respect to the different FNs , , and , each is a fuzzy function. The HMF of is , where and .
Definition 6.
Consider a fuzzy vector mapping It can be said by us that is vector gr-differentiable at is gr-differentiable at for all
2.2. Solution Concepts
Firstly, we review the comparison of two real vectors. If , then
(i) for all
(ii) for all
(iii) for all
(iv) and .
Based on the partial order relations on , we also define the comparison of two fuzzy vectors.
Definition 7.
Let , then
(i) for all ;
(ii) for all ;
(iii) for all ;
(iv) for all and .
We can get the follows proposition for the fuzzy vector function.
Proposition 1.
Assume a fuzzy vector mapping and with respect to distinct FNs , , and . Then, we have
(i) ;
(ii) ;
(iii) ;
(iv) and ;
Proof.
It is easy to be proved by Remark 1 and Definition 7. □
It is considered by us that the following two classes of gr-differentiable fuzzy multi-objective programming problems:
where are (consecutively) gr-differentiable fuzzy functions, and K is a open subset which is nonempty of
The constrained gr-differentiable fuzzy multi-objective programming problem,
where are (consecutively) gr-differentiable fuzzy functions, and K is a open subset which is nonempty of It is denoted by us that as the feasible set of (FCMOP), as the set of indices of active constraints at .
We’ll employ the notions of efficient solutions (ES) and weakly efficient solutions (WES) of (FMOP), which were brought in by [10].
Definition 8
([22]). Assume that is a p-dimensional fuzzy function. Reputedly, a point is:
(1) a strongly ES if there exists no such that ;
(2) an ES if there exists no such that and such that ;
(3) a mildly WES if there exists no such that ;
(4) a WES if there exists no such that .
Osuna-Gómez et al. have discussed the relationship between the above solutions, one can refer to [21,22].
3. Vector Granular Convexity of Fuzzy Vector Functions
The notion of convexity is crucial in optimization theory. Recently, the notion of convexity has been developed in a number of fields using new and imaginative approaches. Based on the HMF of fuzzy vector functions, we define the notion of vector granular convexity for fuzzy vector functions and suggest several aspects of this class of fuzzy vector functions in this section.
Definition 9
([20]). Assume that is a fuzzy function defined on a convex set . It can be said by us that is granular convex if
for all , with respect to distinct FNs , , and each
It can be said that is granular strict convex if
for all , with respect to distinct FNs , , and each
Definition 10.
A fuzzy vector function is regarded as vector granular convex (for short: V-gr-convex) if there exist function such that for each and for ,
with respect to distinct FNs , , and .
Remark 2.
For and , the above definition reduces to the granular convex fuzzy function.
Definition 11.
If each and is a V-gr-convex fuzzy function for and , a fuzzy multi-objective programming problem (FCMOP) is considered V-gr-convex fuzzy multi-objective programming problem.
Remark 3.
A gr-convex fuzzy multi-objective programming problem is necessarily a V-gr-convex fuzzy multi-objective programming problem, but not conversely. In other words, each and is a gr-convex fuzzy function for and , the problem of (FCMOP) is also a V-gr-convex fuzzy multi-objective programming problem, but not conversely.
For the real-valued multi-objective programming problem, a good example has been given by Jeyakumar and Mond in [28]. A similar fuzzy multi-objective programming issue example is as follows.
Example 1.
Let and , It is considered by us that the following fuzzy multi-objective programming problem.
The following is the HMF of for .
where
and
Seeing that this problem is a V-gr-convex fuzzy multi-objective programming problem with , is easy, but this issue does not live up to the gr-convexity guidelines.
For example, for , we can check it satisfies the guideline of Definition 10 for .
and
and
The above equations means that
So, satisfies the guideline of Definition 10. We also can check that and is a V-gr-convex fuzzy function for . From Definition 11, this issue is a V-gr-convex fuzzy multi-objective programming issue. But this issue does not live up to the gr-convexity guidelines.
Proposition 2.
Assume that is differentiable and convex with positive derivative everywhere and is a V-gr-convex fuzzy vector function. Then, is also a V-gr-convex fuzzy vector function.
Proof.
Let . According to the monotonicity of and V-gr-convexity of , we get
Therefore, is also a V-gr-convex fuzzy vector function. □
Definition 12.
A viable point is denoted as a vector critical point to (FMOP) if there exists a vector with such that
for with regard to distinct FNs , .
The vector critical point of (FMOP) is defined as the point where a non-negative linear combination of the granular gradient vectors of each component fuzzy objective function equal to zero.
Example 2.
Let . It is considered by us that the unconstrained fuzzy multi-objective programming issue
The following is the HMF of for and .
where
and
The granular gradient of as follows,
and
We can see that is a vector critical point to this unconstrained fuzzy multi-objective programming problem, there exists a vector with such that for and .
Based on the HMF of the fuzzy function, we may delimit the notions of granular pseudoconvex and granular pseudoconcave fuzzy functions, which are comparable to the definition of real-valued generalized convex functions.
Definition 13.
Assume that is a gr-differentiable fuzzy function defined on an open convex set . is denoted as granular pseudoconvex (gr-pseudoconvex) at , if for all one has
or equivalently,
for with respect to distinct FNs , and .
The is called gr-pseudoconvex on if the above property is contented for all . The is called gr-pseudoconcave on if is gr-pseudoconvex on The is called gr-pseudolinear on if is both gr-pseudoconvex and gr-pseudoconcave on
Definition 14.
Assume that is a gr-differentiable fuzzy function defined on an open convex set . The is regarded as strictly granular pseudoconvex (gr-pseudoconvex) at , if for all one has
for with respect to distinct FNs , and .
The fuzzy function is called strictly gr-pseudoconvex on if the above property is contented for all .
It is clear that every strictly gr-pseudoconvex fuzzy function is also a gr-pseudoconvex fuzzy function. However, in conclusion, the reverse is not true.
Proposition 3.
Assume that is a gr-differentiable fuzzy function defined on an open convex set . If the fuzzy function is gr-convex on K, then it also is gr-pseudoconvex on K.
Proof.
From Definition 10 and Remark 2, it can be easily proved. □
The Proposition 3’s converse is not true.
Example 3.
Let It is considered by us that .
The following is the granular gradient of ,
Then, we own
which signifies is a gr-pseudoconvex fuzzy function, but it is not a gr-convex fuzzy function.
Definition 15.
A fuzzy vector function is denoted as vector granular pseudoconvex (for short: V-gr-pseudoconvex) if there exist function and such that for each and for ,
with respect to distinct FNs , , and .
We can also define the notions of granular quasiconvex and granular quasiconcave fuzzy functions.
Definition 16.
Assume that is a gr-differentiable fuzzy function defined on an open convex set . The is denoted as granular quasiconvex (gr-quasiconvex) at , if for all and
for with regard to distinct FNs , and .
The is called gr-quasiconcave on if is gr-quasiconvex on The is referred to as strictly gr-quasiconvex if
is contented for and .
Example 4.
The fuzzy function
and .
It is clear that is a gr-quasiconvex fuzzy function on
For real-valued functions, the following theorem characterizes differentiable quasiconvex functions. The proof can be found in [29].
Theorem 2
([29]). Assume that is an open convex set and assume that is a differentiable function on Then, g is quasiconvex on The following implication is true.
Since the HMF of a fuzzy function is a real-valued function, we can propose the following proposition for the gr-differentiable quasiconvex fuzzy function by Theorem 2.
Proposition 4.
Assume that is a gr-differentiable fuzzy function defined on an open convex set . Then, is gr-quasiconvex on The following implication is true.
for with respect to distinct FNs , and .
Proof.
Since and are two real-valued functions. From Theorem 2, we can easily prove this proposition. □
Definition 17.
A fuzzy vector function is denoted as vector granular quasiconvex (for short: V-gr-quasiconvex) if there exist function and such that for each and for ,
with respect to distinct FNs , , and .
4. The Karush-Kuhn-Tucker Optimality Guidelines
In this part, we will present the KKT optimality guidelines for the problems of (FMOP) and (FCMOP) based on the gr-convexity and gr-differentiability.
4.1. Optimality Guidelines for the Issue of (FMOP)
The following Gordan’s alternative theorem will be used to establishing the essential optimality guidelines. Mangasarian [29] provides evidence for this.
Theorem 3.
Assume that is a matrix, then either
(i) has a result ;
or
(ii) for some nonzero , but never both.
At present time, we present the following KKT optimality guidelines for the issues of (FMOP).
Theorem 4.
Assume that is a V-gr-convex fuzzy vector function, then is a WES for the issue of (FMOP) ⇔ is a vector critical point to the problem of (FMOP).
Proof.
(⇐) Since is a vector critical point, then there exists a vector with such that
for with respect to distinct FNs , .
Suppose that the point is not a WES for the issue of (FMOP). Then there exists such that
From Definition 7 and Proposition 1, we get
Since is a V-gr-convex fuzzy vector function, there exist function such that for each and for ,
According to the two inequations above, we obtain
and for , we have
which is a conflict. So the point is a WES for the issue of (FMOP).
Assume that the point is a WES for the problem of (FMOP), then there exists no such that
According to Definition 7 and Proposition 1, obtain
From the V-gr-convexity of the fuzzy vector function, we have
which means
According to Gordan’s alternative theorem and the above inequation, there exists a vector with such that
So, the issue of (FMOP) has a vector critical point called .□
As is known to all that for real-valued multi-objective optimizations, based on the convexity hypothesis, the vector critical point, the WES and the solutions with optimality for weighting scalar issues coincide. And Osuna-Gómez et al. [30] have proved this results under the assumptions of invexity. We can also shown that the results are contented under the V-gr-convexity hypothesis for (FMOP).
It is considered by us that the following gr-differentiable weighting optimization issue:
where .
Theorem 5.
Assume that is a V-gr-convex fuzzy vector function on an open set K, then all WES of (FMOP) work out the weighting scalar problem (SOP) with .
Proof.
Assume that is a WES of (FMOP), from Theorem 4, then there exists with so that
Since is a V-gr-convex fuzzy vector function, then
and
Then, we have
From the above inequation and Remark 1, we obtain
which means
Therefore, is a solutions with optimality for (SOP) with . □
Theorem 6.
Assume that is a vector critical point for (FMOP), and is a gr-pseudoconvex fuzzy function at . Then is a WES of (FMOP).
Proof.
Assume that is a vector critical point for (FMOP), then there exists such that
If there exists another such that , from Proposition 1, which means for According to the gr-pseudoconvexity of , we have
and
According to Gordan’s alternative theorem, this system
have no solutions, which contradicts is a vector critical point for (FMOP). So, is a WES of (FMOP). □
Example 5.
Consider Example 2, is a gr-pseudoconvex fuzzy function, so the vector critical point is a WES of (FMOP) based on Theorem 6.
4.2. Optimality Guidelines for the Problem of (FCMOP)
The following Motzkin’s alternative theorem and Kuhn-Tucker constraint qualification (KTCQ) will be used to establishing the necessary optimality guidelines. These results can be found in Mangasarian [29].
The (KTCQ) is shown below.
Definition 18.
Assume that the constraint functions of the (FCMOP) is continuously gr-differentiable at The (FCMOP) is said to be satisfy the (KTCQ) at , if for any such that
there exists a vector function , which is continuously differentiable at 0 and some real number such that
The Motzkin’s alternative theorem as follows.
Theorem 7.
Assume that and is given and matrices, with being nonvacuous. Then,
(i) has a solution
or
(ii) has a solution
but never both.
At present, we create the optimality guidelines for the issue of (FCMOP) based on vector granular convexity and granular differentiability. The necessary optimality guidelines as follows.
Theorem 8.
Assume that and is continuously vector gr-differentiable fuzzy functions at . Assume that the (KTCQ) is contented at . Then, a guideline with necessity for to be a WES for (FCMOP) is that there exist multipliers and , such that
Proof.
Suppose is a WES for (FCMOP). First of all, we evidence the follows system has no result .
If the above system has a result . From the (KTCQ), there exists a function which is a continuously differentiable function at 0 and some real number such that
Since is a continuously vector gr-differentiable fuzzy functions at , then for every , we obtain
where, for , we get
and
From (6) and the assumption we have
for sufficiently small .
According to Proposition 1 and , we get
and
which conflicts is a WES for (FCMOP). So, the system (4)–(5) has no solution. From Motzkin’s alternative theorem, there exist and , such that
If we setting for all , we obtain
are contented at □
By the gr-convexity of objective and constraint functions, we obtain the guidelines with sufficient optimality as follows.
Theorem 9.
Assume that is a feasible result for the (FCMOP) and is a V-gr-pseudoconvex and vector gr-differentiable fuzzy function, and is a V-gr-quasiconvex and vector gr-differentiable fuzzy function at . If there exist multipliers and , such that (2)–(3) are satisfied. Then, is an ES for the (FCMOP).
Proof.
Assume that is a feasible result of the issue (FCMOP). Then,
from Proposition 1, which means
Since (2)–(3) are satisfied at , then for , we obtain
which means
Then, from Remark 1, we obtain
By the V-gr-quasiconvexity of and the above inequality, we obtain
Consequently, from (2), we obtain
By the V-gr-pseudoconvexity of and the inequality above, we obtain
is contented for .
On the contrary, assume that is not an ES for the (FCMOP). Then, there exists some point , such that
and there exists k such that
By Proposition 1 and , we have
which is a conflict to (7). So, is an ES for the (FCMOP). □
Example 6.
Consider the example as follows.
where and .
The HMF of and as follows,
and
The HMF of and as follows,
and
Then, we have
and
where .
and
By the optimality guidelines, we have
where
By calculating, we obtain is a KKT point when and Seeing the vector fuzzy function is a V-gr-convex vector fuzzy function and the vector fuzzy function is a linear vector fuzzy function is easy. So, this problem satisfy the assumptions of Theorem 9. Then, is an ES for this issue.
5. Conclusions
In this thesiss, for vector fuzzy-valued functions, we recommended the notions of V-gr-convexity, V-gr-pseudo-convexity, and V-gr-quasiconvexity. These are the vector real-valued functions’ extensions of convexity, pseudoconvexity, and quasiconvexity. V-gr-convexity, V-gr-pseudoconvexity, V-gr-quasiconvexity, and V-gr-differentiability for vector fuzzy-valued functions were also explored. Under the assumptions of V-gr-convexity and V-gr-differentiability, we also certificated the optimality guidelines. Our findings extended the previous findings to the (FMOP) and (FCMOP).
Author Contributions
Conceptualization, J.Z., Y.W., Q.F. and L.L.; methodology, J.Z., Y.W., Q.F. and L.L.; Analysis, J.Z., L.L. and Q.F.; Writing—original draft preparation, J.Z., Y.W. and Q.F.; Discussion, J.Z., Y.W., L.L. and Q.F. All authors have read and agreed to the published version of the manuscript.
Funding
This research was funded by Shaanxi Provincial Key Research and Development Program (NO. 2021SF-480); National Natural Science Foundation of China (NO. 62166015).
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Acknowledgments
The authors would like to thank the editors and anonymous reviewers for their detailed and valuable suggestions and comments, which improved the quality of the original manuscript.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Wu, H.-C. The optimality conditions for optimization problems with convex constraints and multiple fuzzy-valued objective functions. Fuzzy Optim. Decis. Mak. 2009, 8, 295–321. [Google Scholar] [CrossRef] [Scilit]
- Wu, H.-C. The Karush-Kuhn-Tucker optimality conditions for multi-objective programming problems with fuzzy-valued objective functions. Fuzzy Optim. Decis. Mak. 2009, 196, 49–60. [Google Scholar] [CrossRef] [Scilit]
- Wu, H.-C. The Karush-Kuhn-Tucker optimality conditions in an optimization problem with interval-valued objective function. Eur. J. Oper. Res. 2007, 176, 46–59. [Google Scholar] [CrossRef] [Scilit]
- Wu, H.-C. The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective function. Eur. J. Oper. Res. 2009, 196, 49–60. [Google Scholar] [CrossRef] [Scilit]
- Chalco-Cano, Y.; Lodwick, W.A.; Rufian-Lizana, A. Optimality conditions of type KKT for optimization problem with interval-valued objective function via generalized derivative. Fuzzy Optim. Decis. Mak. 2013, 3, 305–322. [Google Scholar] [CrossRef] [Scilit]
- Chalco-Cano, Y.; Lodwick, W.A.; Osuna-Gómez, R.; Rufián-Lizana, A. The Karush-Kuhn-Tucker optimality conditions for fuzzy optimization problems. Fuzzy Optim. Decis. Mak. 2016, 15, 57–73. [Google Scholar] [CrossRef] [Scilit]
- Osuna-Gómez, R.; Chalco-Cano, Y.; Rufián-Lizana, A.; Herna´ndez-Jime´nez, B. Necessary and sufficient conditions for fuzzy optimality problems. Fuzzy Set. Syst. 2016, 296, 112–123. [Google Scholar] [CrossRef] [Scilit]
- Li, L.F.; Liu, S.Y.; Zhang, J.K. On fuzzy generalized convex mappings and optimality conditions for fuzzy weakly univex mappings. Fuzzy Set. Syst. 2015, 280, 107–132. [Google Scholar] [CrossRef] [Scilit]
- Zhang, J.; Liu, S.; Li, L.; Feng, Q. The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function. Optim. Lett. 2014, 8, 607–631. [Google Scholar] [CrossRef] [Scilit]
- Son, N.; Long, H.V.; Dong, N.P. Fuzzy delay differential equations under granular differentiability with applications. Comput. Appl. Math. 2019, 38, 1–19. [Google Scholar] [CrossRef] [Scilit]
- Mazandarani, M.; Pariz, N.; Kamyad, A.V. Granular differentiability of fuzzy-number-valued functions. IEEE Trans. Fuzzy Syst. 2016, 26, 310–323. [Google Scholar] [CrossRef] [Scilit]
- Mazandarani, M.; Pariz, N. Sub-optimal control of fuzzy linear dynamical systems under granular differentiability concept. ISA Trans. 2018, 76, 1–17. [Google Scholar] [CrossRef] [Scilit]
- Mazandarani, M.; Zhao, Y. Fuzzy Bang-Bang control problem under granular differentiability. J. Franklin. Inst. 2018, 355, 4931–4951. [Google Scholar] [CrossRef] [Scilit]
- Mustafa, A.M.; Gong, Z.T.; Osman, M. The solution of fuzzy variational problem and fuzzy optimal control problem under granular differentiability concept. Int. J. Comput. Math. 2021, 98, 1495–1520. [Google Scholar] [CrossRef] [Scilit]
- Najariyan, M.; Zhao, Y. Fuzzy fractional quadratic regulator problem under granular fuzzy fractional derivatives. IEEE Trans. Fuzzy Syst. 2018, 26, 2273–2288. [Google Scholar] [CrossRef] [Scilit]
- Mazandarani, M.; Zhao, Y. Z-differential equations. IEEE Trans. Fuzzy Syst. 2019, 28, 462–473. [Google Scholar] [CrossRef] [Scilit]
- Najariyan, M.; Pariz, N.; Vu, H. Fuzzy linear singular differential equations under granular differentiability concept. Fuzzy Set. Syst. 2021, 429, 169–187. [Google Scholar] [CrossRef] [Scilit]
- Vu, H.; Hoa, N.V. Uncertain fractional differential equations on a time scale under Granular differentiability concept. Comput. Appl. Math. 2019, 38, 1–22. [Google Scholar] [CrossRef] [Scilit]
- Najariyan, M.; Zhao, Y. The explicit solution of fuzzy singular differential equations using fuzzy Drazin inverse matrix. Soft Comput. 2020, 24, 11251–11264. [Google Scholar] [CrossRef] [Scilit]
- Zhang, J.K.; Chen, X.Y.; Li, L.F.; Ma, X.J. Optimality conditions for fuzzy optimization problems under granular convexity concept. Fuzzy Set. Syst. 2022, 447, 54–75. [Google Scholar] [CrossRef] [Scilit]
- Arana-Jiménez, M.; Rufián-Lizana, A.; Chalco-Cano, Y.; Román-Flores, H. Generalized convexity in fuzzy vector optimization through a linear ordering. Inform. Sci. 2015, 312, 13–24. [Google Scholar] [CrossRef] [Scilit]
- Osuna-Gómez, R.; Hernandez-Jimenez, B.; Chalco-Cano, Y.; Ruiz-Garzon, G. New optimality conditions for multiobjective fuzzy programming problems. Iran. J. Fuzzy Syst. 2020, 17, 19–31. [Google Scholar] [CrossRef]
- Kalsoom, H.; Ali, M.A.; Abbas, M.; Budak, H.; Murtaza, G. Generalized quantum Montgomery identity and Ostrowski type inequalities for preinvex functions. TWMS J. Pure Appl. Math. 2022, 13, 72–90. [Google Scholar]
- Butt, S.I.; Nadeem, M.; Farid, G. On Caputo fractional derivatives via exponential s-convex functions. Turk. J. Sci. 2020, 5, 140–146. [Google Scholar]
- Kızıl, Ş.; Ardic, M.A. Inequalities for strongly convex functions via Atangana-Baleanu Integral Operators. Turk. J. Sci. 2021, 6, 96–109. [Google Scholar]
- Ekinci, A.; Ozdemir, M.E. Generalized quantum Montgomery identity and Ostrowski type inequalities for preinvex functions. Appl. Comput. Mat. 2019, 18, 288–295. [Google Scholar]
- Piegat, A.; Landowski, M. Horizontal Membership Function and Examples of its Applications. Int. J. Fuzzy Syst. 2015, 17, 22–30. [Google Scholar] [CrossRef] [Scilit]
- Mangasarian, O.L. Nonlinear Programming; McGraw-Hill: New York, NY, USA, 1969. [Google Scholar]
- Jeyakumar, V.; Mond, B. On generalised convex mathematical programming. ANZIAM J. 1992, 34, 43–53. [Google Scholar] [CrossRef] [Scilit]
- Osuna-Gómez, R.; Beato-Moreno, A.; Rufian-Lizana, A. Generalized convexity in multiobjective programming. J. Math. Anal. Appl. 1992, 233, 205–220. [Google Scholar] [CrossRef] [Scilit]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).