A single-variable method for solving min–max programming problem with addition-min fuzzy relational inequalities
- 39 Downloads
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.
KeywordsFuzzy relational inequalities Addition-min composition Min–max programming problem Single-variable method
- Guu, S.-M., & Wu, Y.-K. (2018). Multiple objective optimization for systems with addition-min fuzzy relational inequalities. Working paper, College of Management, Chang Gung University.Google Scholar
- Li, J.-X., & Yang, S.-J. (2012). Fuzzy relation inequalities about the data transmission mechanism in BitTorrent-like Peer-to-Peer file sharing systems. In Proceedings of the 9th international conference on fuzzy systems and knowledge discovery (FSKD 2012, pp. 452–456).Google Scholar