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.
| Original language | English |
|---|---|
| Pages (from-to) | 433-449 |
| Number of pages | 17 |
| Journal | Fuzzy Optimization and Decision Making |
| Volume | 18 |
| Issue number | 4 |
| DOIs | |
| State | Published - 01 12 2019 |
Bibliographical note
Publisher Copyright:© 2019, Springer Science+Business Media, LLC, part of Springer Nature.
Keywords
- Addition-min composition
- Fuzzy relational inequalities
- Min–max programming problem
- Single-variable method