Linear optimization with mixed fuzzy relation inequality constraints using the pseudo-t-norms and its application
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605469725 | ||
| 003 | CHVBK | ||
| 005 | 20210128100324.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20151001xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-014-1464-9 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-014-1464-9 | ||
| 100 | 1 | |a Abbasi Molai |D Ali |u School of Mathematics and Computer Sciences, Damghan University, P.O.Box 36715-364, Damghan, Iran |4 aut | |
| 245 | 1 | 0 | |a Linear optimization with mixed fuzzy relation inequality constraints using the pseudo-t-norms and its application |h [Elektronische Daten] |c [Ali Abbasi Molai] |
| 520 | 3 | |a This paper studies the minimization problem of a linear objective function subject to mixed fuzzy relation inequalities (MFRIs) over finite support with regard to max- $$T_1$$ T 1 and max- $$T_2$$ T 2 composition operators, where $$T_1$$ T 1 and $$T_2$$ T 2 are two pseudo-t-norms. We first determine the structure of its feasible domain and then show that the solution set of a MFRI system is determined by a maximum solution and a finite number of minimal solutions. Moreover, sufficient and necessary conditions are proposed to check whether the feasible domain of the problem is empty or not. The MFRI path is defined to determine the minimal solutions of its feasible domain. The resolution process of the optimization problem is also designed based on the structure of its feasible domain. Procedures are proposed to reduce the size of the problem. With regard to the above points and the procedures, an algorithm is designed to solve the problem. Its application is expressed in the area of investing and covering. Finally, the algorithm is compared with other approaches. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2014 | ||
| 690 | 7 | |a Max-pseudo-t-norm composition |2 nationallicence | |
| 690 | 7 | |a Mixed fuzzy relation inequality |2 nationallicence | |
| 690 | 7 | |a Non-convex optimization |2 nationallicence | |
| 690 | 7 | |a Minimal solution |2 nationallicence | |
| 690 | 7 | |a Maximum solution |2 nationallicence | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/10(2015-10-01), 3009-3027 |x 1432-7643 |q 19:10<3009 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-014-1464-9 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00500-014-1464-9 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 100 |E 1- |a Abbasi Molai |D Ali |u School of Mathematics and Computer Sciences, Damghan University, P.O.Box 36715-364, Damghan, Iran |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/10(2015-10-01), 3009-3027 |x 1432-7643 |q 19:10<3009 |1 2015 |2 19 |o 500 | ||