Abstract
In this paper, we study the min–max programming problem with n addition-min fuzzy relational inequality constraints. We prove that when the problem is feasible, an optimal solution always exists with all variables being of the same value. Based on this result, the min–max programming problem can be simplified as a single-variable optimization problem with the same optimal objective value. To solve the corresponding single-variable optimization problem, we propose an analytical method and an iterative method by successively approximating the lower bound of the optimal value. Numerical examples are given to illustrate our methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.