The objective of network analysis is to______

  1. Home
  2. Back

Question:
The objective of network analysis is to______

1.minimize total project duration

2.minimize toal project cost

3.minimize toal project cost

4.maximize total project duration

Posted Date:-2021-12-03 17:27:09

More MCQS Questions and answers

  1. _________ is a mathematical technique used to solve the problem of allocating limited resource among the competing activities
  2. A feasible solution to a linear programming problem _________
  3. A mixed strategy game can be solved by ______
  4. 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 _____
  5. A queuing system is said to be a ______________ when its operating characteristic are independent upon time
  6. A set of feasible solution to a Linear Programming Problem is _______
  7. An activity which does not consume neither any resource nor time is known as ______
  8. An assignment problem is a particular case of ___________
  9. 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 ______
  10. During iteration while moving from one solution to the next, degeneracy may occur when______
  11. For a 2.5% increase in order quantity (under fundamental EOQ problem) the total relevant cost would ______
  12. For any primal problem and its dual_______
  13. If any value in XB column of final simplex table is negative, then the solution is _______
  14. If the net evaluation corresponding to any non -basic variable is zero, it is an indication of the existence of an ______
  15. If the order quantity (size of order) is increased, ______
  16. If the primal problem has n constraints and m variables then the number of constraints in the dual problem is ______
  17. If there is no non-negative replacement ratio in solving a Linear Programming Problem then the solution is _____
  18. In an Linear Programming Problem functions to be maximized or minimized are called _______
  19. In marking assignments, which of the following should be preferred?
  20. In program evaluation review technique network each activity time assume a beta distribution because________
  21. In time cost trade off function analysis________
  22. Key element is also known as _______
  23. Mathematical model of linear programming problem is important because _________
  24. Maximization assignment problem is transformed into a minimization problem by_______
  25. Operations Research approach is _________
  26. Priority queue discipline may be classified as___________
  27. Replace an item when________
  28. Select the correct statement
  29. Service mechanism in a queuing system is characterized by __________
  30. The activity cost corresponding to the crash time is called the ______
  31. The allocation cells in the transportation table will be called ______________ cell
  32. The assignment algorithm was developed by ______________ method.
  33. The assignment problem is always a ______________matrix.
  34. The calling population is considered to be infinite when ______
  35. The coefficient of slacksurplus variables in the objective function are always assumed to be ______
  36. The customers of high priority are given service over the low priority customers is _________
  37. The difference between total and free float is _______
  38. The difference between total float and head event slack is _________
  39. The minimum number of lines covering all zeros in a reduced cost matrix of order n can be ________
  40. The non basic variables are called _________
  41. The number of time estimates involved in Program Evaluation Review Technique problem is ______
  42. The objective of network analysis is to______
  43. The right hand side constant of a constraint in a primal problem appears in the corresponding dual as_________
  44. The slack variables indicate ______
  45. The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of allocations are ______
  46. The transportation problem deals with the transportation of _______
  47. To proceed with the Modified Distribution method algorithm for solving an transportation problem, the number of dummy allocations need to be added are______
  48. To resolve degeneracy at the initial solution, a very small quantity is allocated in _______ cell
  49. Using ______________ method, we can never have an unbounded solution
  50. While solving a linear programming problem infeasibility may be removed by _______
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!