Abstract
This paper aims to solve the problem of multiple-objective linear optimization model subject to a system of inf-→ composition fuzzy relation equations, where → is R-, S- or QL-implications generated by continuous Archimedean t-norm (s-norm). Since the feasible domain of inf-→ relation equations constraint is nonconvex, these traditional mathematical programming techniques may have difficulty in computing efficient solutions for this problem. Therefore, we firstly investigate the solution sets of a system of inf-→ composition fuzzy relation equations in order to characterize the feasible domain of this problem. And then employing the smallest solution of constraint equation, we yield the optimal values of linear objective functions subject to a system of inf-→ composition fuzzy relation equations. Secondly, the two-phase approach is applied to generate an efficient solution for the problem of multiple-objective linear optimization model subject to a system of inf-→ composition fuzzy relation equations. Finally, a procedure is represented to compute the optimal solution of multiple-objective linear programming with inf-→ composition fuzzy relation equations constraint. In addition, three numerical examples are provided to illustrate the proposed procedure.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
