OPERATIONS RESEARCH ASSIGNMENT FOR 3RD YEAR CSE, CSE-AI

LAST DATE OF SUBMISSION: MARCH 31, 2024

SOLVE ALL PROBLEMS ON A SHEET OF PAPER / COPY.

SCAN AND NAME THE FILE WITH FULL NAME & ID (e.g., file should be OSHMITA_0000)
FORMAT MUST BE PDF.

1. A travelling salesman must visit five cities. He wishes to start from a particular city, visit each
city once and then return to his starting point. The travelling cost of each city from a particular
city is given below:

A B C D E
A ∞ 2 4 7 1
B 5 ∞ 2 8 2
C 7 6 ∞ 4 6
D 10 3 5 ∞ 4
E 1 2 2 8 ∞

What should be the sequence of salesman (the optimal route) so that the cost is minimum and
what is the corresponding cost?

2. Solve the following transportation problem by the following methods:

a) North-West corner method

b) Row Minima method
c) Matrix Minima method
d) VAM

Destination Supply
2 11 10 3 7 4
Origin 1 4 7 2 1 8
3 9 4 8 12 9
Demand 3 3 4 5 6

Which method yields the best result for the above problem?

3. Check whether the vectors (1,2,3), (0,3,1), (1,0,1) are linearly independent. Justify your
answer.

4. Find the nature of the graph of the following inequations:

2𝑥1 + 3𝑥2 ≤ 6; 2𝑥1 + 3𝑥2 ≥ 6; 𝑥1 , 𝑥2 ≥ 0