.png){kind=icon}
Return
Scenario-Based Methods for Interval Linear Programming Problems
.png){kind=icon}
OA
AI
DOI：10.3808/jei.201100188.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this study, a total of twelve system-condition scenarios are considered for the management system. The scenarios correspond on different attitudes of decision makers to the study system. In detail, variations in concerns on objective function values (aggressive, conservative, or neutral), the attitude to the constraints (optimistic or pessimistic), and the preferred types of constricting ratios (consistent or varied) lead to twelve scenarios. Consequently, twelve planning models and solution methods corresponding to different scenarios have been developed. To demonstrate the applicability of the developed methods, a municipal solid waste management problem has been provided in the case study section. The inherent mechanism of the study system could be reflected through a series of considered scenarios. Thus the decision makers could understand the targeted system comprehensively and identify the scenario which best fits the practical condition. Moreover, a number of feasible schemes could be generated under each scenario which allows decision makers to further adjust the obtained solutions and indentify a desired one through incorporation of their experiences, economic situations, social and cultural conditions. In addition, the possibility of infeasible solutions has been greatly reduced with the consideration of twelve scenarios instead of one.
Keywords:
interval linear programming
scenario analysis
constricting ratio
three-step method
solid waste management
Journal
J
IF:
5.4
Papers:
530
Citations:
661
Organization
Cited Papers
No cited papers available