Bharathidasan Institute of Management

Operations Research
Assignment- 1
(Submit on or before 7/11/2019)
1) Maximize Z = 2𝑥1 - 𝑥2 + 2𝑥3
Subject to 2𝑥1 + 𝑥2 ≤ 10
𝑥1 +2𝑥2 - 2𝑥3 ≤ 20
𝑥2 + 2𝑥3 ≤ 5
𝑥1 ≥ 0, 𝑥2 ≥ 0, 𝑥3 ≥ 0

2) Find the Minimum value of

Z = 3𝑥1 + 2𝑥2
Subject to 2𝑥1 + 𝑥2 ≥ 6
𝑥1 +𝑥2 ≥ 4
𝑥1 ≥ 0, 𝑥2 ≥ 0

Using graphical method as well as simplex method

3) A petroleum company owns two refineries. Refinery 1 costs Rs 20000 per day to operate and
refinery 2 costs Rs 25000 per day to operate. The table shows the numbers of barrels
of each grade of oil the refineries can produce each day.

Grade Refinery 1 Refinery 2

High grade 400 300
Medium grade 300 400
Low grade 200 500

The company has orders totaling 25000 barrels of high grade oil, 27000 barrels of medium
grade oil and 30000 barrels of low grade oil. How many days should it run each refinery to
minimize its cost and still refine enough oil to meet its orders. Formulate the problem as an
LPP.

4) Maximize Z = 3x + 2y + 4z
Subject to 3x + 2y + 5z ≤ 18
4x + 2y + 3z ≤ 16
2x + y + z ≥ 4
x ≥ 0, y ≥ 0, z ≥ 0
Using Big M method and Two- Phase method. Also write the dual of this LPP

5) Write the dual of

Min Z = 2y + 5z
Subject to x + y ≥ 2
2x + y + 6z ≤ 6
x – y + 3z = 4
x, y, z ≥ 0

Solve both the primal and dual.

6) Solve the following Transportation Problem (TP)

City 1 City 2 City 3 City 4 Supply

Plant 1 8 6 10 9 35
Plant 2 9 12 13 7 50
Plant 3 14 9 16 5 40
Demand 45 20 30 30

7) A company has four machines and four jobs to be completed. Each machine must be
assigned to complete one job. The time required to set up each machine for completing
each job is shown below. Find the optimal assignment that minimizes the total time.

Machine Job 1 Job 2 Job 3 Job 4

M1 14 5 8 7
M2 2 12 6 5
M3 7 8 3 9
M4 2 4 6 10

8) A travelling salesman has to cover a set of 5cities (his own included) periodically( say once
per week ) and return home. The distances between the cities are given in the following
table. Determine the most economical cycle.

1 2 3 4 5
1 -- 137 217 164 58
2 132 -- 290 201 79
3 217 290 -- 113 303
4 169 201 113 -- 196
5 58 79 303 196 --