JSPM's RAJARSHI SHAHU COLLEGE OF ENGINEERING,TATHAWADE ,PUNE-33 (An Autonom

Question Bank
Program- MCA
Course- S.Y.
SEMESTER- III
SUBJECT NAME- Optimization Technique
SUBJECT CODE- MCA2101

SR.NO. Q.1

OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
1 OPTION
Q.2
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
2 OPTION
Q.3

OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
3 OPTION
Q.4
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
4 OPTION
Q.5
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
4 OPTION
Q.6
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
5 OPTION
Q.7
 OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
6 OPTION
Q.8
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
7 OPTION
Q.9

OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
8 OPTION

Q.1

9 OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
OPTION
Q.2
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
10 OPTION
Q.3
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
11 OPTION
Q.4
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
12 OPTION
Q.5
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
13 OPTION
 Q.6
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
14 OPTION
Q.7
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
15 OPTION
Q.8
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
16 OPTION
Q.9
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
17 OPTION
Q.1
OPTION -A
OPTION -B
18
OPTION -C
OPTION
CORRECT-DANSWER
OPTION

Q.2

OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
19 OPTION
Q.3
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
20 OPTION
Q.4
OPTION -A
OPTION -B
OPTION -C
OPTION -D
21
UNIT NO. 1 Linear Programming
 CORRECT ANSWER
21 OPTION
UNIT NO. 1 Linear Programming Q.5
OPTION -A
OPTION -B
OPTION -C
OPTION -D
CORRECT ANSWER
22 OPTION

Q.6

OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
23 OPTION

Q.7

OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
24 OPTION
Q.8
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
25 OPTION
Q.9
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
26 OPTION
Q.1
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
27 OPTION
Q.2
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
28 OPTION
Q.3
OPTION -A
OPTION -B

29
 OPTION -C
OPTION
CORRECT-DANSWER
29 OPTION
Q.4
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
30 OPTION
Q.5
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
31 OPTION
Q.6
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
32 OPTION
Q.7
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
33 OPTION
Q.8
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
34 OPTION
Q.9
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
35 OPTION
Q.1
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
36 OPTION
Q.2
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
37 OPTION
 Q.3
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
38 OPTION
Q.4
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
39 OPTION
Q.5
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
40 OPTION
Q.6
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
41 OPTION
Q.7
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
42 OPTION
Q.8
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
43 OPTION
Q.9
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
44 OPTION
Q.10
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
45 OPTION
Q.11
OPTION -A
OPTION -B

46
 OPTION -C
OPTION
CORRECT-DANSWER
46 OPTION
Q.12
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
47 OPTION
Q.13
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
48 OPTION
Q.14
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
49 OPTION
Q.15
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
50 OPTION
Q.16
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
51 OPTION
Q.17
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
52 OPTION
Q.10
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
53 OPTION
Q.11
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
54 OPTION
 Q.12
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
55 OPTION
Q.13
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
56 OPTION
Q.14
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
57 OPTION
Q.15
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
58 OPTION
Q.16
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
59 OPTION
Q.17
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
60 Unit-II Special Cases in LP OPTION
Q.10
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
61 OPTION
Q.11
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
62 OPTION
Q.12
OPTION -A
OPTION -B

63
 OPTION -C
OPTION
CORRECT-DANSWER
63 OPTION
Q.13
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
64 OPTION
Q.14
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
65 OPTION
Q.15
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
66 OPTION
Q.16
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
67 OPTION
Q.17
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
68 OPTION
Q.10
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
69 OPTION
Q.11
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
70 OPTION
Q.12
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
71 OPTION
 Q.13
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
72 OPTION
Q.14
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
73 OPTION
Q.15
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
74 OPTION
Q.16
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
75 OPTION
Q.17
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
76 OPTION
Q.18
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
77 OPTION
Q.19
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
78 OPTION
Q.20
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
79 OPTION
Q.21
OPTION -A
OPTION -B

80
 OPTION -C
OPTION
CORRECT-DANSWER
80 OPTION
Q.22
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
81 OPTION
Q.23
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
82 OPTION
Q.24
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
83 OPTION
Q.25
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
84 OPTION
Q.18
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
85 OPTION
Q.19
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
86 OPTION
Q.20
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
87 OPTION
Q.21
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
88 OPTION
 Q.22
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
89 OPTION
Q.23
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
90 OPTION
Q.24
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
91 OPTION
Unit -III Sequential Model and Replacement Theory
Q.25
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
92 OPTION
Q.18
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
93 OPTION
Q.19
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
94 OPTION
Q.20
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
95 OPTION
Q.22
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
96 OPTION
Q.23
OPTION -A
OPTION -B

