MCQ FOR DS - ds mcq PDF

Title MCQ FOR DS - ds mcq
Author sirius black
Course Decision Science
Institution Savitribai Phule Pune University
Pages 7
File Size 121.2 KB
File Type PDF
Total Downloads 361
Total Views 821

Summary

1. In the process of evaluating location alternatives, the transportation model method minimizes the a. total demand b. total supply c**. total shipping cost** d. number of destinations In an assignment problem, a. one agent can do parts of several tasks b. one task can be done by several agents c. ...


Description

1. In the process of evaluating location alternatives, the transportation model method minimizes the a. total demand b. total supply c. total shipping cost d. number of destinations

2. In an assignment problem, a. one agent can do parts of several tasks b. one task can be done by several agents c. each agent is assigned to its own best task d. none of the above 3. a) b) c) d)

Which method usually gives a very good solution to the assignment problem? none of the above Vogel's approximation metho MODI method northwest corner rule

4. In applying Vogel's approximation method to a profit maximization problem, row and column penalties are determined by: a) finding the largest unit cost in each row or column. b) finding the smallest unit cost in each row or column. c) finding the difference between the two highest unit costs in each row and column. d) finding the difference between the two lowest unit costs in each row and column. e) finding the sum of the unit costs in each row or column. 5. The northwest corner rule requires that we start allocating units to shipping routes in the: a) middle cell. b) Lower right corner of the table. c) Upper right corner of the table. d) Upper left-hand corner of the table. e) highest costly cell of the table.

6. In a transportation problem, when the number of occupied routes is less than the number of rows plus the number of columns -1, we say that the solution is: a) Degenerate. b) Infeasible.

c) Optimal. d) impossible. e) Unbalanced. 7. The only restriction we place on the initial solution of a transportation problem is that: a) we must have nonzero quantities in a majority of the boxes. b) all constraints must be satisfied. c) None of the above d) we must have a number (equal to the number of rows plus the number of columns minus one) of boxes which contain nonzero quantities. e) demand must equal supply.

8. Which of the following is used to come up with a solution to the assignment problem? a) MODI method b) none of the above c) stepping-stone method d) Hungarian method e) northwest corner method 9. Which of the following are advantages of simulation? a) Simulation allows "what-if?" type of questions. b) a) and (c) only c) Simulation does not interfere with the real-world system. d) all of the above e) Simulation can usually be performed by hand or using a small calculator. 10. The first step in simulation is to a) b) c) d) e)

set up possible courses of action for testing. construct a numerical model none of the above define the problem. validate the model.

11. Which of the following are disadvantages of simulation? a) inability to analyze large and complex real-world situations b) "time compression" capability c) all of the above

d) is not usually easily transferable to other problems e) could be disruptive by interfering with the real-world system 12. The first step in the Monte Carlo simulation process is to a) generate random numbers. b) set up probability distributions. c) establish random number intervals d) simulate trials. e) set up cumulative probability distributions. 13. Cumulative probabilities are found by a) summing all the probabilities associated with a variable. b) simulating the initial probability distribution c) none of the above d) any method one chooses. e) summing all the previous probabilities up to the current value of the variable. 14. If we are going to simulate an inventory problem, we must a) b) c) d) e)

run the simulation for many days. run the simulation many times, i.e., using multiple sets of random numbers. run the simulation once, for a relative short period of time. none of the above run the simulation for many days many times, i.e., using multiple sets of random numbers.

15. From a practical perspective, if we have a waiting line problem for which the Poisson and negative exponential distributions do not apply, and we desire a reasonably accurate solution, we should a) modify the queuing equations to make them appropriate for our problem. b) use simulation. c) none of the above d) build a physical model and use that to study the problem. e) use the simple queuing equations even though we realize they are inappropriate.

16. In assigning random numbers in a Monte Carlo simulation, it is important to ________. 1. know the true distribution of the real system 2. use random numbers from a random number table 3. use only a single set of random numbers 4. use Excel spreadsheets

5. develop cumulative probability distributions

17. To simulate is to try to __________ the features, appearance, and characteristics of a real system. a) develop b) hide c) analyze d) multiply e) duplicate 18. When using Monte Carlo simulation, _________. a) the average values of the variables generated by the simulation should approximate the averages of the real-world variables. b) the averages of the variables generated by the simulation should be somewhat larger than the averages of the real-world variables. c) the averages of the variables generated by the simulation should be systematically smaller than the averages of the real-world variables. d) the values of the variables generated by the simulation should be exactly the same as the values of the real-world variables. e) the values of the variables generated by the simulation should approximate the values of the real-world variables. 19. Successful use of the simulation approach requires both knowledge of the problem to be solved and knowledge of _________. a) POM-QM software b) probability distributions and statistical analysis c) engineering or computer science d) social sciences e) computer programming

20. The ________ determine(s) the equilibrium of a Markov process a) original state probabilities b) state vector c) absorbing matrix d) fundamental matrix F e) transition matrix 21. Markov analysis assumes that the states are both __________ and __________. a) transitory, infinitely exhaustive

b) c) d) e)

infinite, absorbing generally inclusive, always independent collectively exhaustive, mutually exclusive finite, recurrent

22. In Markov analysis, we assume that the states are _________. a) b) c) d) e)

mutually exhaustive constant collectively exclusive linear finite in number

23. Markov analysis is a technique that deals with the probabilities of future occurrences by a) b) c) d) e)

none of the above analyzing presently known probabilities time series forecasting. the maximal flow technique. using Bayes' theorem.

24. Markov analysis might be effectively used for a) technology transfer studies b) machine breakdowns. c) accounts receivable analysis. d) university retention analysis e) all of the above 25. The following is not an assumption of Markov analysis. a) There is an infinite number of possible states b) The probability of changing states remains the same over time. c) We can predict any future state from the previous state and the matrix of transition probabilities. d) The size and composition of the system do not increase. e) A and D 26. In Markov analysis, the likelihood that any system will change from one period to the next is revealed by the a) b) c) d)

identity matrix. transition-elasticities. state of technology matrix of transition probabilities.

e) matrix of state probabilities. 27. Markov analysis assumes that conditions are both a) b) c) d) e)

Complementary and collectively exhaustive. complementary and mutually exclusive collectively dependent and mutually exclusive collectively exhaustive and mutually exclusive Collectively dependent and complementary.

28. Occasionally, a state is entered which will not allow going to another state in the future. This is called a) b) c) d) e)

An equilibrium state. Stable mobility. a terminal state. Market saturation. None of the above.

29. If we decide to use Markov analysis to study the transfer of technology, a) our study will have only limited value because the Markov analysis tells us "what" will happen, but not "why." b) we can only study the transitions among three different technologies. c) only constant changes in the matrix of transition probabilities can be handled in the simple model. d) none of the above e) our study will be methodologically flawed. 30. The following data consists of a matrix of transition probabilities (P) of three competing companies, the initial market share state (1), and the equilibrium probability states. Assume that each state represents a firm (Company 1, Company 2, and Company 3, respectively) and the transition probabilities represent changes from one month to the next.

The market share of Company 1 in the next period is none of the above a) 0.20 b) 0.42 c) 0.47

d) 0.10 31. The model used to evaluate the layout of a factory would likely be an example of _______. a) Monte Carlo simulation...


Similar Free PDFs