Académique Documents
Professionnel Documents
Culture Documents
SMU
ASSIGNMENT
SEMESTER – 2
MBO032
OPERATIONS RESEARCH
SUBMITTED BY:
SIDHARTH RAMTEKE
MBA
ROLL NO.- 520918813
-1-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
SET 1
OPERATIONS RESEARCH
Ans:- Operations Research (OR) in the USA, South Africa and Australia,
and Operational Research in Europe and Canada, is an interdisciplinary
branch of applied mathematics and formal science that uses methods
such as mathematical modeling, statistics, and algorithms to arrive at
optimal or near optimal solutions to complex problems. It is typically
concerned with optimizing the maxima (profit, assembly line performance,
crop yield, bandwidth, etc) or minima (loss, risk, etc.) of some objective
function. Operations research helps management achieve its goals using
scientific methods.
-2-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
-3-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
c1, c2,…. Cn, a11, a12,…. amn are all known constants
Z is called the "objective function" of the LPP of n variables which is to be
maximized or
minimized.
-4-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
There are many real life situations where an LPP may be formulated.
The following examples will help to explain the mathematical formulation
of an LPP.
Suggested answer:
The above information can be represented as
-5-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
• Only one single objective is dealt with while in real life situations,
problems come with multi-objectives.
-6-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
-7-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
A Linear Program
Solving this linear program involves solutions of the set of
equations. If no solution to the set of equations is yet known, slack
variables , adding no cost to the solution, are introduced.
The initial basic feasible solution (BFS) will be the solution of the linear
program where the following holds:
-8-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
as increases.
-9-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
-10-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
Examples:
x1 x2 S1 A1 S2 S3
2 0 0 –1 0
0 Ratio
A1 – 2* 1 –1 1 0 0 2 2/2=1
1
S2 0 1 3 0 0 1 0 2 2/1=2
S3 0 0 1 0 0 0 1 4
–2 –1 1 0 0 0 –2
-11-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
x1 x2 x1 A1 S2 S3
0 0 0 –1 0 0
X1 0 1 1/2 – 1/2 ½ 0 0 1
S2 0 0 5/2 1/2 –½ 1 0 1
S3 0 0 1 0 0 0 1 4
0 0 0 1 0 0 0
Phase I is complete, since there are no negative elements in the last row.
The Optimal solution of the new objective is Z* = 0.
Phase II: Consider the original objective function,
Maximize z = 3x1 – x2 + 0S1 + 0S2 + 0S3
Subject to x1 + x2/2 – S1/2=1
5/2 x2 + S1/2 + S2=1
x2 + S3 = 4
x1, x2, S1, S2, S3 ≥ 0
with the initial solution x1 = 1, S2 = 1, S3 = 4, the corresponding simplex
table is
x1 x2 S1 S2 S3
3 –1 0 0 0 Ratio
X1 3 1 1/2 – 1/2 0 0 1
S2 0 0 5/2 1/2* 1 0 1 1/1/2=
2
S3 0 0 1 0 0 1 4
0 5/2 – 3/2 0 0 3
x1 x2 S1 S2 S3
3 –1 0 0 0
X1 0 1 3 0 1 0 2
S1 0 0 5 1 2 0 2
S3 0 0 1 0 0 1 4
0 10 0 3 0 6
Since all elements of the last row are non negative, the current
solution is optimal.
-12-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
Primal
Maximize
n
z= ∑C
j =1
j .x j
n
Subject to ∑a
j =1
ij x j ≤b j , i = 1,2,…., m
xj ≥ 0, j = 1,2,…., n
Dual
Minimize
m
w= ∑b . y
i =1
i i
m
Subject to ∑a
i =1
ij yi ≤ ci , i = 1,2,…., n
yj ≥ 0, i = 1,2,…., m
-13-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
From the above resource allocation model, the primal problem has n
economic activities and m resources. The coefficient cj in the primal
represents the profit per unit of activity j. Resource i, whose maximum
availability is bi, is consumed at the rate aij units per unit of activity j.
n m
z = ∑C j x j ≤ ∑bi yi = w
j =1 i =1
The strict equality, z = w, holds when both the primal and dual
solutions are optimal.
This means that the dual variables yi, represent the worth per unit
of resource i [variables yi are also called as dual prices, shadow prices and
simplex multipliers].
With the same logic, the inequality z < w associated with any two
feasible primal and dual solutions is interpreted as (profit) < (worth of
resources)
This relationship implies that as long as the total return from all the
activities is less than the worth of the resources, the corresponding primal
and dual solutions are not optimal. Optimality is reached only when the
resources have been exploited completely, which can happen only when
the input equals the output (profit). Economically the system is said to
-14-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
remain unstable (non optimal) when the input (worth of the resources)
exceeds the output (return). Stability occurs only when the two quantities
are equal.
Q.5:- How can you use the Matrix Minimum method to find the
initial basic feasible solution in the transportation problem?
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 i th 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.
-15-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
and xj ³ 0 j = 1, 2, … ,n
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.
-16-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
n1
∑y
j =0
ij x j = bi ( i 0 , 1, 2 , ........, m1 )
Let it be [bk 1]
or write is as f ko
-17-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
∑f
j =0
kj x j ≥ f ko
Step 7: Starting with this new set of equation constraints, find the new
optimum solution by dual simplex algorithm. (So that Gsla (1) is the initial
leaving basic variable).
-18-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
SET 2
OPERATIONS RESEARCH
-19-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
Maximize or Minimize
Z = c1 x1 + c2 x 2 +................+cn x n
Canonical forms :
The general Linear Programming Problem (LPP) defined above
can always be put in the following form which is called as the
canonical form:
-20-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
Any LPP can be put in the cannonical form by the use of five elementary
transformations:
4. An inequality constraint with its left hand side in the absolute form can
be changed into two regular inequalities. For example: | 2x1+3x2 | < 5
is equivalent to 2x1+3x2 < 5 and 2x1+3x2 > – 5 or – 2x1 – 3x2 < 5.
-21-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
-22-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
-23-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
-24-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
Q.5:- Describe the North-West Corner rule for finding the initial
basic feasible solution in the transportation problem?
Step1: 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 = min (a1,b1)
-25-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
value. Move down vertically to the second row and make the second
allocation of magnitude
x21 = min (a2, b1 – x21) in the cell (2,1). This either exhausts the
capacity of origin O2 or satisfies the remaining demand at destination
D1.
(a1 – x11, b2) in the cell (1, 2) . This either exhausts the remaining
capacity of origin O1 or satisfies the demand at destination D2 .
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.
-26-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
Further let us suppose that for each integer valued xj, we can assign
lower and upper bounds for the optimum values of the variable by
x j > I + 1 ___________________________ ( 6)
Then the solution having the larger value for z is clearly optimum for
the given I.P.P. However, it usually happens that one (or both) of these
problems has no optimal solution satisfying (3), and thus some more
computations are necessary. We now discuss step wise the
algorithm that specifies how to apply the partitioning (6) and (7) in a
systematic manner to finally arrive at an optimum solution.
We start with an initial lower bound for z, say z (0) at the first
iteration which is less than or equal to the optimal value z*, this lower
bound may be taken as the starting Lj for some xj.
-27-
ASSIGNMENTS- MBA Sem-II
MB0032 – OPERATIONS RESEARCH
-28-