97
 OPTION -C
OPTION
CORRECT-DANSWER
97 OPTION
Q.24
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
98 OPTION
Q.25
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
99 OPTION
Q.18
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
100 OPTION
Q.19
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
101 OPTION
Q.20
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
102 OPTION
Q.21
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
103 OPTION
Q.22
OPTION -A
OPTION -B
OPTION -C
OPTION -DANSWER
CORRECT
104 OPTION
Q.23
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
105 OPTION
 Q.24
OPTION -A
OPTION -B
OPTION -C
OPTION
CORRECT-DANSWER
106 OPTION
G,TATHAWADE ,PUNE-33 (An Autonomous Institute Affiliated to SPPU)

uestion Bank

CO BL
Key element is also known as ______________.
slack
surplus
artificial
pivot
OPTION -D 1 1
The coefficient of slack\surplus variables in the objective fun
0
1
M
-M
OPTION -A 1 2
Using ______________ method, we can never have an unbound
Simplex
Dual simplex
Big M
Modi
OPTION -B 1 1
The slack variables indicate ______________.
excess resource available.
shortage of resource
nil resource
idle resource
OPTION
If the net-Devaluation corresponding to any non -basic variable is 1 2
zero, it is an indication of the existence of an ______________.
initial basic feasible solution
optimum basic feasible solution
optimum solution.
alternate optimum solution.
OPTION -D model of linear programming problem is important
Mathematical 1 2
because ____________
it helps in converting the verbal description and numerical
data into mathematical expression
decision makers prefer to work with formal models
it captures the relevant relationship among decision factors
it enables the use of algebraic technique
OPTION -A a linear programming problem infeasibility may be
While solving 1 3
removed by ______________.
adding another constraint
adding another variable
removing a constraint
removing a variable
OPTION
The right-Chand side constant of a constraint in a primal problem 1 2
appears in the corresponding dual as______________.
a coefficient in the objective function
a right hand side constant of a function
an input output coefficient a left hand side constraint
coefficient variable
OPTION -A 1 1
Graphical method is also known as ______________.
Simplex Method
Dual Simplex Method
Big-M Method
Search-Approach Method
OPTION -D 1 1

If the given Linear Programming Problem is in its standard form

then primal-dual pair is ______________.
symmetric
un symmetric
square
triangle
OPTION -B 1 2
The method used to solve Linear Programming Problem without u
Simplex Method
Big-M Method
Dual Simplex Method
Graphical Mehtod
OPTION -C 1 2
Linear Programming Problem is a technique of finding the __
optimal value
approximate value
initial value
infeasible value
Any solution to a Linear Programming Problem which also satisfies
OPTION
the non- -A
negative notifications of the problem has 1 1
______________.
solution
basic solution
basic feasible solution
feasible solution
OPTION -D 1 2
The cost of a slack variable is ______________.
0
1
2
-1
OPTION -A 1 1
Linear Programming Problem that can be solved by graphical
method has ______________.
linear constraints
quadratic constraints
non linear constraints
bi-quadratic constraints
OPTION
If one or -A
more variable vanish then a basic solution to the system is 1 2
called ______________.
non feasible region
feasible region
degenerate solution
basic solution
OPTION -C
______________ method is an alternative method of solving a 1 2
Linear Programming Problem involving artificial variables
Simplex Method
Big-M Method
Dual Simplex Method
Graphical Mehtod
OPTION
A Linear -B
Programming Problem have ______________ optimal 1 2
solution
1
2
more than 1
more than 2
OPTION -C Linear Programming Problem is in its standard form
If the given 1 2
then primal-dual pair is ______________.
symmetric
un symmetric
square
triangle
The method used to solve Linear Programming Problem without u 1 2

Simplex Method

Big-M Method
Dual Simplex Method
Graphical Mehtod
OPTION -C
Linear Programming Problem is a technique of finding the __ 1 2
optimal value
approximate value
initial value
infeasible value
Any solution to a Linear Programming Problem which also satisfies
OPTION
the non- -A
negative notifications of the problem has
______________. 1 1
solution
basic solution
basic feasible solution
feasible solution
OPTION -D
1 2
The cost of a slack variable is ______________. 1 2
0
1
2
-1
OPTION -A
Linear Programming Problem that can be solved by graphical
method has ______________. 1 1

linear constraints

quadratic constraints
non linear constraints
bi-quadratic constraints
OPTION
If one or -A
more variable vanish then a basic solution to the system is
called ______________. 1 2

non feasible region

