Professional Documents
Culture Documents
Assignment PDF
Assignment PDF
production of one X is 2 birr and of one Y is 3 birr. Each of the two machines the factory
owns works 8 hours a day and 6 days per week. A table below shows the productivity of
the machines in terms of time requirements. One X requires 19m2 and one Y requires 7
m2 of space for storage and the total storage area available is 133, 000 m 2. Weekly
production of X cannot exceed 6000 and that of Y 9000 due to the limited market
demand.
Machine X Y
M1 20 Sec. 15 Sec.
M2 10 Sec. 18 Sec.
a. Write the linear Programming problem assuming that the manager wants
to maximize profit.
b. Write the dual LP
2. A firm produces two types of outputs, X1 and X2 using two types of inputs according to
X1 X2
3. a) Maximize = 2X + 3Y
Subject to:
X, Y 0
Subject to:
ai 0
4. a) Maximize = 3X1 + 2X2
Subject to:
2X1 + 3X2 12
2X1 + X2 8
X1, X2 0
Subject to:
2Y1 + 2Y2 3
3Y1 + Y2 2
Y1, Y2 0
Subject to:
X1 + 3X2 + 6X3 48
X1 + 6X2 + 3X3 90
X1, X2, X3 0
3X1 + 4X2 + X3 40
X1, X2, X3 0
c. Maximize Z = -X1 + X2 + 3X3
Subject to:
3X1 + 2X2 + X3 3
2X1 + X2 + 2X3 2
X1, X2, X3 0
Subject to:
X1 + X2 + 5X3 25
X1, X2, X3 0
6. Three products are processed through three different machines. The time required per
unit of each product, the daily capacity of the machines and the net profit per unit sold for
each product are given below:
Time required Machines capacity
M1 5 2 4 52
M2 0 4 3 55
M3 2 3 6 50
(Birr)
Build up a linear programming model of the above production-planning problem and find the
optimum daily production for the three products that maximizes the net profit.