Beruflich Dokumente
Kultur Dokumente
Roll No : 511015404
ASSIGNMENTS
MB 0048 (4 credits) Set 1
OPERATIONS RESEARCH
Name Mohan N
Roll No 511015404
Program MBA
Subject OPERATIONS RESEARCH
[ Set 1]
Code MB0048
ii) In Industry: The system of modern industries are so complex that the
optimum point of operation in its various components cannot be intuitively
judged by an individual. The business environment is always changing and any
decision useful at one time may not be so good some time later. There is
1
Name : Mohan N
Roll No : 511015404
iii) Planning: In modern times it has become necessary for every government
to have careful planning, for economic development of the country. OR
techniques can be fruitfully applied to maximize the per capita income, with
minimum sacrifice and time. A government can thus use OR for framing future
economic and social policies.
2
Name : Mohan N
Roll No : 511015404
Maximize or Minimize
Z = c1 x1 + c2 x 2 + - - - - + cn x n
Requirements of L.P.P.
i. Decisions variables and their relationship
ii. Well defined objective function
iii. Existence of alternative courses of action
iv. Non-negative conditions on decision variables.
3
Name : Mohan N
Roll No : 511015404
4
Name : Mohan N
Roll No : 511015404
5
Name : Mohan N
Roll No : 511015404
11. Ratios with negative and “a” 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.
13. For maximisation problems decision variables coefficient will be same as
in the objective function. For minimization problems decision variables
coefficients will have opposite signs as compared to objective function.
14. Values of artificial variables will always is – M for both maximization and
minimization problems.
15. The process is continued till all Zj - Cj ≥ 0.
ii) The interpretation of the dual variable from the lost or economic point of
view proves extremely useful in making future decisions in the activities being
programmed.
5. How can you use the Matrix Minimum method to find the initial
basic feasible solution in the transportation problem.
Answer :
Step 1: Determine the smallest cost in the cost matrix of the transportation
table. Let it be cij , Allocate
xij = min ( ai, bj) in the cell ( i, j )
6
Name : Mohan N
Roll No : 511015404
Step 2: If xij = ai cross off the ith row of the transportation table and decrease
bj by ai go to step 3.
if xij = bj cross off the ith column of the transportation table and decrease ai by
bj go to step 3.
if xij = ai= bj cross off either the ith row or the ith column but not both.
Step 3: Repeat steps 1 and 2 for the resulting reduced transportation table
until all the rim requirements are satisfied whenever the minimum cost is not
unique make an arbitrary choice among the minima.
The first allocation is made in cells (3,1) the magnitude being X21 = 4. This
satisfies the requirement at destination D1 and thus we cross off the first
column from the table. The second allocation is made in the cell ( 2 , 4)
magnitude X24 = Min ( 6, 8) = 6. Cross off the fourth column of the table. This
yields the table (i)
There is again a tie for the theirs allocation. We choose arbitrarily the cell (1,2)
and allocate X12 = Min (6,6)= 6 there. Cross off either the second column of
the first row. We choose to cross off the first row of the table. The next
7
Name : Mohan N
Roll No : 511015404
Now all the rim requirement have been satisfied and hence an initial feasible
solutions has been determined. This solution is shown in table (iv) since the
cells do not form a loop, the solution is basic one. Moreover the solution is
degenerate also. The transportation cost according the above route is given by
Z=6x2+2x2+6x0+4x0+0x2+6x2=28
8
Name : Mohan N
Roll No : 511015404
If all the variables are constrained to take only integral value i.e. k = n, it is
called an all(or pure) integer programming problem. In case only some of the
variables are restricted to take integral value and rest (n – k) variables are free
to take any non negative values, then the problem is known as mixed integer
programming problem.