Course Name: Operations Research

Assignment 1: LPP modeling and Solution

Work type: Individual Assignment
Total marks: 5%
Submission Date: ------------
1. A company manufactures four products A, B, C, and D. The profits are Birr 13, Birr 15, Birr 14 and
Birr 14.5 respectively. The firm has four machines and the required processing time in minutes for
each machine on each product is given below:
Products
A B C D
1 4 3 5 -
Machines 2 2 2 4 4
3 - 2 5 2
4 3 5 5 3

Machines 1, 2, 3 and 4 have 2000, 2500, 1800, and 1500 machine-minutes respectively. The firm
must manufacture at least 100 A’s, 200 B’s, 250C’s and 50 D’s but not more than 150 A’s. Set up an
LP model and also express it in a matrix form.
2. A garment product producing firm has manufacturing plants in Bahir Dar, Bure, and Woreta. The
daily production of each of these manufacturing plants is found to be 500, 300, and 100 units per day
respectively. Every day the firm must fulfill the needs of its two retailers located in Addis Ababa and
Mekelle which have daily demands of 550 and 350 respectively. The aggregate cost incurred as a
result of the production and transportation of each unit of the product is different from plant to plant
and their value including the selling expenses per unit at each of the retailing shop is shown in the
table below. The selling price per unit is 100 Birr and 80 Birr in Addis Ababa and Mekelle
respectively. Use graphical method to determine the amount of units of the product to be dispatched
from each plant to be sold at each retailing shop per day in order to maximize the total profit. Also
find the total profit per day.
Sum of production, transportation and selling costs (Birr per
Plants unit)
Retailers
Addis Ababa Mekelle
Bahir Dar 80 50
Bure 60 70
Woreta 90 45
3. Apply the necessary steps and solve the following linear programming problems
a. Maximize Z = 4x1+5x2-3x3+50,
Subject to x1 + x2 + x3 = 10
x1 – x2 ≥1
2x1 + 3x2 + x3 ≤ 40,
x1, x2,x3 ≥0
b. Minimize Z = x1 – 3x2 + 2x3
Subject to 3x1 – x2 + 2x3 ≥ 7
-2x1 + 4x2 ≤ 12
-4x1 + 3x2 + 8x3 ≤ 10
where x1, x2, x3 ≥ 0