Sapthagiri College of Engineering Department of Computer Science and Engineering Internal Assessment Test - I Usn 1 S G

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

USN 1 S G

SAPTHAGIRI COLLEGE OF ENGINEERING


Department of Computer Science and Engineering
Internal Assessment Test –I
Subject: Operations Research Sub Code: 17CS653
Semester/Section: VI A &B Marks: 30
Duration: 1 hours Date: 24/4/2020
Note: Answer any two full questions, choosing one from each module

Bloom’s
Main Sub Full Question
Marks Taxonom Cos
Question Question
y Level
Module 1
What is operations research? List and explain the six phases of
A 6 L1, L2 CO1
OR study.
A company produces two types of hats. Each hat of the first
type requires twice as much labour time as the second type. If all
hats are of the second type only, the company can produce a
total of 500 hats a day. The market limits daily sales of first and

B second types to 150 and 250 hats. Assuming that the profits per 6 L3,L4 CO1
1
hat are Rs. 8 for type I and Rs. 5 for type II. Formulate the
problem as a linear programming model in order to determine
the number of hats to be produced of each type so as to
maximize the profit.
Explain the following terms.
c (i)Feasible solution (ii)Optimal solution (iii)Unbounded 3 L1, L2 CO1
solution
OR

Use graphical method to solve the following LPP.


a. Zmin = 3x1 - 2x2 6 L3 CO1
Subject to -2x1 + x2 ≤ 9,
x1 - 5x2 ≥ -20 and x1, x2 ≥ 0
2
Use graphical method to solve the following LPP.
b Zmin = 3x1 - 2x2 6 L3 CO1
Subject to -2x1 + x2 ≤ 9, x1 - 5x2 ≥ -20 and x1, x2 ≥ 0
Use graphical method to solve the following LPP.
c Maximize Z = x1 + x2 3 L3 CO1
Subject to x1 + x2 ≤ 1, -3x1 + x2 ≥ 3 and x1, x2 ≥ 0

PTO

Bloom’s
Main Sub Full Question Mark
Taxonom Cos
Question Question s
y Level
Module 2
Define basic solution. Find all the basic solutions of the
following system of equations identifying in each case the basic
a 5 L1, L2 CO2
and non basic variables:
2x1 + x2 + 4x3 =11, 3x1 + x2 + 5x3 = 14

3 Solve the problem by simplex method


Maximize Z = 5x1 + 3x2
Subject to x1 + x2 ≤ 2, 10
b L3 CO2
5x1 + 2x2 ≤ 10,
3x1 + 8x2 ≤ 12, x1 ≥ 0 and x2
OR
a List and explain the assumptions of LPP 5 L1, L2 CO2
b Solve the following LPP by two phase simplex method.
Minimize z = 0.4x1 – 0.5x2
Subject to 0.3x1 + 0.1x2 ≤ 2.7
4
10 L3 CO2
0.5x1 + 0.5x2 = 6
0.6x1 + 0.4x2 ≥ 6
and x1, x2 ≥ 0

You might also like