Assignment 1

Operations Research (MEE411)

B.Tech (ME) VII Semester Last Date : 23/09/2018

1. Explain different assumptions used in linear programming model.

2. A manufacturing company is engaged in producing three types of products: A, B and C. the
production department produces, each day, components sufficient to make 50 units of A, 25
units of B and 30 units of C. The management is confronted with the problem of optimizing the
daily production of the products in the assembly department, where only 100 man-hours are
available daily for assembling the products. The following additional information is available:
Type of product Profit contribution per unit of Assembly time per product
products (Rs.) (hrs.)
A 12 0.8
B 20 1.7
C 45 2.5
Formulate the problem as a LP model and find the optimal solution using graphical method.
3. The company has a daily order commitment for 20 units of product A and a total of 15 units of
product B and C. Formulate this problem as LP model so as to maximize the total profit.
A company has two plants, each of which produces and supplies two products: A and B. The
plants can each work up to 16 hours a day. In plant 1, it takes 3 hours to prepare and pack 1000
gallons of A and 1 hour to prepare and pack 1 quintal of B. In plant 1, it costs Rs 15000 to
prepare and pack 1000 gallons of A and Rs 28000 to prepare and pack a quintal of B, whereas in
plant 2 these costs are Rs 18000 and Rs 26000 respectively. The company is obliged to produce
daily at least10000 gallons of A and 8 quintals of B. Formulate the problem as a LP model to find
out as to how the company should organize its production so that the required amount of the
two products be obtained at the minimum cost.
4. Use the graphical method to solve the following LP problem
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 15 𝑥1 + 10 𝑥2
𝑆𝑢𝑏𝑗𝑒𝑐𝑡𝑒𝑑 𝑡𝑜, 4 𝑥1 + 6 𝑥2 ≤ 360
3 𝑥1 + 0 𝑥2 ≤ 180
0 𝑥1 + 5 𝑥2 ≤ 200
𝑥1 , 𝑥2 ≥ 0
5. A company makes two kinds of leather belts, belt A and belt B. Belt A is a high quality belt and
belt B is of lower quality. The respective profits are Rs 4 and Rs 3 per belt. The production of
each of type A requires twice as much time as belt of type B, and if all belts were of type B, the
company could make 1000 belts per day. The supply of leather is sufficient for only 800 belts per
day (both A and B combined). Belt A requires a fancy buckle and only 400 of these are available
per day. There are only 700 buckles a day available for belt B. what should be the daily
production of each type of belt? Formulate this problem as a LP model and solve it using the
simplex method.
6. Use the Big-M method to solve the following LP problem
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 𝑥1 + 2 𝑥2 + 3 𝑥3 − 𝑥4
𝑆𝑢𝑏𝑗𝑒𝑐𝑡𝑒𝑑 𝑡𝑜, 𝑥1 + 2 𝑥2 + 3 𝑥3 = 15
2 𝑥1 + 𝑥2 + 5 𝑥3 = 20
 𝑥1 + 2 𝑥2 + 𝑥3 + 𝑥4 = 10
𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 ≥ 0

7. Use the Two Phase method to solve the following LP problem

𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = 12 𝑥1 + 18 𝑥2 + 15 𝑥3
𝑆𝑢𝑏𝑗𝑒𝑐𝑡𝑒𝑑 𝑡𝑜, 4 𝑥1 + 8 𝑥2 + 6 𝑥3 ≥ 64
3 𝑥1 + 6 𝑥2 + 12 𝑥3 ≥ 96
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

8. Write the dual to the following LP problem

𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 𝑥1 − 𝑥2 + 3 𝑥3
𝑆𝑢𝑏𝑗𝑒𝑐𝑡𝑒𝑑 𝑡𝑜, 𝑥1 + 𝑥2 + 𝑥3 ≤ 10
2 𝑥1 − 𝑥2 − 𝑥3 ≤ 2
2 𝑥1 − 2𝑥2 − 3𝑥3 ≤ 6
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
9. Write the dual to the following LP problem
𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = 3 𝑥1 − 2 𝑥2 + 4 𝑥3
𝑆𝑢𝑏𝑗𝑒𝑐𝑡𝑒𝑑 𝑡𝑜, 3 𝑥1 + 5𝑥2 + 4 𝑥3 ≥ 7
6 𝑥1 + 𝑥2 + 3 𝑥3 ≥ 4
7 𝑥1 − 2𝑥2 − 𝑥3 ≤ 10
𝑥1 − 2 𝑥2 + 5 𝑥3 ≥ 3
4 𝑥1 + 7𝑥2 − 2 𝑥3 ≥ 2
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
10. There are five jobs, each of which has to go through the machines A, B and C in the order ABC.
Processing time in hours is given below. Determine a sequence of these jobs that will minimize
the total elapsed time. Also find total elapsed time and ideal time for each machine.
Job 1 2 3 4 5
Machine A 3 8 7 5 4
Machine B 4 5 1 2 3
Machine C 7 9 5 6 10
11. There are seven jobs, each of which has to go through the machines A and B in the order AB.
Processing time in hours is given below. Determine a sequence of these jobs that will minimize
the total elapsed time T. Also find T and ideal time for machine A and B.
Job 1 2 3 4 5 6 7
Machine A 3 12 15 6 10 11 9
Machine B 8 10 10 6 12 1 3

12. Explain the steps used in Hungarian method and solve the following assignment problem
Supplier
1 2 3 4
1 15 13 14 17
2 11 12 15 13
Customer
3 13 12 10 11
4 15 17 14 16