The document discusses the transportation problem in linear programming, which aims to optimize the cost of transporting goods from multiple sources to multiple destinations. It outlines methods for solving these problems, including the northwest corner cell method, Vogel’s approximation method, and least cost cell method. The document differentiates between balanced and unbalanced transportation problems and notes that the simplex method is not appropriate for this type of problem.

1. NAME – KHUSHI CHOUDHARY
ENROLLMENT NO – 05815601723
COURSE - BBA 2ND SEMESTER
SECTION – “B”
SUBJECT - DTB
TEACHER NAME – SURRYA FARHAT

2. Transportation Problem

3. What is Transportation problem?
Transportation problems are used to find the minimum cost of transportation of
goods from m source to n destination. In this article, we will learn about
transportation problems, formulation, types and how they differ from assignment
problems.
A transportation problem is a Linear Programming Problem that deals with
identifying an optimal solution for transportation and allocating resources to
various destinations and from one site to another while keeping the
expenditure to a minimum.In simple words, the main objective of the
Transportation problem is to deliver (from the source to the destination) the
resources at the minimum

4. METHODS
Methods of solving transportation problem –
There are three ways for determining the initial basic
feasible solution they are
1.Northwest corner cell method
2. Vogel’s approximation method {VAM}
3. Least call cell method

5. Example of Northwest corner cell :

6. TYPE OF TRANSPORTATION PROBLEM
Balanced Transportation Problem
The problem is considered to be a balanced transportation problem when both
supplies and demands are equal.
Unbalanced Transportation Problem
Unbalanced transportation problem is defined as a situation in which supply and
demand are not equal. A dummy row or a dummy column is added to this type of
problem, depending on the necessity, to make it a balanced problem. The problem
can then be addressed in the same way as the balanced problem.

7. GENERAL STRUCTURE OF
TRANSPORTATION PROBLEM
The transportation problem is a special type of
linear programming problem where the
objective is to minimise the cost of
distributing a product from a number of
sources or origins to a number of destinations.
Because of its special structure the usual
simplex method is not suitable for solving
transportation problems