0% found this document useful (0 votes)
87 views3 pages

Operations Research Test Paper

This document contains 5 main questions from 2 modules of an Operations Research exam. Question 1 asks to find an initial basic feasible solution to two transportation problems using different methods. Question 2 involves assigning jobs to machines based on expected profits with some machine-job restrictions. Question 3 defines key terms in operations research like feasible solution, optimal solution, and zero-sum game. Question 4 explains the Hungarian algorithm for solving assignment problems. Question 5 presents a transportation problem and asks to determine the optimal distribution to maximize total transportation cost. It also provides an assignment problem and asks to solve it.

Uploaded by

Aasim Inamdar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
87 views3 pages

Operations Research Test Paper

This document contains 5 main questions from 2 modules of an Operations Research exam. Question 1 asks to find an initial basic feasible solution to two transportation problems using different methods. Question 2 involves assigning jobs to machines based on expected profits with some machine-job restrictions. Question 3 defines key terms in operations research like feasible solution, optimal solution, and zero-sum game. Question 4 explains the Hungarian algorithm for solving assignment problems. Question 5 presents a transportation problem and asks to determine the optimal distribution to maximize total transportation cost. It also provides an assignment problem and asks to solve it.

Uploaded by

Aasim Inamdar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

USN 1 S G

SAPTHAGIRI COLLEGE OF ENGINEERING


Department of Computer Science and Engineering
Internal Assessment Test –II
Subject: Operations Research Sub Code: 17CS653
Semester/Section: VI A &B Marks: 30
Duration: 1 hours Date: 15/5/2020
Note: Answer any two full questions, choosing one from each module
Bloom’s
Main Sub
Full Question Taxono
Questio Questio Marks Cos
my
n n
Level
Module 4
Find an initial basic feasible solution using North West corner rule and
Vogel’s approximation methods for the following transportation
problem.

19 30 50 10 7
a 8 L1, L2 CO3
70 30 40 60 9

40 8 70 20 18

5 8 7 14

Find an initial solution to the following transportation problem where


1
the cost matrix is given below.

A B C D

I 1 5 3 3 34

b II 3 3 1 2 15 7 L3,L4 CO3

III 0 2 2 3 12

IV 2 7 2 4 19

21 25 17 27

OR

The owner of a small machine shop has four machines available to


assign for the jobs. Five jobs are offered to assign, with the expected

2 a. profits in hundreds of rupees for machine on each job being as 8 L3 CO1


follows:
Job

1 2 3 4 5

A 6.2 7.8 * 10.1 8.2

B 7.0 8.4 6.5 7.5 6.0

C 8.7 9.2 11.1 7.0 8.2

D * 6.4 8.7 7.7 8.0

Machines
* indicates that machine A and D cannot perform jobs 3 and 1
respectively. Find the assignment

Define the following terms:


i) feasible solution ii) non degenerate solution
b iii)Basic feasible solution iv) optimal solution 7 L3 CO1
v) Saddle point vi) is zero sum game
vii) pay-off

Module 5

a Explain Hungarian algorithm 5 L1, L2 CO3

The transportation costs per truck load of cement ( in hundred of


rupees) from each plant to each project site are as follows:

Project Site Supply

1 2 3 4

F 2 3 11 7 6
1
3 Factories
10
b F 1 0 6 1 1 L3 CO3
2

F 5 8 15 9 10
3

Demand 7 5 3 2 17

Determine the optimal distribution for the company so as to


maximize the total transportation cost.

OR
a Solve the following assignment problem:
M1 M2 M3 M4 M5
J1 11 17 8 16 20
J2 9 7 12 6 15 5 L1, L2 CO4
J3 13 16 15 12 16
J4 21 24 17 28 26
J5 14 19 12 11 13
b A department has five employees with five jobs to be performed. The
time (in hours) each men will take to perform each job is given in the
effectiveness matrix.
4
Employees

I II III IV V

A 10 5 13 15 16 10 L3 CO4

B 3 9 18 13 6
Jobs
C 10 7 2 2 2

D 7 11 9 7 12

E 7 9 10 4 12

You might also like