Beruflich Dokumente
Kultur Dokumente
Roll No : 511015404
ASSIGNMENTS
MB 0048 (4 credits) Set 2
Marks 60
OPERATIONS RESEARCH
Name Mohan N
Roll No 511015404
Program MBA
Subject OPERATIONS RESEARCH
[ Set 2]
Code MB0048
Answer :
1. It is System oriented: OR studies the problem from over all point of view
of organizations or situations since optimum result of one part of the
system may not be optimum for some other part.
1
Name : Mohan N
Roll No : 511015404
2
Name : Mohan N
Roll No : 511015404
The general Linear Programming Problem (LPP) defined above can always be
put in the following form which is called as the canonical form:
Maximise
Any LPP can be Put in the canonical form by the use of five elementary
transformations:
Maximize
2. Any inequality in one direction ( ) may be changed to an inequality in the
opposite direction ( )by multiplying both sides of the inequality by —1.
or and
3
Name : Mohan N
Roll No : 511015404
4. An inequality constraint with its left hand side in the absolute form can be
changed into two regular inequalities. For example: is
equivalent to and or
Answer :
2. Introduce surplus variables (Si’s) and Artificial Variables (Ai) for” “ type of
constraint.
4. Cost (CJ) of slack and surplus variables will be zero and that of Artificial
variable will be “M”
6. Slack and Artificial variables will form Basic variable for the first simplex
table. Surplus variable will never become Basic Variable for
8. Select the most negative value of ZJ - CJ. That column is called key column.
The variable corresponding to the column will become Basic
4
Name : Mohan N
Roll No : 511015404
9. Divide the quantities by the corresponding values of the key column to get
ratios select the minimum ratio. This becomes the key row. The Basic variable
corresponding to this row will be replaced by the variable found in step 6.
10. The element that lies both on key column and key row is called Pivotal
element.
11. Ratios with negative and “x” value are not considered for determining
key row.
12. Once an artificial variable is removed as basic variable, its column will be
deleted from next iteration.
14. Values of artificial variables will always is — M for both maximisation and
minimization problems.
5
Name : Mohan N
Roll No : 511015404
a (dummy) source with a supply equal to the shortage if total demand e’ceeds
total supply. The cost of transportation from the fictitious 1estination to all
sources and from all destinations to the fictitious sources are assumed to be
zero so that total cost of transportation will remain the same.
5.3 The Transportation Algorithm (MODI Method)
The first approximation to (2) is always integral and therefore always a feasible
solution. Rather than determining a first approximation by a direct application
of the simplex method it is more efficient to work with the table given below
called the transportation table. The transportation algorithm is the simplex
method specialized to the format of table it involves:
i. finding an integral basic feasible solution
ii. testing the solution for optimality
iii. improving the solution, when it is not optimal
iv. repeating steps (ii) and (iii) until the optimal solution is obtained.
The solution to T.P is obtained in two stages. In the first stage we find Basic
feasible solution by any one of the following methods a) North-west corner rale
b) Matrix Minima Method or least cost method c) Vogel’s approximation
method. In the second stage we test the B.Fs for its optimality either b MCDI
method or by stepping stone method.
5. Describe the North-West Corner rule for finding the initial basic
feasible solution in the transportation problem.
Answer :
North West Corner Rule
Step 1: The first assignment is made in the cell occupying the upper left hand
(north west) corner of the transportation table. The maximum feasible amount
is allocated there, that is x11 = mm (a1,b1)
x21 = mm (a2, b1 — x21) in the cell (2,1). This either exhausts the capacity of
origin 02 or satisfies the remaining demand at destination D.
6
Name : Mohan N
Roll No : 511015404
Step 3: Start from the new north west corner of the transportation table
satisfying destination requirements and exhausting the origin capacities one at
a time, move down towards the lower right corner of the transportation table
until all the rim requirements are satisfied.
Where 0j and Dj represent the ith origin and the jth destination respectively.
Solution: The transportation table of the given T.P. has 12 cells. Following
north west corner rule, the First allocation is made in the cell (1,1), the
magnitude being
x,1=min(14,6)=6
The third allocation is made in the cell (2, 2), the magnitude being x = mm
(16, 10 — 8) = 2. The magnitude of fourth allocation, in the cell (2, 3) is given
by x23 = mm (16 — 2, 15) = 14. The fifth allocation is made in the cell (3, 3),
7
Name : Mohan N
Roll No : 511015404
the magnitude being x = mm (5, 15 —14) =1. The sixth allocation in the cell
(3,4) is given by x = mm (5—1, 4) = 4.
Now all the rim requirements have been satisfied and hence an initial feasible
solution to the T.P. has been obtained. The solution is displayed as
Clearly, this feasible solution is non-degenerate basic feasible solution ; for the
allocated cells do not form a loop. The transportation cost according to the
above loop is given by.
z = x11 C11 + X12 C12 + X22 C22 + X23 C23 + X33 C33 + X34 C34
= 6x6 + 8x4 + 2x9 + 14x2 + 1x6 + 4x2
= 128
Step 0: If the master list is not empty, choose an L.P.P. out of it. Otherwise
stop the process, Go to step 1.
ii. The resulting optimum value of the objective function z is less than or
equal to z(t) then let z(t+1) = z(t) and return to step 0 otherwise go to step 2.
(3) then record it. Let z(t+1) be associated optimum value of r, return to step
Step 3: Select any variable Xj, J = 1, 2 , ……. p. that does not have an Integer
value in the obtained optimum solution to the L.P.P. chosen In step 0. Let
denote this optimal value of x1. Add two L.P.P’s to. the master list: these
L.P.P’s are identical with the L.P.P. chosen in step 0, except that In one, the
8
Name : Mohan N
Roll No : 511015404
Example:
Maximize
Solution:
(Solution to problem 1)
Since the solution is not integer valued, proceed from step 2 to step 3, and
select x1. Then since , place on the master list the following
9
Name : Mohan N
Roll No : 511015404
Problem2:
Problem 3:
(Problem 3)
Since the solution is not integer valued, proceed from step 2 to step 3 and
Problem4:(1)(2)and
Returning to step 0 with z(3) = z(2) = 35, choose problem 4 from step I we know
that problem 4 has no feasible solution and so we again return to step 0 with
z> = z(3) = 35. Only problem 5 is available in the master list. In step I we
determine the following optimum solution to this problem.
10
Name : Mohan N
Roll No : 511015404
Returning to step 0, we find that the master list is empty; and thus the
algorithm terminates.
Now, on terminating we find that only two feasible integer solution namely (5)
and (6) have been recorded. The best of these gives the optimum solution to
the given l.P.P. Hence the optimum integer solution to the given ,.P.P. is
Z0=55, x1=4, x2 = 3.
11