تفسیر محدودیت های نابرابری های مربوط به ضریب فاصله و یک راه حل برای فاصله های برنامه ریزی خطی

The modern trend in Operations Research methodology deserves modelling of all relevant vague or uncertain information involved in a real decision problem. Generally, vagueness is modelled by a fuzzy approach and uncertainty by a stochastic approach. In some cases, a decision maker may prefer using interval numbers as coefficients of an inexact relationship. As a coefficient an interval assumes an extent of tolerance or a region that the parameter can possibly take. However, its use in the optimization problems is not much attended as it merits. This paper defines an interval linear programming problem as an extension of the classical linear programming problem to an inexact environment. On the basis of a comparative study on ordering interval numbers, inequality constraints involving interval coefficients are reduced in their satisfactory crisp equivalent forms and a satisfactory solution of the problem is defined. A numerical example is also given.