Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
A single-variable method for solving min–max programming problem with addition-min fuzzy relational inequalities
Ist Teil von
Fuzzy optimization and decision making, 2019-12, Vol.18 (4), p.433-449
Ort / Verlag
New York: Springer US
Erscheinungsjahr
2019
Link zum Volltext
Quelle
BSC - Ebsco (Business Source Ultimate)
Beschreibungen/Notizen
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.