feasible region
degenerate solution
basic solution
OPTION -C
______________ method is an alternative method of solving a
Linear Programming Problem involving artificial variables 1 2
Simplex Method
Big-M Method
Dual Simplex Method
Graphical Mehtod
OPTION
A Linear -B
Programming Problem have ______________ optimal
solution 1 2
1
2
more than 1
more than 2
OPTION -Ctotal demand is equal to supply then the transportation
When the
problem is said to be ______________ 1 2
solution
basic solution
basic feasible solution
feasible solution
OPTION -A
Chose the correct statement: A degenerate solution is one tha 1 1
gives an optimum solution to the Linear Programming Problem
gives zero value to one or more of the basic variables
yields more than one way to achieve the objective
makes use of all available resources
OPTION -B
At any iteration of the usual simplex method, if there is at leas 1 2
basic solution
non basic solution
degenerate

1 2
non degenerate
OPTION -C common to all the constraints including the non-
The region
negativity restrictions is called the ______________. 1 2
solution space
unique solution
optimum solution
infeasible solution
If an artificial variable is present in the basic variable column of
OPTION simplex
optimal -A table, then the problem has ______________
solution. 1 2
alternative
no solution
bounded
infeasible
OPTION
A feasible-Dsolution of an Linear Programming Problem that
optimizes the objective function is called ______________ 1 1
basic feasible solution
optimum solution
feasible solution
infeasible solution
OPTION -B
Charnes method of penalty is called ______________ 1 1
Simplex Method
Dual Simplex Method
Big-M Method
Graphical Method
OPTION
If -C Linear Programming Problem is in its canonical form
the given
then primal-dual pair is ______________. 1 2
symmetric
un symmetric
square
non square
OPTION -Bfunction to be maximized or minimized is called
The linear
______________ function. 1 2
injective
surjective
bijective
optimal
OPTION -D
The assignment problem will have alternate solutions when the
total opportunity cost matrix has ______________ 1 2
must satisfy all the constraints of the problem simultaneously
need not satisfy all of the constraints, only some of them
must be a corner point of the feasible region.
must optimize the value of the objective function
A
If any value in XB column of final simplex table is negative, t 1 2
feasible
infeasible
bounded
Unbounded
B
For any primal problem and its dual______________. 1 2
optimal value of objective function is same
dual will have an optimal solution if primal does too
primal will have an optimal solution if dual does too
both primal and dual cannot be infeasible
C
If there is no non-negative replacement ratio in solving a Linear
Programming Problem then the solution is ______________. 1 2
feasible
bounded
unbounded
infinite
______________ is a mathematical technique used to solve the
C
problem of allocating limited resource among the competing
activities 1 3
Linear Programming problem
Assignment Problem
Replacement Problem
Non linear Programming Problem
A set of feasible solution to a Linear Programming Problem is
A
______________ 1 2
convex
polygon
triangle
bold
A
In an Linear Programming Problem functions to be maximized or
minimized are called ______________. 1 1
constraints
objective function
basic solution
feasible solution
B
If the primal problem has n constraints and m variables then the
number of constraints in the dual problem is ______________. 1 1
mn
m+n
m-n
m/n
A
The non basic variables are called ______________. 1 1
shadow cost
opportunity cost
slack variable
surplus variable
To proceed with the Modified Distribution method algorithm for
A
solving an transportation problem, the number of dummy
allocations need to be added are______________. 1 1
The assignment problem is always a ______________matrix
circle
square
Rectangle
triangle
OPTION -B
During iteration while moving from one solution to the next, 2 1
degeneracy may occur when______________
the closed path indicates a diagonal move
two or more occupied cells are on the closed path but neither of

