This preview shows pages 1–5. Sign up to view the full content.
Determination of Starting
Basic Feasible Solution
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Determination of the starting Solution
In any transportation model we determine a
starting BFS and then iteratively move towards the
optimal solution which has the least shipping cost.
There are three methods to determine a starting
BFS. As mentioned earlier, any BFS will have only
m+n1 basic variables (which may assume non
zero =positive values) and the remaining variables
will all be nonbasic and so have zero values. In
any transportation tableau, we only indicate the
values of basic variables. The cells corresponding
to nonbasic variables will be blank.
Degenerate BFS
If in a cell we find a zero mentioned, it means that
that cell corresponds to a basic variable which
assumes a value of zero. In simplex language, we
say that we have a degenerate BFS.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
NORTHWEST Corner Method for
determining a starting BFS
The method starts at the northwest corner cell
(i.e. cell (1,1)).
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 02/23/2011 for the course MATH 112 taught by Professor Ritadubey during the Spring '11 term at Amity University.
 Spring '11
 ritadubey

Click to edit the document details