Page 34 - DCOM303_DMGT504_OPERATION_RESEARCH

Unit 2: Linear Programming Problems

Step 2: Fix up the graphic scale Notes
Maximum points = 600
Minimum points = 300
2 cms. = 200 points

Step 3: Graph the data

Step 4: Find the co-ordinates of the corner points

Corner Points X1 x2
O 0 0
A 300 0
B 200 200
C 0 400

Step 5: Subscribe the co-ordinates of the corner points into objective function
Maximise ‘Z’ = 2x + 3x
1 2
At ‘O’, Z = 2(0) + 3(0) = 0
At ‘A’, Z = 2(300) + 3(0) = 600

At ‘B’, Z = 2(200) + 2(200)= 1,000
At ‘C’, Z = 2(0) + 3(400) = 1,200

Inference

A maximum profit of ` 1,200 can be earned by producing 400 units of only type B and none of
type A.

LOVELY PROFESSIONAL UNIVERSITY 29