CIVIL Engineering STUDY Material , NOTES , Free Ebook

MVCT101 Advance Mathematics Theory

Unit 1 Introduction to Operations Research

Capsule 2

31. Using ______________ method, we can never have an unbounded solution

1. Simplex
2. Dual simplex
3. Big M
4. Modi

32. The customers of high priority are given service over the low priority customers is ______________.

1. Pre emptive
2. FIFO
3. LIFO
4. SIRO

33. A queuing system is said to be a ______________ when its operating characteristic are independent upon time

1. pure birth model
2. pure death model
3. transient state
4. steady state

34. An activity which does not consume neither any resource nor time is known as ______________.

1. predecessor activity
2. successor activity
3. dummy activity
4. activity

35. The difference between total and free float is ______________.

1. total
2. free
3. independent
4. interference

36. The number of time estimates involved in Program Evaluation Review Technique problem is ______________.

1. 1
2. 2
3. 3
4. 4

37. The assignment problem is always a ______________matrix.

1. circle
2. square
3. rectangle
4. triangle

38. The slack variables indicate ______________.

1. excess resource available.
2. shortage of resource
3. nil resource
4. idle resource

39. If the net evaluation corresponding to any non -basic variable is zero, it is an indication of the existence of an ______________.

1. initial basic feasible solution
2. optimum basic feasible solution
3. optimum solution.
4. alternate optimum solution.

40. Mathematical model of linear programming problem is important because ______________.

1. it helps in converting the verbal description and numerical data into mathematical expression
2. decision makers prefer to work with formal models
3. it captures the relevant relationship among decision factors
4. it enables the use of algebraic technique

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

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

41. While solving a linear programming problem infeasibility may be removed by ______________.

1. adding another constraint
2. adding another variable
3. removing a constraint
4. removing a variable

42. The right-hand side constant of a constraint in a primal problem appears in the corresponding dual as______________.

1. a coefficient in the objective function
2. a right-hand side constant of a function
3. an input output coefficient a left-hand side constraint
4. coefficient variable

43. During iteration while moving from one solution to the next, degeneracy may occur when______________

1. the closed path indicates a diagonal move
2. two or more occupied cells are on the closed path but neither of them represents a corner of the path.
3. two or more occupied cells on the closed path with minus sign are tied for lowest circled value.
4. the closed path indicates a rectangle move.

44. Maximization assignment problem is transformed into a minimization problem by______________.

1. adding each entry in a column from the maximum value in that column
2. subtracting each entry in a column from the maximum value in that column
3. subtracting each entry in the table from the maximum value in that table
4. adding each entry in the table from the maximum value in that table

45. Priority queue discipline may be classified as______________.

1. pre-emptive or non-pre-emptive
2. limited
3. unlimited
4. finite

46. Replace an item when______________.

1. average cost upto date is equal to the current maintenance cost
2. average cost upto date is greater than the current maintenance cost
3. average cost upto date is less than the current maintenance cost.
4. next year running cost in more than average cost of nth year

47. In time cost trade off function analysis______________.

1. cost decreases linearly as time increases
2. cost increases linearly as time decreases
3. cost at normal time is zero
4. cost increases linearly as time increases

48. The transportation problem deals with the transportation of ______________.

1. a single product from a source to several destinations
2. a single product from several sources to several destinations
3. a single product from several sources to a destination
4. a multi -product from several sources to several destinations

49. The minimum number of lines covering all zeros in a reduced cost matrix of order n can be ______________.

1. at the most n
2. at the least n
3. n-1
4. n+1

50. For a 2.5% increase in order quantity (under fundamental EOQ problem) the total relevant cost would ______________

1. increase by 2.5%.
2. decrease by 2.5%.
3. increase by 0.25%.
4. decrease by 0.25%.

51. In the basic EOQ model, if the lead time increases from 2 to 4 days, the EOQ will ______________

1. double increase
2. remain constant
3. but not double
4. decrease by a factor of two

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

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

52. When the sum of gains of one player is equal to the sum of losses to another player in a game, this situation is known as ______________.

1. two-person game
2. two-person zero-sum game
3. zero-sum game
4. non-zero-sum game

53. In the network, one activity may connect any ______________ nodes

1. 1
2. 2
3. 3
4. 4

54. Graphical method is also known as ______________.

1. Simplex Method
2. Dual Simplex Method
3. Big-M Method
4. Search-Approach Method

55. If the given Linear Programming Problem is in its standard form then primal-dual pair is ______________.

1. symmetric
2. un symmetric
3. square
4. triangle

56. The method used to solve Linear Programming Problem without use of the artificial variable is called ______________.

