Scribd
Upload
4 views7 pages

Lec-General Structure of Transpotation Problem

Uploaded by

X-Men JEAN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views7 pages

Lec-General Structure of Transpotation Problem

Uploaded by

X-Men JEAN
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

INSTITUTE - USB

DEPARTMENT - BBA
Bachelor of Business Administration
Subject Name-Operations Research
Subject Code- 22BAT-261
Faculty Name – Dr. Harwinder Kaur

DISCOVER . LEARN .
EMPOWER
OPERATION RESEARCH
Course Outcome
CO Title Level
Number

CO1 To understand the basics of linear programming Understand

problems and its role in business decisions


making.

CO2 To illustrate the concept of linear programming Application

problems, transportation problems and


assignment problems.

CO3 To analyze problems related to business Analyze


decision making under risk and uncertainty and
to provide a suitable solution for such problems.

CO4 To critically evaluate a situation that arises in Evaluate


Network analysis and to provide a suitable
solution for the same.

CO5 To develop a network model for any business- Application


related problem that comes under network
analysis.
https://www.or.tum.de/en/hom
e/ 2
General Structure of a Transportation Problem

Let there be m origins and n destinations. Let the


amount of supply at the i th origin is ai. Let the
demand at j th destination is bj.

The cost of transporting one unit of an item from


origin i to destination j is cij and is known for
all combinations (i,j). Quantity transported
from origin i to destination j be xij
Now the linear programming model representing the
transportation problem is given by
Some Definitions

• Feasible Solution: A feasible solution to a transportation problem is a set of


non-negative values xij(i=1,2,..,m, j=1,2,…n) that satisfies the constraints.
• Basic Feasible Solution: A feasible solution is called a basic feasible
solution if it contains not more than m+n–1 allocations, where m is the
number of rows and n is the number of columns in a transportation problem.
• Optimal Solution: Optimal Solution is a feasible solution (not necessarily
basic) which optimizes(minimize) the total transportation cost.
• Non degenerate basic feasible Solution: If a basic feasible solution to a
transportation problem contains exactly m+n–1 allocations in independent
positions, it is called a Non degenerate basic feasible solution. Here m is the
number of rows and n is the number of columns in a transportation problem.
THANK YOU

You might also like