- Information
- AI Chat
DS 2016 MCQ - Practice MCQ
Decision Science (MBA 302)
Savitribai Phule Pune University
Recommended for you
Related Studylists
MyPreview text
DS MCQ
Operations research analysts do not a) Predict future operations b) Build more than one model c) Collect relevant data d) Recommend decision and accept
Decision variables are a) Controllable b) Uncontrollable c) Parameters d) None of the above
A model is a) An essence of reality b) An approximation c) An idealization’ d) All of the above
A physical model is an example of a) An iconic model b) An analogue model c) A verbal model d) A mathematical model
Every mathematical model a) Must be deterministic b) Requires computer aid for solution. c) Represents data in numerical form d) All of the above
Operations research approach is a) Multi disciplinary b) Scientific c) Intuitive d) All of the above
An optimization model a) Mathematically provides best decision b) Provides decision with limited context c) Helps in evaluating various alternatives constantly d) All of the above
OR provides solution only if the elements are a) Quantified b) Qualified
c) Feasible d) Optimal
The name management science is preferred by a) Americans b) English c) French d) Latin
Operations research is applied in a) Military b) Business c) Administration’ d) All of the above
The application of OR techniques involves ............ approach a) Individual b) Team c) Critical d) None of the above
OR techniques helps to find .......... a) Feasible b) Non feasible c) Optimal d) Non optimal
Modern scientific management research originated during ...... a) World war II b) World war I c) 1990 d) 1993
.......... helps management to evaluate alternative course of action for selecting the best course of action a) Operations research b) Quantitative technique c) Management research d) None of the above
.......... Theory is an important operations research technique to analyze the queuing behaviour. a) Waiting line b) Net work c) Decision d) Simulation
.......... a method of analyzing the current movement of the same variable in an effort to predict the future movement of the same variable. a) Goal programming b) Markov analysis c) Replacement theory d) Queuing theory
Constraints in an LP model represent a) Limitations b) Requirements c) Balancing limitation d) all of the above
Linear programming is a a) Constraint optimization technique b) Technique for economic allocation of limited resources. c) Mathematical technique d) all of the above
A constraint in an LP model restricts a) Value of objective function b) Value of decision variable c) Use of available resource d) all of the above
The best use of linear programming technique is to find an optimal use of a) Money b) Man power c) Machine d) all of the above
Which of the following as an assumption of an LP model a) Divisibility b) Proportionality c) Additively d) all of the above
Most of the constraints in the linear programming problem are expressed as .......... a) Equality b) Inequality c) Uncertain d) all of the above
The graphical method of LP problem uses a) Objective function equation
b) Constraint equation c) Linear equations d) All the above
A feasible solution to a linear programming problem a) Must satisfy all problem constraints simultaneously b) Need not satisfy all constraints c) Must be a corner point of the feasible region d) Must optimize the value of the objective function
While plotting constraints on a graph paper, terminal points on both axes are connected by a straight line because a) The resources are limited in supply b) The objective function is a linear function c) The constraints are linear equations or in equalities d) all of the above
Constraints in LP problem are called active if they a) Represent optimal solution b) At optimality do not consume all the available resources c) Both of (a) and (b) d) None of the above
The solution space of a LP problem is unbounded due to a) An incorrect formulation of the LP model b) Objective function is unbounded c) Neither (a) nor (b) d) Both (a) and (b)
While solving LP problem graphically, the area bounded by the constraints is called a) Feasible region b) Infeasible region c) Unbounded solution d) None of the above
Which of the following is not a category of linear programming problems? a) Resource allocation problem b) Cost benefit trade off problem c) Distribution network problem d) All of the above are categories of linear programming problems.
A linear programming model does not contain which of the following components? a) Data b) Decisions
Alternative solutions exists of an LP model when a) One of the constraints is redundant. b) Objective function equation is parallel to one of the constraints c) Two constraints are parallel. d) all of the above
While solving an LP problem, infeasibility may be removed by a) Adding another constraint b) Adding another variable c) Removing a constraint d) Removing a variable
The initial solution of a transportation problem can be obtained by applying any known method. But the only condition is a) The solution be optimal b) The rim conditions are satisfied c) The solution not be degenerate d) All of the above
When total supply is equal to total demand in a transportation problem , the problem is said to be a) Balanced b) Unbalanced c) Degenerate d) None of the above
Graphical method can be used only if there are “2” decision variables.
While solving a LP graphically the area bounded by the constraints is called Feasible Region.
If the given problem is maximization, Zmax then locate the solution point at the far most point of the feasible zone from the origin.
Transhipment is an extension of the transportation problem in which the commodity can be transported to a particular destination through one or more intermediate or transhipment nodes.
A very high cost is applied to prohibited routes.
The objective of the transhipment problem is to determine how many units should be shipped over each node so that all the demand requirements are met with the minimum Transportation Cost.
An assignment problem will have the following solution (a) optimal (b) unique (c) multiple (d) all of the above
Maximization assignment problem is transformed into minimization problem by (a) Adding each entry in a column from the maximum value in that column
(b) Subtracting each entry in a column from maximum value in that column (c) Subtracting each entry in the table from the maximum value in that table (d) Any one of the above 57. The main objective of an assignment problem is to (a) Minimize the total cost (b) Maximize the sales and returns. (c) Both (a) and (b) (d) None 58. An assignment problem is said to be unbalanced when number of rows is not equal to the number of columns 59. When the number of rows is equal to the number of columns then the problem is said to be balanced assignment problem. 60. For solving an assignment problem the matrix should be a square matrix. 61 of the following characteristics apply to queuing system (a) Customer perception (b) Arrival process (c) Both a and b (d) none of the above 62. The cost of providing service in a queuing system decreases with (a) Decreased average waiting time in a queue (b) Decreased arrival time (c) Increased arrival rate (d) None of the above 63. Priority queue discipline may be classified as (a) Finite or infinite (b) Limited or unlimited (c) Pre-emptive or non pre-emptive (d) All of the above 64. A bank transaction or grocery store checkout counter is an example of single
phase system.
65**. Arrival** specifies the average number of customers per time period.
The Service governs capacity of the service system.
It is the fluctuation in arrival and service patterns that causes wait in queuing
system.
68. When customer changes one line to another to reduce wait time, process is
called Jockeying.
A constant service time means that there is a constant time between each service- False.
Queue discipline refers to the amount of patience possessed by the customer- False.
With random arrival and service rates in a waiting line, it is impossible to have full
utilization of the server and zero wait time for the customer- True
- Despite restrictive assumptions of queuing models, these models provide much insight to
e) Elastic
- Which one of the following situations has no waiting lines? (for L = LAMBDA, M =
MU)
a) L = 30, M = 20 both follow a Poisson Distribution
b) L = 20, M = 20 both follow a Poisson Distribution
c) L = 10, M = 20 both follow a Poisson Distribution
d) L = 20, M = 20 both are constant, that is not random
- When a team of scientists from different disciplines work together for finding the best
possible solution in the interest of the organisation as a whole then the solution thus obtained
is called ______________________.
a. Feasible solution
b. Optimum strategy
c. Optimal decision
d. Quantitative solution
- ______________________ has several objective functions, each having a target value.
a. Queuing model
b. Linear programming
c. Goal programming
d. Inventory control method
- In linear programming we need to ensure that both the objective function and the
constraints can be expressed as linear expressions of _________________.
a. Objective function
b. Decision variables
c. Constraints
d. Basic variables
- Both objective functions and constraints can be expressed as ____________________.
a. Linear equalities
b. Non-linear equalities
c. Linear inequalities
d. Non-linear inequalities
- When a linear programming problem is represented in the canonical form, the
minimisation of a function is mathematically equivalent to the ________________________
of this function.
a. Maximisation of the negative expression
b. Minimisation of the negative expression
c. Minimisation of the positive expression
d. Maximisation of the positive expression
- When a linear programming problem is represented in the canonical form, all constraints
are of ________ type.
a. =
b. ≥
c. ≠
d. ≤
- The feasible region has an important property which is called the _________________ of
geometry, provided the feasible solution of for the problem exists.
a. Non-convexity property
b. Convexity property
c. Edge-transitive
d. Vertex-transitive
- The objective function is maximised or minimised at one of the _________________
referred to as optimum solution.
a. Vertex
b. Extreme points
c. Boundary
d. Interior point
- At least one corner of the region of _______________ will be an optimal solution
whenever the maximum or minimum value of z is finite.
a. Infeasible solution
b. Alternative solution
c. Feasible solution
d. Unbounded solution
- The variables assigned the value zero are called ________________.
a. Non-basic variables
b. Basic variables
c. Surplus variables
d. Slack variables
d. -
- If there are three workers in a construction field all with different ability and three tasks
are to be completed, then it is an example of _________________.
a. Linear programming problem
b. Transportation problem
c. Balanced assignment problem
d. Unbalanced assignment problem
- _____________ means that only one person would join the queue, but demand service on
behalf of several customers.
a. Balking
b. Reneging
c. Collusion
d. Jockeying
- ____________ is a rule wherein customer is allowed to enter into the service immediately
after entering into the system.
a. FIFO
b. LIFO
c. Priority service
d. Pre-emptive priority
- When the customer arrivals are completely random, the ____________ is followed.
a. Deterministic model
b. Statistical model
c. Poisson distribution
d. Probability concept
- Because of the random nature of the processes involved, the queuing theory is rather
demanding and all models are based on very strong _____________.
a. Facts
b. Theory
c. Assumptions
d. Simulation
- Average number of customers in the system is represented in queuing system as
______________.
a. E(m)
b. E(w)
c. E(v)
d. E(n)
- With respect to the notations used in Queuing theory "V" refers to
______________________. a. Service time
b. Waiting time in the queue
c. Waiting time in the queue + service time
d. Waiting time of customers
- A _____________ is characterised by the minimum permissible number of customers
that it can contain.
a. Queue discipline
b. Service rate
c. Service time
d. Queue
- The _______________ assumes that arrivals join a queue that is of unlimited size,
waiting in line until their turn for service comes on a first-cum-first-serve basis and then enter
a service facility consisting of a single channel.
a. Waiting line
b. LCLS
c. Simplest waiting line model
d. FSFC
- Lending system in a library is an example of ____________________ waiting line.
a. Simplest waiting line
b. Single facility waiting channel
c. Multiple channel
d. Parallel facility
- A ____________ involves several variables making it impossible to determine the
number of trials required to obtain the desired accuracy at a specified confidence level.
a. Analytical model
b. Quantitative model
c. Mathematical model
d. Simulation model
- Operation starts with an arbitrary ___________ integer called the seed.
a. Two digit
b. Four digit
a. Non-zero, Negative
b. Positive, Negative
c. Zero, Positive
d. Zero, Negative
- The travelling salesman problem is defined as _________________________________.
a. xijk=∞ if kth is directed from city i to city k
b. xijk=0 if kth is directed from city i to city j
c. xijk=-1 if kth is directed from city j to city k
d. xijk=1 if kth is directed from city i to city j
- The number of customers in queue and also those being served in the queue relate to the
____________ efficiency and ______________.
a. Facility, Queue length
b. Service, Capacity
c. Server, Capacity
d. Facility, Capacity
- Service systems are usually classified in terms of their number of _________, or
numbers of _____________.
a. Queue, Customers
b. Channels, Servers
c. Servers, Customers
d. Channels, Queue
- A simulation model involves several variables making it ____________ to determine the
_____________ required to obtain the desired accuracy at a specified confidence level.
a. Impossible, Number of errors
b. Impossible, Number of trails
c. Possible, Number of trails
d. Possible, Number of errors
- Which of the following are advantages of simulation?
a. Simulation allows "what-if?" type of questions
b. Simulation can usually be performed by hand or using a small calculator.
c. Simulation does not interfere with the real-world system
d. (a) and (c) only
- The first step in simulation is to
a. set up possible courses of action for testing
b. define the problem.
c. construct a numerical model.
d. validate the model.
- Which of the following are disadvantages of simulation?
a. could be disruptive by interfering with the real-world system
b. inability to analyze large and complex real-world situations
c. is not usually easily transferable to other problems
d. "time compression" capability
- 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.
- Cumulative probabilities are found by
a. summing all the previous probabilities up to the current value of the variable.
b. summing all the probabilities associated with a variable.
c. simulating the initial probability distribution.
d. any method one chooses
- If we are going to simulate an inventory problem, we must
a. run the simulation many times, i., using multiple sets of random numbers.
b. run the simulation for many days many times, i., using multiple sets of random
numbers.
c. run the simulation for many days.
d. run the simulation once, for a relative short period of time.
- 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. use simulation.
b. modify the queuing equations to make them appropriate for our problem
d. Random number assignment
- Simulation models can be used to obtain operating characteristic estimates in less time than
with the real system using a feature of simulation called:
a. Time compression
b. Warp speed
c. Micro seconds
d. None of the above
- Which of the following statistical methods are commonly used to analyze simulation results?
a. t-test
b. ANOVA
c. Regression Analysis
d. All of the above
DS 2016 MCQ - Practice MCQ
Course: Decision Science (MBA 302)
University: Savitribai Phule Pune University
This is a preview
Access to all documents
Get Unlimited Downloads
Improve your grades
