Date - 07/08/2016 E.

Hawassa University Daye campus

Department of Agricultural Economics
Operation Research Group assignment
o For group 1, 3, 5 question number 2, 4 and 5
o For group 2, 4, 6 question number 1, 3 and 6
Last Date of submission of assignment: 15/08/16 E.C

Assignment questions

1. An organization is interested in the analysis of two products which can be produces from
the idle time of labour, machine and investment. It was notified on investigation that the
labour requirement of the first and the second products was 4 and 5 units respectively and
the total available man hours was 48. Only first product required machine hour utilization
of one hour per unit and at present only 10 spare machine hours are available. Second
product needs one unit of byproduct per unit and the daily availability of the byproduct is
12 units. According to the marketing department the sales potential of first product
cannot exceed 7 units. In a competitive market, first product can be sold at a profit of
Rs.6 and the second product at a profit of Rs.10 per unit. Formulate the problem as a
linear programming model. Also determine graphically the feasible region. Identify the
redundant constraints if any.
 2. The agricultural research institute of Ethiopia suggested to a farmer to spread out at least
4,800kg of a special phosphate fertilizer and not less than 7,200kg of a special nitrogen
fertilizer to raise productivity of crops in his fields. There are two sources for obtaining
these mixtures A and B. both of these are available in bags weighing 100kg each and they
cost Birr 40 and 24, respectively. Mixture A contains phosphate and nitrogen equivalent
of 20kg and 80kg respectively, while mixture B contains these ingredients equivalent of
50kg each. Determine how many bags of each type the farmer should buy in order to
obtain the required fertilizer at minimum cost.
3. Solve the following linear programing problem by simplex method?
Min. Z = 100X1 + 400X2
Subject to:
2X1 + X2 ≥ 50
X1 + 3X2 ≥ 30
X1, X2 ≥ 0
4. Solve the following linear programing problem using simplex method approach
Max Z = 1000X1 + 1200X2
Subject to
10X1 + 5X2 ≤ 200
2X1 + 3X2 ≤ 60
X1 ≤ 34
X1 ≤ 14
X1, X2 ≥ 0

5. Solve the following linear programing problem using the graphic method.
Minimize Z = X1 + 1.5X2
Subject to
X1 + X2 ≥ 8
X1 + 2X2 ≥ 10
X1 ≥ 2
 X1, X2 ≥ 0
6. Solve the following linear programing problem by graphical method
Maximize Z = 5X1 + 3X2
Subject to constraints
2X1 + X2 ≤ 1000
X1 ≤ 400 X2 ≤ 700
X1, X2 ≥ 0