MB0048- OPERATION RESEARCH

Q2.
A. Linear programming is a mathematical technique of optimizing a linear
objective function in the presence of a set of linear constraints. It consist of
three section such -:
1) A linear objective function
2) A set of linear constraints
3) Non negative restriction in variables
An LPP consisting of only two variables can be solved graphically. to solve
graphically , first we have to draw graphs of linear constraints equation.
Then a shed a common region where all the constraints inequalities are
satisfied. Such a region is called feasible reasons. If it is a convex
polyhedrons, we have to find out the value of objective function at each
vertices and choose one solutions as optimal solution where objective
function is optimized.
B.

Maximize , Z=200X+500Y
Subject to, X400
Y300
0.20X+0.40Y160
and X,Y0

Q No. 4. (B)
Step 1 -: Row reduction
J1
J2
M1
3
2
M2
0
3
M3
0
1
M4
0
1

J3
0
2
2
2

J4
1
2
3
3

Step- 2 -: Column Reduction & Drawing of Lines

3

Since no of lines drawn to cover an o no of rows, we have to work out

modified matrix by subtracting the minimum element uncovered by the
lines , adding it at cross section & leaving the elements as it is in the lines.
Step-3 -: Modified Matrix and drawing up lines
4

0
0
1
1
Here , no of lines drawn = no of rows . Hence we make assignment.
Step -4 -: Assignment
M1
M2
M3
M4

J1
4
2

J2
2

J3

1
2
1

J4

Step -5-: Solution

Machine

Job

Cost

M1

J3

M2

J1

M3

J4

M4

J2

Total Minimum Cost = Rs. 20