Sign in to unlock AI Chat and more features
On Solving Fully Rough Multi-Objective Integer Linear Programming Problems
References:
13
Abstract
In this paper a suggested algorithm to solve fully rough multi-objective integer linear programming problem [FRMOILP] is described.In order to solve this problem and find rough value efficient solutions and decision rough integer variables by the slice-sum method with the branch and bound technique, we will use two methods, the first one is the method of weights and the second is ε-Constraint meth...
Keywords
Sustainable Development Goals (SDG)
2020
Article
Open Access
2-Y Citation Average
0.189
Language
Country
On Solving Fully Rough Multi-Objective Integer Linear Programming Problems
References:
13
Abstract
In this paper a suggested algorithm to solve fully rough multi-objective integer linear programming problem [FRMOILP] is described.In order to solve this problem and find rough value efficient solutions and decision rough integer variables by the slice-sum method with the branch and bound technique, we will use two methods, the first one is the method of weights and the second is ε-Constraint meth...
Keywords
Sustainable Development Goals (SDG)
2020
Article
Open Access
2-Y Citation Average
0.189
Language
Country