Fundamentals of Transportation Problem

VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE Pub Date : 2021-06-30 DOI:10.35940/ijeat.e2654.0610521

Bhabani Mallia Mrs., M. Das, C. Das

引用次数: 3

Abstract

Transportation Problem is a linear programming problem. Like LPP, transportation problem has basic feasible solution (BFS) and then from it we obtain the optimal solution. Among these BFS the optimal solution is developed by constructing dual of the TP. By using complimentary slackness conditions the optimal solutions is obtained by the same iterative principle. The method is known as MODI (Modified Distribution) method. In this paper we have discussed all the aspect of transportation problem.

查看原文本刊更多论文

交通问题基础

交通问题是一个线性规划问题。与LPP一样，交通问题也有基本可行解(BFS)，并由此得到最优解。在这些BFS中，通过构造TP的对偶得到了最优解。利用互补松弛条件，利用相同的迭代原理得到了最优解。这种方法被称为MODI (Modified Distribution)方法。本文讨论了运输问题的各个方面。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE

自引率

0.00%

发文量