Abstract
This article mainly investigates a smoothing approach for solving linear objective optimizations subject to fuzzy relational inequalities with addition-min composition. Since their constraints are concave, it is almost impossible to convert such a problem into a linear programming, which has a convex feasible domain. In this article, we construct a second-order continuously differentiable function for smoothing the constraints. Based on the approximation, a new smoothing approach is proposed for solving the problem. It is proved that any cluster of the generated solution sequence is an optimal solution. The convergence of optimal values is also proved. Some numerical experiments are presented for illustrating the performance and the effectiveness of the new approach. The numerical results show that, compared to the given smoothing method, the new approach usually reaches a more accurate solution both in sense of feasibility and optimality.
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.
