.png){kind=icon}
.png){kind=icon}
Return
Bounds on the worst optimal value in interval linear programming
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-018-3658-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
One of the basic tools to describe uncertainty in a linear programming model is interval linear programming, where parameters are assumed to vary within a priori known intervals. One of the main topics addressed in this context is determining the optimal value range, that is, the best and the worst of all the optimal values of the objective function among all the realizations of the uncertain parameters. For the equality constraint problems, computing the best optimal value is an easy task, but the worst optimal value calculation is known to be NP-hard. In this study, we propose new methods to determine bounds for the worst optimal value, and we evaluate them on a set of randomly generated instances.
Keywords:
Interval linear programming
Worst optimal value
Bounds
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.