1. Simplex Method
2. Big-M Method
3. Dual Simplex Method
4. Graphical Mehtod

57. When the total demand is equal to supply then the transportation problem is said to be ______________

1. balanced
2. unbalanced
3. maximization
4. minimization

58. For finding an optimum solution in transportation problem ______________ method is used.

1. Simplex
2. Big-M
3. Modi
4. Hungarian

59. Linear Programming Problem is a technique of finding the ______________.

1. optimal value
2. approximate value
3. initial value
4. infeasible value

60. Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has ______________.

1. solution
2. basic solution
3. basic feasible solution
4. feasible solution

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

Features:

·       Notes from Gold Medalist student

·       Handwritten crisp to the point notes

·       Printed notes

·       Video notes of some subjects

·       Previous year question paper

·       Solved question paper

·       Subject/Unit wise arranged

·       Objective question paper for online exam

Mtech complete thesis support also available.

Visit:  https://notescivil.blogspot.com/

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

                                      MVCT101 Advance Mathematics Theory

Unit 1 Introduction to Operations Research

Capsule 1

1. Operations Research approach is ______________.

A.    multi-disciplinary

B.      scientific

C.      intuitive

D.     collect essential data

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

A.    must satisfy all the constraints of the problem simultaneously

B.      need not satisfy all of the constraints, only some of them

C.      must be a corner point of the feasible region.

D.     must optimize the value of the objective function

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

A.      infeasible

B.    infeasible

C.      bounded

D.     no solution

4. For any primal problem and its dual______________.

A.      optimal value of objective function is same

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

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 through squares with zero opportunity cost should be equal to the number of ______________.

A.    rows or columns

B.      rows and columns.

C.      rows+columns- 1

D.     rows-columns.

7. To proceed with the Modified Distribution method algorithm for solving an transportation problem, the number of dummy allocations need to be added are______________.

A.      n

B.    n-1

C.      2n-1

D.     n-2

8. Select the correct statement

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

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______________.

A.    minimize total project duration

B.      minimize toal project cost

C.      minimize production delays, interruption and conflicts

D.     maximize total project duration

11. In program evaluation review technique network each activity time assume a beta distribution because______________.

1. it is a unimodal distribution that provides information regarding the uncertainty of time estimates of activities
2. it has got finite non-negative error
3. it need not be symmetrical about model value
4. the project is progressing well

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

1. feasible
2. bounded
3. unbounded
4. infinite

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

1. all customers arrive at once
2. capacity of the system is infinite
3. service rate is faster than arrival rate
4. arrivals are independent of each other

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

1. Only row having single zero
2. Only column having single zero
3. Only row/column having single zero
4. Column having more than one zero

15. A petrol pump have one pump; Vehicles arrive at the petrol pump according to poison input process at average of 12 per hour. The service time follows exponential distribution with a mean of 4 minutes. The pumps are expected to be idle for ______________.

1. 3/5
2. 4/5
3. 5/3
4. 6/5

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

1. holding costs decrease and ordering costs increase
2. holding costs increase and ordering costs decrease
3. the total costs increase and then decrease
4. storage cost as well as stock-out cost increase

17. ______________ is a mathematical technique used to solve the problem of allocating limited resource among the competing activities

1. Linear Programming problem
2. Assignment Problem
3. Replacement Problem
4. Non linear Programming Problem

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

1. Simplex method
2. Hungarian method
3. Graphical method
4. Degeneracy

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

1. critical time
2. normal time
3. cost slope
4. crash cost

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

1. convex
2. polygon
3. triangle
4. bold

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

1. constraints
2. objective function
3. basic solution
4. feasible solution

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

1. mn
2. m+n
3. m-n
4. m/n

23. The non-basic variables are called ______________.

1. shadow cost
2. opportunity cost
3. slack variable
4. surplus variable

24. Key element is also known as ______________.

1. slack
2. surplus
3. artificial
4. pivot

25. The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are ______________.

1. m+n
2. mn
3. m-n
4. m+n-1

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

1. occupied
2. unoccupied
3. no
4. finite

27. To resolve degeneracy at the initial solution, a very small quantity is allocated in ______________ cell

1. occupied
2. unoccupied
3. no
4. finite

28. The assignment algorithm was developed by ______________ method.

1. HUNGARIAN
2. VOGELS
3. MODI
4. TRAVELING SALES MAN

29. An assignment problem is a particular case of ______________.

1. transportation Problem
2. assignment Problem
3. travelling salesman problem
4. replacement Problem

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

1. 0
2. 1
3. M
4. -M

Download Capsule 1-7 by joining this telegram group  https://t.me/+cj3WhHbC86syMTdl