JALPAIGURI GOVERNMENT ENGINEERING COLLEGE
|A GOVERNMENT AUTONOMOUS COLLEGEJ
COE/B.TECH/CSE/OEC-CS701A/2022-2023
2022
OPERATIONS RESEARCH
Full Marks: 70
Times: 3 Hours
The figures in the margin indicate full
Candidales are requested to write their answers in their own marks.
words as far as practicable.
GROUP-A
Answer allquestions |OBJECTIVE TYPE QUESTIONSI
What are slack, surplus & Sx2-10
2 Show that X={x:|x|s2} Artificial variables ?
is Convex set.
Find the basic feasible
3 solutions of the system of equations
X,+x,+X;=8,
3x,+2x,=18, Xi,X,X3 2 0
4 What is unbalanced
transportation problem?
Solve the game value with the pay of
matrix,
5 1
3 4
GROUP-B
|LONG ANSWER TYPE QUESTIONSI
Answer any four questions
6 i). Food X contains 6 units of 4x|5=60
vitamin Aper gram and 7 units of vitamin B per gram and Costs 5+10
Rs. 12 per gram. Food Y contains 8 units of
vitamin A per gram and 12 units of vitamin Bper
gram and costs Rs. 20 per gram. The daily
are 100 and 120units respectively. Find the
minimum requirements of vitamin Aand vitamin B
minimum cost of the product mix.
ii). Solve the Games with the following payoff
matrix.
Player A
5 -1
-4 -1 6 -5
Player B
7 i).The Head of the department has four jobs A,B, C,D,E and five sub-ordinates V,W,X, Y, Z. The number of hours
10+5
each man would take to perform each job is as follows:
V W
6 5 8 11 16
1 13 16 1 10
16 11 8
D 9 14 12 10 16
E 10 13 11 8 16
How would the jobs be allocated to minimize the total time ?
Solvethe Games with the following payoff matrix
5
20
5
4 6
8 1). Obtain an optimal basic feasitble
solution (using VAM with optimality test) to the
following transportation problem; 10+5
4 Supply
6
6 8 40
8 6
C 7 60
7 6
Demand 8 50
30
50
ii). Using the graphical method, find the
the constraints
maximum value of z=7x1 + 10x2 subject to
xl+x2 s 30000, x2 s 12000,
x126000, x12 x2, x1, x2 2 0
9 A
project has the following time schedule:
Activity 1-2 1-6 2-3 2-4 3-5 4-5 6-7 5-8
(4+4+3+4)
7-8
Pessimistic 1 2 2 2 7
Time(week) 5 3 8
Most likely 7 5 14
10 5
Time(week) 3 17
Optimistic 13 14 26 8 19 17 29
Time(week) 9 32
Draw the network diagram.
Calculate variance of each activity,
Calculate critical path and project length.
"Find total float and free float in each non
critical path
10. i) Solve by Simplex method
7+8
Maximize Z=3x,+2x, , Subjects to 2 x,+x,s12, 6x,+5x,s40, X,X,20.
i). Solve by Simplex method
Maximize Z=3x,-X, , Subjects to 2 X, +X,22, x,+3x,S3, X,S4, X1,X,20.
||. i). Find the dual of Minimize Z=x +4x,+3x;
(5) 8+7
Subject to X-3x,+4X;= 5,
X,-2x,s3,
2x,-X;24, X1,X,>0 & x unrestricted in sign.
ii).Solve by Dual Simplex method
Minimize Z= 15x,+10x,
Subject to 3x1+5x,>5,
5X,+2x,23,
X1,X)2 0
Solve the Games with the following payoff matrix
3
20
5 4 6
4
0 -5
8 1). Obtain an optimal basic
feasible solution (using VAM with optimality test) to the
following transportation problem; 10+5
A
4 Supply
B 6
8
8 40
6
7
7 60
Demand 20 6
8
30 50
50
ii). Using the graphical
the constraints
method, find the maximum value of z =7x1 +
x1+x2 s 30000, x2 s 12000, 10x2 subject to
9
x126000, x12 x2, x1, x2 2 0
Aproject has the
Activity following time schedule:
1-2 1-6 2-3 2-4 3-5 4-5 6.7
(4+4+3+4)
5-8 7-8
Pessimistic 2 2
Time(week) 7 5 3 8
Most likely 7
14 5
Time(week) 10
3 17
Optimistic 13 14 26 8
Time(week) 19 17 29 9 32
Draw the network diagram.
Calculate variance of each activity,
Calculate critical path and project length.
"Find total float and free float in each non critical path
10. i) Solve by Simplex method
Maximize Z=3x, +2x,, Subjects to 2 x+x,s12, 7+8
i). Solve bySimplex method 6x,+5x,s40, X,X,20.
Maximize Z=3x,-x, , Subjects to 2 X+x,22, x1+3x,S3, X,s4,
X,X,20.
11. i). Find the dual of Minimize
Z=x,+4x,+3x, 8+7
Subject to X-3x,+4%3= 5, (5)
X,-2x,s3,
2x,-X;24, X,X,>0 & x unrestricted in sign.
ii).Solve by Dual Simplex method
Minimize Z= 15x,+10x,
Subject to 3x,+5x,25,
5X,+2x,23,
X,X)> 0
COLLEGE
JALPAIGURIGOVERNMENT ENGINEERING
COLLEGEJ
|A GOVERNMENT AUTONOMOUS
COE/B.TECH./CSE/OEC-CS701A/2022-2023
2022
OPERATIONS RESEARCH
Full Marks: 70
Times:3 Hours
The figures in the margin indicate full marks.
Candidates are requested lo write their answers in their own words as far as praclicable.
GROUP-A
|OBJECTIVE TYPE QUESTIONS| 5x2=10
Answer all questions
What are slack, surplus&Artificial variables ?
Show that X={x:|x|s2} is ConvexX set.
Find the basic feasible solutions of the system of equations
3 X+X,+X=8, 3x1+2x,=18, X1,X),X3>0
4 What is unbalanced transportation problem?
Solve the game value with the pay of matrix,
5 1
5
3 4
GROUP-B
|LONG ANSWER TYPE QUESTIONS|
Answer any four questions 4x15-60
5+10
6 i). Food Xcontains 6 units of vitamin A per gram and 7 units of vitamin B per gram and Costs
Rs. 12 per gram. Food Y contains units of vitamin A per gram and 12 units of vitamin Bper
gram and costs Rs. 20 per gram.The daily minimum requirements of vitamin Aand vitamin
are 100 and120 unitsrespectively. Find theminimum cost of the product mix.
ii). Solve the Games with the following payoff matrix.
Player A
-5 -1
-4 -1 6 5
Player B
V,W,X,Y,Z. The number of hours 10+5
7. i).The Head of the department has four jobs A,B,C,D,E and five sub-ordinates
each man would take to perform each job is as follows:
X X
A 6 5 11 16
coo
13 16 10
B 1
16 11 8 8
C
9 14 12 10 1¬
10 13 11 16
E
total time ?
How would the jobs be allocated to minimize the
\atrix
1
20
6
8 4
1). Obtain an -2
optimal basic feasible
solution (using VAM with
optimality test) to the following
Demand
6
transportation problem; 10+5
i). Using the
20
30
6
6
R
Supply
40
the
const raintSgraphical method, find the
50
50
60
9
A
x1+x2 s
30000, x2s maximum value of z=7x1 +10x2
project has the 12000, x16000, x12 x2, subject to
Activity following time schedule:
1-2
1-6 X1, x2 2 0
Pessimistic 2-3
2-4
TiMostme(week)
likely 4-5 6-7 5-8
TiOptimistic
me(week)
7
5
14
2
7-8 (4+4+3+4)
13 10
Time(week) 14
26 8 3
Draw the network 19
17
17
Calculate variance ofdiagram.
each activity,
32
Calculate
"Find total critical
float and path and project
free float in each length.
non critical path
10.
i) Solve by
Simplex method
i). Solve by Maximize Z =3x1 +2x,, Subjects to 2
Simplex method x+x,s12, 6x;+5x,s40, 7+8
Z Maximize =3x1 -X, ,
Subjects to 2 x,+x,22,
X1,X,20.
|1. i). Find the x,+3x,83, x,s4, X1,X,20.
dual of Minimize
Subject to Z=x,+4x,5,+3x,
X,-3x,+4xJ= (5) 8+7
X-2x,s3,
ii).Solve by Dual Simplex method 2x,-X;24, X,X,> 0 &x;
Minimize Z= 15x,+10x, unrestricted in sign.
Subject to 3x,+5x,2 5,
5X,+2x,23,
X1,X}> 0
COLLEGE
JALPAIGURIGOVERNMENT ENGINEERING
JAGOVERNMENT AUTONOMOUS COLLEGEJ
COE/B.TECH/CSE/OEC-CS701A/2022-2023
2022
OPERATIONS RESEARCH
Full Marks: 70 Times: 3 Hours
The figures in the margin indicate full marks.
Candidates arerequested towrite their answers in their own words as far as practicable.
GROUP-A
|OBJECTIVE TYPE QUESTIONS.
Answer all questions 5x2=10
1. What are slack, surplus & Artificial variables ?
2. Show that X={x:|x\<2} is Convex set.
Find the basic feasible solutions of the system of equations
3. Xj+X,+X;=8, 3x1+2x,=18, X1,X2,X3 20
4. What is unbalanced transportation problem?
Solve the game value with the pay of matrix,
5 1
5
3 4
GROUP-B
|LONGANSWER TYPE QUESTIONS]
Answer any four questions 4x15=60
6. i). Food X contains 6 units of vitamin A per gram and 7 units of vitamin B per gram and Costs 5+10
Rs. 12 per gram. Food Ycontains &units of vitamin Aper gram and 12 units of vitamin Bper
gram and costs Rs. 20 per gram. The daily minimum requirements of vitamin A and vitamin B
are 100 and 120 units respectively. Find the minimum cost of the product mix.
ii). Solve the Games with the following payoff matrix.
Player A
5 0 3
-4 -1 6 5
Player B
sub-ordinates V,W,X,Y,Z. The number of hours 10+5
7. i).The Head of the department has four jobs A,B,C,D,E and five
follows:
each man would take to perform each job is as
W X
6 5 8 11 16
A
13 16 1 10
1
11 8 8
C 16
14 12 10 16
D
13 11 8 16
E 10
minimize the total time ?
How would the jobs be allocated to
) solve the Games with the
following payoff matrix
3 1 20
5
6
0 -5
8 1). Obtain an optimal
basic feasible solution (using VAM with
optimality test) to the following
A
4
transportation problem;
IV
10+5
6 Supply
C 8
6 40
5 7
Demand 7 60
20 6
30 8
50 50
ii). Using the graphical 50
method, find the
x1+x2 s 30000, x2< maximum value of z=7x1+ 10x2
the constraints
12000, subject to
9.
x16000, X12 x2, x1, x2 2 0
Aproject has the
Activity following time
1-2 1-6
schedule:
Pessimistic
2-3 2-4 3-5 4 6-7 5-8 7-8
(4+4+3+4)
2
2
Time(week) 2 5 5
8
Most likely 7
14
Time(week)
Optimistic 13
5 10
17
14 26
Time(week) 19 17 29
32
Draw the network diagram.
Calculate variance of each activity ,
Calculate critical path and project length.
"Find total float and free float in each non
critical path
10. i) Solve by Simplex method
Maximize Z=3x1 +2x) , Subjects to 2 x1+x,s12, 7+8
ii). Solve by Simplex method 6x,+5x,s40, X,X,20.
Maximize Z =3x,-X,, Subjects to 2 x1+x,22, X+3x,s3, Xs4, X1,X,20.
|1. i). Find the dual of Minimize
Z=x,+4x,+3x3 (5 8+7
Subject to XË3x,+4x,= 5,
X,-2x,s3,
2x,-X;24, X1,X)> 0 &x, unrestricted in sign.
ii).Solve by Dual Simplex method
Minimize Z= 15x,+10x,
Subject to 3x,+5x,> 5,
5X,+2x,23,
X1,X,>0