Problem 1
A company manufactures two products, X and Y by using three
machines A, B, and C. Machine A has 4 hours of capacity available
during the coming week. Similarly, the available capacity of
machines B and C during the coming week is 24 hours and 35
hours respectively. One unit of product X requires one hour of
Machine A, 3 hours of machine B and 10 hours of machine C.
Similarly one unit of product Y requires 1 hour, 8 hour and 7 hours
of machine A, B and C respectively. When one unit of X is sold in
the market, it yields a profit of Br 5/- per product and that of Y is
Br 7/- per unit. Solve the problem by using graphical method to
find the optimal product mix.
Solution: The details given in the problem is given in the table
below:
Machines Products Available capacity
(Time required in hours.
in hours).
X Y
A 1 1 4
B 3 8 24
C 10 7 35
Profit per 5 7
unit in Br.
Let the company manufactures x units of X and y units of Y,
and then the L.P. model is: Maximise Z = 5x + 7y s.t.
1x + 1y ≤ 4
3x + 8y ≤ 24
10x + 7y ≤ 35
and Both x
and y are ≥0.
As we cannot draw graph for inequalities, let us
consider them as equations. Maximise Z = 5x + 7ys.t.
1x + 1y = 4
3x + 8y = 24
10x + 7y = 35 and both x and y are ≥ 0
Let us take machine A. and find the boundary conditions. If x
= 0, machine A can manufacture 4/1 = 4 units of y.
Figure 2.1 Graph for machine A
Similarly, if y = 0, machine A can manufacture 4/1 = 4 units
of x. For other machines: Machine B When x = 0 , y = 24/8 =
3 and when y = 0 x = 24/3 = 8
Machine C When x = 0, y = 35/10 = 3.5 and when y = 0, x = 35
/ 7 = 5.
These values we can plot on a graph, taking product X on x-
axis and product Y on y- axis. First let us draw the graph for
machine A. In figure 2. 1 we get line 1 which represents 1x
+1y= 4. The point P on Y axis shows that the company can
manufacture 4 units of Y only when does not want to
manufacture X. Similarly the point Q on X axis shows that the
company can manufacture 4 units of X, when does not want to
manufacture Y. In fact triangle POQ is the capacity of
machine A and the line PQ is the boundary line for capacity of
machine A.
Similarly figure 2.2 show the Capacity line RS for machine B. and
the triangle ROS shows the capacity of machine B i.e., the machine
B can manufacture 3 units of product Y alone or 8 units of product
X alone.
Figure 2.2. Graph for machine B
The graph2.3 shows that machine C has a capacity to manufacture
5 units of Y alone or 3.5 units of X alone. Line TU is the boundary
line and the triangle TOU is the capacity of machine C.
The graph is the combined graph for machine A and machine
B. Lines PQ and RS intersect at M. The area covered by both the
lines indicates the products (X and Y) that can be manufactured by
using both machines. This area is the feasible area, which satisfies
the conditions of inequalities of machine A and machine B. As X
and Y are processed on A and B the number of units that can be
manufactured will vary and the there will be some idle capacities
on both machines. The idle capacities of machine A and machine B
are shown in the figure 2.4.
Figure 2.3. Graph for machine C
Figure 2.4. Graph of Machines A and B
Figure 2.5 shows the feasible area for all the three machines combined.
This is the fact because a products X and Y are complete when they are
processed on machine A, B, and C. The area covered by all the three lines
PQ. RS, and TU form a closed polygon ROUVW. This polygon is the
feasible area for the three machines. This means that all the points on the
lines of polygon and any point within the polygon satisfies the inequality
conditions of all the three machines. To find the optimal solution, we have
two methods.
Figure 2.5. Graph for machine A, B and C combined
Method 1. Here we find the co-ordinates of corners of the closed
polygon ROUVW and substitute the values in the objective function. In
maximization problem, we select the co-ordinates giving maximum value.
And in minimizations problem, we select the co-ordinates, which gives
minimum value.
In the problem the co-ordinates of the corners are:
R = (0, 3.5), O = (0, 0), U = (3.5, 0), V = (2.5, 1.5) and
W = (1.6, 2.4). Substituting these values in objective function:
5
Z (0, 3.5) = 5 × 0 + 7 × 3.5 = Br 24.50, at point R
Z (0, 0) = 5 × 0 + 7 × 0 = Br 00.00, at point O
Z (3.5, 0) = 5 × 3.5 + 7 × 0 = Br 17.5 at point U
Z (2.5, 1.5) = 5 × 2.5 + 7 × 1.5 = Br 23.00 at point V
Z (1.6, 2.4) = 5 × 1.6 + 7 × 2.4 = Br 24.80 at point W
Hence the optimal solution for the problem is the company has to
manufacture 1.6 units of product X and 2.4 units of product Y, so that it
can earn a maximum profit of Br 24.80 in the planning period.
Method 2. Iso profit Line Method:
Iso profit line, a line on the graph drawn as per the objective function,
assuming certain profit. On this line any point showing the values of x and
y will yield same profit. For example in the given problem, the objective
function is Maximize Z = 5x + 7y. If we assume a profit of Br 35/-, to get
Br 35, the company has to manufacture either 7 units of X or 5 units of Y.
Hence, we draw line ZZ (preferably dotted line) for 5x + 7y = 35. Then
draw parallel line to this line ZZ at origin. The line at origin indicates zero
rupees profit. No company will be willing to earn zero rupees profit.
Hence slowly move this line away from origin. Each movement shows a
certain profit, which is greater than Br0.00. While moving it touches
corners of the polygon showing certain higher profit. Finally, it touches the
farthermost corner covering all the area of the closed polygon. This point
where the line passes (farthermost point) is the OPTIMAL SOLUTION
of the problem. In the figure 2.6. the line ZZ passing through point W
covers the entire area of the polygon, hence it is the point that yields
highest profit. Now point W has co-ordinates (1.6, 2.4). Now Optimal
profit Z = 5 × 1.6 + 7 × 2.4 = Br 24.80.
6
7
