Determine the Optimal Solution for Linear Programming with Interval Coefficients

The conventional linear programming model requires the parameters which are known as constants. In the real world, however, the parameters are seldom known exactly and have to be estimated. Linear programming with interval coefficients is one of the tools to tackle uncertainty in mathematical programming models. This paper presents a problem solving linear programming with interval coefficients. The problem will be solved by the algorithm general method to solve linear programming with interval coefficients. Thus, the best and the worst optimum solutions can be obtained, the upper bounds and lower bounds for the optimum value of the main problems can be determined.