10CS661 Ia2 QB

MVJ COLLEGE OF ENGINEERING
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Question Bank for Internal Assessment Test II (3 Units)
Subject Subject UnitNo

Semester VI 10CS661 Operations Research 4,5,6
Code Name .
Each Full Question below carries 12.5 marks
Solve the linear programming model using simplex method, revised simplex and dual
C314.2 simplex method.
Solve the transportation and assignment problems.

C314.3
The following are the knowledge levels according Blooms taxonomy
K1 Remember K2- Understand K3-Apply K4-Analyze K5-Evaluate K6-Create
UNIT-4
Knowledge
Marks CO Code
level
Write short notes on the following
i. Weak Duality property
ii. Strong Duality property
1 iii. Complementary solution property 12.5M C314.2 K3
iv. Complementary optimal solution property
v. Symmetry property
vi. Duality theory
Use the revised simplex method to solve the LPP
2 Max Z=6x1-2x2+3x3 12.5M C314.2 K3
STC: 2x1-x2+2x3<=2; x1+4x3<=4; x1,x2,x3>=0
3 Max Z=2x1+x2 12.5M C314.2 K3
STC: 3x1+4x2<=6; 6x1+ x2<=3; x1,x2>=0
4 Max Z=x1+2x2 12.5M C314.2 K3
STC: x1+x2<=3; x1+2x2<=5; 3x1+x2<=6 x1,x2>=0
5 Max Z=4x1+3x2+6x3 12.5M C314.2 K3
STC: 3x1+x2+3x3<=30; 2x1+2x2+3x3<=40; x1,x2,x3>=0
6 Max Z=3x1+5x2 12.5M C314.2 K3
STC: x1<=4; x2<=6; 3x1+2x2<=18 x1,x2>=0
UNIT-5
Knowledge
Marks CO Code
level
Use dual simplex method to solve the LPP
1 Max Z=-3x1-2x2 12.5M C314.2 K3
STC: x1+x2>=1; x1+x2>=7; x1+2x2>=10; x2>=3 x1,x2>=0
Find the dual of the given primal problem and solve using
dual simplex method
2 12.5M C314.2 K3
Max Z=6x1 +8x2
STC: 5x1+2x2 <=20; x1+2x2 <=10 x1,x2>=0
3 Find the dual of the given primal problem 12.5M C314.2 K3
i) Min Z=3x1 + x2
STC: x1+x2>=1; 2x1+3x2>=2 x1,x2>=0
ii) Max Z=16x1 +14x2 +36 x3 +6 x4
STC: 4x1+4x2 +14 x3 +8 x4 =21;
13x1+17x2 +80 x3 +2 x4 <=48
x1,x2>=0, x3, x4- Unrestricted
4 Min Z=2x1+x2 12.5M C314.2 K3
STC: 3x1+x2>=3; 4x1+3x2>=6; x1+2x2>=3; x1,x2>=0
Min Z=2x1+2x2+4x3
5 12.5M C314.2 K3
STC: 2x1+3x2+5x3>=2; 3x1+x2+7x3<=3; x1+4x2+6x3<=5
x1,x2,x3>=0
Find the dual of the given primal problem and solve using
dual simplex method
6 12.5M C314.2 K3
Max Z=3x1+5x2
STC: x1<=4; x2<=6; 3x1+2x2<=18 x1,x2>=0
UNIT-6
Knowledge
Marks CO Code
level
A company has three car manufacturing factories located in
cities C1,C2,C3 which can supply cars to four showrooms
located in town T1,T2,T3,T4. Each plant can supply 6,1 and 10
truckload of cars daily respectively. The daily requirements of
showroom are 7,5,3 and 2 truck loads respectively. The
1 a transportation cost per truckload of cars(in thousands of 6.5M C314.3 K3
rupees) from each factory to each show room are as follows.
Find the optimum distribution schedule and cost.
2 3 11 7
1 0 6 1
5 8 15 9
Find an initial basic feasible solution by Vogels
Approximation method.
D1 D2 D3
1 b O1 50 30 200 1 6M C314.3 K3
O2 90 45 170 3
O3 250 200 50 4
4 2 2
A company has three plants at locations F1,F2 and F3, which
supply to warehouses located at W1,W2 and W3. Monthly
plant capacities are 200,160 and 90 units respectively.
Monthly warehouse requirement are 180,120,150 units
respectively. Unit transportation costs are given below.
2 a Determine optimal distribution for the company in order to 8.5M C314.3 K3
minimize the total transportation cost.
W1 W2 W3
F1 16 20 12
F2 14 8 18
F3 26 24 16
Find the feasible solution of the following
transportation problem using NWC method.
W1 W2 W3 W4
2 b F1 14 25 45 5 6 4M C314.3 K3
F2 16 25 35 55 8
F3 35 3 65 15 16
4 7 6 13
3 a Consider the following transportation problem 12.5M C314.3 K3
I II III IV
A 5 2 4 3 22
B 4 8 1 6 15
C 4 6 7 5 8
7 12 17 9
The IBFS is found as
12 units from A to II
1 unit from A to III
9 units from A to IV
15 units from B to III
7 units from C to I
And 1 unit from C to III
a. Check the above schedule is optimal.
b. Find the optimal solution and minimum cost.
Write different steps in Hungarian algorithm to solve

4 a 4M C314.3 K3
an assignment problem.
Solve the following TSP
a b c d E
A - 2 5 7 1
8.5M
4 b B 6 - 3 8 2 C314.3 K3
C 8 7 - 4 7
D 12 4 6 - 5
E 1 3 2 8 -
The owner of a small machine shop has four
machinists available to assign the jobs. Five jobs are
offered with the expected profit in rupees for each
machinist on each job as show below.
a B c D e
1 6.20 7.80 5.00 10.10 8.20
5 a 12.5M C314.3 K3
2 7.10 8.40 6.10 7.30 5.90
3 8.70 9.20 11.10 7.10 8.10
4 4.80 6.40 8.70 7.70 8.00
Find the assignment of machinists to jobs that will
result in a maximum profit. Which job should be
declined?
A product is produced by 4 factories F1,F2,F3,F4 .
Their unit production costs are Rs. 2,3,1 and 5
respectively. Production capacity of the factories are
50,70,30 and 50 units respectively. The product is
supplied to 4 stores S1,S2,S3 and S4 the
requirements of which are25,35,105 and 20
respectively. Unit costs of transportation are given
below.
6 a Factory 1 2 3 4 12.5M C314.3 K3
/Store
1 2 4 6 11
2 10 8 7 5
3 13 3 9 12
4 4 6 8 3
Find the transportation plan such that the total
production and transportation cost is minimum.

10CS661 Ia2 QB

Uploaded by

Copyright:

Available Formats

10CS661 Ia2 QB

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

10CS661 Ia2 QB

Uploaded by

Copyright:

Available Formats

MVJ COLLEGE OF ENGINEERING

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Subject Subject UnitNo

Each Full Question below carries 12.5 marks

Solve the transportation and assignment problems.

The following are the knowledge levels according Blooms taxonomy

K1 Remember K2- Understand K3-Apply K4-Analyze K5-Evaluate K6-Create

Write different steps in Hungarian algorithm to solve

You might also like