2 2
two or more occupied cells on the closed path with minus sign ar
the closed path indicates a rectangle move.
OPTION -C assignment problem is transformed into a
Maximization 2 2
minimization problem by______________.
adding each entry in a column from the maximum value in tha
subtracting each entry in a column from the maximum value in
subtracting each entry in the table from the maximum value in th
adding each entry in the table from the maximum value in that t
OPTION -C
The transportation problem deals with the transportation of 2 3
______________.
a single product from a source to several destinations
a single product from several sources to several destinations
a single product from several sources to a destination
a multi -product from several sources to several destinations
OPTION -A number of lines covering all zeros in a reduced cost
The minimum 2 2
matrix of order n can be ______________.
at the most n
at the least n
n-1
n+1 solving an assignment problem, an activity is assigned to a
While
OPTION
resource-A
through a square with zero opportunity cost because the 2 2
objective is to______________.
minimize total cost of assignment.
reduce the cost of assignment to zero
reduce the cost of that particular assignment to zero
reduce total cost of assignment
OPTION -A 2 2
If an activity has zero slack, it implies that______________.
the project is progressing well
it is a dummy activity
it lies on the critical path
it lies a non critical path
OPTION -C 2 2
The transportation problem is balanced, if ______________.
total demand and total supply are equal and the number of sourc
none of the routes is prohibited
total demand equals total supply irrespective of the number of s
number of sources matches with number of destinations
OPTION -C 2 2
n
n-1
2n-1
n-2
An optimal assignment requires that the maximum number of lines
B
which can be drawn through squares with zero opportunity cost
should be equal to the number of ______________. 2 1
rows or columns
rows and columns.
rows+columns- 1
rows-columns.
A
In marking assignments, which of the following should be
preferred? 2 2
Only row having single zero
Only column having single zero
Only row/column having single zero
Column having more than one zero
The solution to a transportation problem with m-sources and n-
C
destinations is feasible if the numbers of allocations are
______________. 2 2
m+n
mn
m-n
m+n-1
OPTION -D
The allocation cells in the transportation table will be called 2 2
occupied
unoccupied
no
finite
OPTION
To -Adegeneracy at the initial solution, a very small quantity
resolve
is allocated in ______________ cell 2 2
occupied
unoccupied
no
finite
OPTION -B
The assignment algorithm was developed by ______________ 2 3
HUNGARIAN
VOGELS
MODI
TRAVELING SALES MAN
OPTION -A
An assignment problem is a particular case of ______________ 2 1
transportation Problem
assignment Problem
travelling salesman problem
replacement Problem
Replacement of an item can be happen due to
OPTION -A
2 2
balanced
unbalanced
maximization
minimization
OPTION -A an optimum solution in transportation problem
For finding
______________ method is used. 2 1
Simplex
Big-M
Modi
Hungarian
OPTION -C
In a transportation table, an ordered set of______________ or
more cells is said to form a loop 2 1
2
3
4

2 2
5
OPTION -C
In an assignment problem involving 5 workers and 5 jobs, total
number of assignments possible are ______________. 2 2
5
10
15
20
OPTION
When -Atotal demand is not equal to supply then it is said to be
the
______________. 2 2
balanced
unbalanced
maximization
minimization
OPTION -B between assignment problem and transportation
The similarity
problem is ______________. 2 1
both are rectangular matrices
both are square matrices
both can be solved y graphical method
both have objective function and non-negativity constraints
OPTION -D
An unoccupied cell in the transportation method is analogous to
a______________. CO2 BL2
Zj-Cj value in the simplex table.
variable in the B-column in the simplex table.
variable not in the B-column in the simplex table.
value in the XB column in the simplex table.
Every basic feasible solution of a general assignment problem
OPTIONa -B
having square pay-off matrix of order n should have assignments
equal to______________. 2 3
2n-1
n
n+1
n-2
OPTION
Rn stands-Afor -
2 3
atleast one zero in each row and column
when all rows have two zeros
when there is a tie between zero opportunity cost cells
if two diagonal elements are zeros.
OPTION -C source or destination in a transportation problem is
The dummy
added to ______________. 2 3
satisfy rim conditions
prevent solution from becoming degenerate
ensure that total cost does not exceed a limit
the solution
Which of the not
be degenerate
following methods is used to verify the optimality of
OPTION
the -A solution of the transportation
current
problem______________. 2 2
Least cost method
Vogel's Approximation method
Row minima method
Modified Distribution method
OPTION -C
The assignment problem is a special case of transportation
problem in which ______________. 2 1
 number of origins are less than the number of destinations
number of origins are greater than the number of destinations
number of origins are greater than or equal to the number of des
number of origins equals the number of destinations
OPTION -D
All the basis for a transportation problem is ______________. 2 1
square
rectangle
diagonal
triangle
OPTION -D
In the transportation table, empty cells will be called _______ 2 2
occupied
unoccupied
no
finite
OPTION -B
______________ is a completely degenerate form of a
transportation problem 2 2
Transportation Problem
Assignment Problem
Travelling salesman problem
Replacement Problem
OPTION -B
Identify the correct statement 2 2
an assignment problem may require the introduction of both
an assignment problem with m rows and n columns will involves
an unbalanced assignment is one where the number of rows is m
balancing any unbalanced assignment problem involves addin
OPTION -C of replacement is felt when job performing units fail
The problem
______________. 2 2
Replace an item when______________.
average cost upto date is equal to the current maintenance cost
average cost upto date is greater than the current maintenance c
average cost upto date is less than the current maintenance cost.
next year running cost in more than average cost of nth year
OPTION -A 3 2
The time required by each job on each machine is called
Processing time
Precessing order
Total elapsed time
None of the above
OPTION -A of service facilities through which a job must pass
The number 3 2
before it is assumed to be completed
Number of machines
Idle time on a machine
2-machine
None of the above
OPTION
The order-A(sequence) in which machines are required for 3 1
completing the job
Processing time
Precessing order

