Home > CompTIA Security+ Certification > Quizzes > Management Science Practice Test Questions
Management Science Practice Test Questions
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 20% Most missed: “Which of the following as an assumption of an LP model”
Management science (or managerial science) is a wide and interdisciplinary study of solving complex problems and making strategic decisions as it pertains to institutions, corporations, governments and other types of organizational entities. It is closely related to management, economics, business, engineering, management consulting, and other fields. Management Science uses various scientific research-based principles, strategies, and analytical methods including mathematical modeling, statistics and numerical algorithms and aims to improve an organization's ability to enact rational and... Show more
Management Science Practice Test Questions
Time left 00:00
25 Questions

1. The graphical method if LPP uses:
2. Which of the following is a characteristic of a dual problem:
3. A matrix which shows the gains and losses resulting from moves and counter moves is called..................................
4. Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution:
5. Constraints in an LPP are treated as active, if they:
6. The expected value of perfect information is equal to
7. While solving an LPP, infeasibility may be removed by:
8. The maximise criteria is ...........................
9. The objective of network analysis is to
10. A customer’s behaviour of jumping from one queue to another is called ............................
11. .......................... is the duration by which an activity can be delayed without delaying the project.
12. Straight lines shown in a linear programming graph indicates ...........................
13. In transportation Problems, VAM stands for .........................
14. Linear Programming technique is a:
15. The minimum expected opportunity loss is
16. All the parameters in the linear programming model are assumed to be .....................
17. If a simplex table shows the values 2, -3, 0 against “θ”, which should be taken as the replacement ratio.
18. An assignment problem can be solved by .........................
19. The ration between mean arrival rate and mean service rate is called ...................
20. For a minimisation Transportation Problem, the objective is to minimise:
21. ................................is that element of the simplex table which lis both in the key row and key column.
22. The outcome of a game is known as....................
23. Hungarian method was developed by ........................
24. Which of the followings is an assumption of Linear Programming Technique?
25. ........................ model is a map which indicates roads, highways, towns and inter-relationships