Abstract
In this paper, a linear programming (LP) problem is considered where some or all of its coefficients in the objective function and/or constraints are rough intervals. In order to solve this problem, we will construct two LP problems with interval coefficients. One of these problems is an LP where all of its coefficients are upper approximations of rough intervals and the other is an LP where all of its coefficients are lower approximations of rough intervals. Via these two LPs, two newly solutions (completely and rather satisfactory) are defined. Some examples are given to demonstrate the results.
Get full access to this article
View all access options for this article.