3 2
 Idle time on a machine
None of the above
The time interval between starting the first job and completing the
OPTION -B
last job, including the idle time (if any), in a particular order by the 3 2
given set of machines
No. of passing rule
Idle time on a machine
Total elapsed time
None of the above
If n jobs are to be processed through two machines A and B in the
OPTION
order AB,-Cthen this means that each job will go to machine A first 3 1
and then to B
No. passing rule
Processing time
Idle time on a machine
None of the above
Replacement of an item can be happen due to
option -A 3 1

Sudden failure
Gradual failure
Both (a) and (b)
None of the above
Option -C for -
Rn stands 3 1

Running Cost
Maintenance Cost
Operational cost
All of the above
OPTION
Rn stands-Dfor - 3 1

Maintenance Cost
Running Cost
Operational cost
All of the above
OPTION -D 3 1
Average no. of failures per month is
P2X2/X1P1
Mean Avg/N
X1P1/P2X2
N/Mean Avg
Replacement of an item can be happen due to
OPTION -D 3 2

Sudden failure
Gradual failure
Both (a) and (b)
None of the above
Option -C 3 1
Depreciation cost in replacement theory is calculated ----------
C-S
S-C
S-TC
TC-S
OPTION -A 3 1
The time during which the machine remains waiting or vacent in
sequenceing problem in called ------------------ time
Processing
Waiting
idle
free
OPTION -Creplacement policy is suitable for identical low cost
The group 3 2
items which are likely to ______________.
fail suddenly
fail completely and suddenly
fail over a period of time
be progressive and retrogressive
OPTION -C 3 1
Weighted average annual cost in replaclement theory is
Total cost/maintainence cost
maintainence cost/Total cost
Discount factor/Total cost
Total cost/Discount factor
OPTION
The order-A(sequence) in which machines are required for 3 2
completing the job
Processing time
Precessing order
Idle time on a machine
None of the above
OPTION -B of real numbers which satisfies the constraints of Linear
An n-tuple 3 2
Programming Problem is called ______________
suddenly and gradually
gradually
suddenly
neither gradually nor suddenly
OPTION -Areplacement policy is suitable for identical low cost
The group 3 1
items which are likely to ______________.
fail suddenly
fail completely and suddenly
fail over a period of time
be
If nprogressive
and
jobs are to be
retrogressive
processed through two machines A and B in the
OPTION
order AB,-Cthen this means that each job will go to machine A first 3 1
and then to B
No. passing rule
Processing time
Idle time on a machine
None of the above
option -A 3 1
Weighted average annual cost in replaclement theory is
Total cost/maintainence cost
maintainence cost/Total cost
Discount factor/Total cost
Total cost/Discount factor
OPTION -A 3 1
Depreciation cost in replacement theory is calculated ----------
C-S
S-C

3 1
S-TC
TC-S
OPTION
Total time-Ato complete all the jobs in job sequenceing problem is 3 1
known as
idle time
processing time
elapsed time
processing oder
OPTION
The time-C during which the machine remains waiting or vacent in 3 1
sequenceing problem in called ------------------ time
Processing
Waiting
idle
free
OPTION
A feasible-Csolution to a linear programming problem 3 2
______________.
Sudden failure
Gradual failure
Both (a) and (b)
None of the above
If n jobs are to be processed through two machines A and B in the
OPTION
order AB,-Dthen this means that each job will go to machine A first 3 1
and then to B
No. passing rule
Processing time
Idle time on a machine
None of the above
OPTION
The time-A during which the machine remains waiting or vacent in 3 1
sequenceing problem in called ------------------ time
Processing
Waiting
idle
free
OPTION
Total time-Cto complete all the jobs in job sequenceing problem is 3 1
known as
idle time
processing time
elapsed time
processing oder
OPTION -C 3 1
Depreciation cost in replacement theory is calculated ----------
C-S
S-C
S-TC
TC-S
OPTION -A 3 1
Weighted average annual cost in replaclement theory is
Total cost/maintainence cost
maintainence cost/Total cost
Discount factor/Total cost
Total cost/Discount factor
OPTION -A 3 2
Average no. of failures per month is
P2X2/X1P1
Mean Avg/N
X1P1/P2X2
N/Mean Avg
OPTION -D 3 2