Problem 2.

6:
Solution:

Machines Products Available capacity in hours

(Time required in hours)
X Y
A 1 1 4
B 3 8 24
C 10 7 35
Profit per unit in hours 5 7

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 + 7y s.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

Graph:
Problem 2.8

Solution:

Graph:

Minimize Z = 1a + 1b S.T. Equations are: Minimise Z = 1a + 1b S.T

5a + 10b ≤ 50, 5a + 10b = 50

1a + 1b ≥ 1 1a + 1b = 1

0a + 1b ≤ 4 and both a and b are ≥ 0. 0a + 1b = 4 and both a and b are ≥ 0.

Figure 2.8 shows the graph. Here Isocost line coincides with side of the polygon, i.e., the line

MN. Hence the problem has innumerable solutions. Any value on line (1,1) will give same cost.
Optimal

cost is Re.1/-