Транспортная задача линейного программирования с нечетким спросом

Abstract

Рассмотрена модель транспортной задачи линейного программирования, в которой спрос на транспортируемый продукт в пунктах его реализации задан нечетко. Предложен метод решения этой задачи, учитывающий потери, связанные с неопределённостью спроса, а также транспортные расходы. Метод реализует итерационную процедуру последовательного улучшения плана.

A model of the transportation problem of linear programming, in which the demand for the product transported in points of its implementation clearly defined. A method for solving this problem. It is based on complex criteria that take into account the losses arising from the uncertainty of demand, the losses associated with lost profit in the deficit of the goods and transport costs for the carriage of goods. The method implements an iterative procedure consistent improvement plan. Also proposed an altern ative two-step method for solving the transport problem, which converts the two-index the original problem to the problem of single index. The resulting vector single index consists of components that are fuzzy numbers. As a solution to the problem adopted a set of numbers that minimizes the possible losses from these factors.