Downloaded from https://notescivil.blogspot.

com/

MVCT101 Advance Mathematics Theory

Unit 1 Introduction to Operations Research

Capsule 1
1. Operations Research approach is ______________.

A. multi-disciplinary
B. scientific

/
om
C. intuitive

t.c
D. collect essential data

po
2. A feasible solution to a linear programming problem ______________.

gs
lo
A. must satisfy all the constraints of the problem simultaneously

l.b
B. need not satisfy all of the constraints, only some of them
vi
ci
C. must be a corner point of the feasible region.
es

D. must optimize the value of the objective function

ot
//n

3. If any value in XB column of final simplex table is negative, then the solution is
s:

______________.
tp
ht

A. infeasible
m

B. infeasible
fro

C. bounded
d
de

D. no solution
oa

4. For any primal problem and its dual______________.

nl
ow

A. optimal value of objective function is same

D

B. dual will have an optimal solution if primal does too

C. primal will have an optimal solution if dual does too
D. both primal and dual cannot be infeasible
 Downloaded from https://notescivil.blogspot.com/

5. The difference between total float and head event slack is ______________

A. free float
B. independent float
C. interference float
D. linear float

6. An optimal assignment requires that the maximum number of lines which can be drawn

/
om
through squares with zero opportunity cost should be equal to the number of
______________.

t.c
po
A. rows or columns

gs
B. rows and columns.

lo
l.b
C. rows+columns- 1

vi
D. rows-columns. ci
es
Download Capsule 1-7 at https://notescivil.blogspot.com/
ot
//n

Joining our telegram group https://t.me/+cj3WhHbC86syMTdl

s:

7. To proceed with the Modified Distribution method algorithm for solving an transportation
tp

problem, the number of dummy allocations need to be added are______________.

ht
m

A. n
fro

B. n-1
d

C. 2n-1
de

D. n-2
oa
nl

8. Select the correct statement

ow
D

A. EOQ is that quantity at which price paid by the buyer is minimum

B. If annual demand doubles with all other parameters remaining constant, the Economic
Order Quantity is doubled
C. Total ordering cost equals holding cost
D. Stock out cost is never permitted
 Downloaded from https://notescivil.blogspot.com/

9. Service mechanism in a queuing system is characterized by ______________.

A. customers behavior
B. servers behavior
C. customers in the system
D. server in the system

10. The objective of network analysis is to______________.

/
om
A. minimize total project duration

t.c
B. minimize total project cost

po
C. minimize production delays, interruption, and conflicts

gs
D. maximize total project duration

lo
l.b
Download Capsule 1-7 at https://notescivil.blogspot.com/

vi
ci
Joining our telegram group https://t.me/+cj3WhHbC86syMTdl
es
ot

11. In program evaluation review technique network each activity time assume a beta
//n

distribution because______________.
s:
tp

A. it is a unimodal distribution that provides information regarding the uncertainty of time

ht

estimates of activities
m

B. it has got finite non-negative error

fro

C. it need not be symmetrical about model value

d

D. the project is progressing well

de
oa

12. If there is no non-negative replacement ratio in solving a Linear Programming Problem then
nl

the solution is ______________.

ow
D

A. feasible
B. bounded
C. unbounded
D. infinite
 Downloaded from https://notescivil.blogspot.com/

13. The calling population is considered to be infinite when ______________.

A. all customers arrive at once

B. capacity of the system is infinite
C. service rate is faster than arrival rate
D. arrivals are independent of each other

14. In marking assignments, which of the following should be preferred?

/
om
A. Only row having single zero

t.c
B. Only column having single zero

po
C. Only row/column having single zero

gs
D. Column having more than one zero

lo
l.b
15. A petrol pump have one pump; Vehicles arrive at the petrol pump according to poison input

vi
ci
process at average of 12 per hour. The service time follows exponential distribution with a
es
mean of 4 minutes. The pumps are expected to be idle for ______________.
ot
//n

A. 3/5
s:

B. 4/5
tp

C. 5/3
ht

D. 6/5
m
fro

16. If the order quantity (size of order) is increased, ______________

d
de

A. holding costs decrease and ordering costs increase

oa

B. holding costs increase and ordering costs decrease

nl

C. the total costs increase and then decrease

ow

D. storage cost as well as stock-out cost increase

D

17. ______________ is a mathematical technique used to solve the problem of allocating

limited resource among the competing activities

A. Linear Programming problem

B. Assignment Problem
 C. Replacement Problem
D. Nonlinear Programming Problem

18. A mixed strategy game can be solved by ______________.

A. Simplex method
B. Hungarian method
C. Graphical method

/
om
D. Degeneracy

t.c
19. The activity cost corresponding to the crash time is called the ______________.

po
gs
A. critical time

lo
B. normal time

l.b
C. cost slope

vi
D. crash cost
ci
es
ot

20. A set of feasible solution to a Linear Programming Problem is ______________

//n

A. convex
s:
tp

B. polygon
ht

C. triangle
m

D. bold
fro
d

21. In a Linear Programming Problem functions to be maximized or minimized are called

de

______________.
oa
nl

A. constraints
ow

B. objective function
D

C. basic solution
D. feasible solution

Downloaded from https://notescivil.blogspot.com/

 Downloaded from https://notescivil.blogspot.com/

22. If the primal problem has n constraints and m variables then the number of constraints in
the dual problem is ______________.

A. mn
B. m+n
C. m-n
D. m/n

/
om
23. The non-basic variables are called ______________.

t.c
A. shadow cost

po
B. opportunity cost

gs
C. slack variable

lo
l.b
D. surplus variable

vi
24. Key element is also known as ______________.
ci
es
ot

A. slack
//n

B. surplus
s:

C. artificial
tp

D. pivot
ht
m

25. The solution to a transportation problem with m-sources and n-destinations is feasible if
fro

the numbers of allocations are ______________.

d
de

A. m+n
oa

B. mn
nl

C. m-n
ow

D. m+n-1
D

26. The allocation cells in the transportation table will be called ______________ cell

A. occupied
B. unoccupied
C. no
D. finite
27. To resolve degeneracy at the initial solution, a very small quantity is allocated in
______________ cell

A. occupied
B. unoccupied
C. no
D. finite

/
om
28. The assignment algorithm was developed by ______________ method.

t.c
A. HUNGARIAN

po
B. VOGELS

gs
C. MODI

lo
l.b
D. TRAVELING SALES MAN

vi
ci
29. An assignment problem is a particular case of ______________.
es
ot

A. transportation Problem
//n

B. assignment Problem
s:

C. travelling salesman problem

tp

D. replacement Problem
ht
m

30. The coefficient of slack\surplus variables in the objective function are always assumed to
fro

be ______________.
d
de

A. 0
oa

B. 1
nl

C. M
ow

D. -M
D

Download Capsule 1-7 at https://notescivil.blogspot.com/

Joining our telegram group https://t.me/+cj3WhHbC86syMTdl

 Notes for Mtech CTM (Construction Technology
Management) available strictly as per syllabus for all
three-semester available.

Features:

/
•

om
Notes from Gold Medalist student
• Handwritten crisp to the point notes

t.c
• Printed notes

po
• Video notes of some subjects

gs
• Previous year question paper

lo
•

l.b
Solved question paper
• Subject/Unit wise arranged
vi
ci
• Objective question paper for online exam
es
ot

Mtech complete thesis support also available.

//n
s:
tp

Visit: https://notescivil.blogspot.com/
ht
m
fro

Join our telegram group: https://t.me/+cj3WhHbC86syMTdl

d
de
oa
nl
ow
D