Id

Question The field of management science

A Concentrates on the on the use of quantitative methods to assists in decision making

B Approaches decision making with techniques based on the scientific method

C Is another name for decision science and for operation research

D each of the above is true

Answer D
Marks 1
Unit 1
Id
Question Identification and definition of a problem
A Can not be done until alternatives are proposed

B Is the first step of decision making

C Is the final step of problem solving

D Requires consideration of multiple criteria

Answer B
Marks 1
Unit 1
Id
Question Decision alternatives
A Should be identified before decision criteria are established

B Are limited to quantitative solutions

C Are evaluated as a part of the problem definition stage

D Are best generated by brain storming

Answer A
Marks 1
Unit 1
Id
Question Decision Criteria

A are the choices faced by the decision maker

B are the problems faced by the decision maker

C are the ways to evaluate the choices faced by the decision maker

D must be unique for the problem

Answer C
Marks 1
Unit 1
Id
Question In a multi criteria decision problem
A it is impossible to select a single decision alternative

B the decision maker must evaluate each alternative with respect to each criterion

C successive decisions must be made over time

D each of the above is true

Answer B
Marks 1
Unit 1
Id

Question The quantitative analysis approach requires

A the managers prior experience with similar problem

B a relatively uncomplicated problem

C mathematical expressions for the relationship

D each of the above is true

Answer C
Marks 1
Unit 1
Id
Question maximization or minimization of the quantity is the

A a goal of management science

B decision for decision analysi

C constraint of operation research

D objective of linear programming

Answer D
Marks 1
Unit 1
Id
Question Decision variables

A tells how much or how many of something to produce, invest, purchase ,hire

B Represents values of the constraints

C measure the objective function

D must exist for each constraint

Answer A
Marks 1
Unit 1
Id
Question Which of the following is the valid objective function of LPP
A Maximize 5xy

B Minimize 4x+3y+3z

C Maximize 3xy+5xy

D Minimize(x1+x2)/x3

Answer B
Marks 1
Unit 1
Id
Question Which of the following statement is not true?

A feasible solution satisfies all the constraints

B an optimal solution satisfies all the constraints

C an infeasible solution violates all constraints

D a feasible solution point does not have to lie on the boundary of the feasible region

Answer C
Marks 1
Unit 1
Id
Question A solution that satisfies all the constraints of the LPP except the non negativity
constraints is called

A optimal

B feasible

C infeasible

D semi-feasible

Answer C
Marks 1
Unit 1
Id
Question Slack

A is the difference between the left and right sides of the constraints

B is the amount by which the left side of the constraint is smaller than the right side

C is the amount by which the left side of the constraint is larger than the right side

D exists for each variable in a linear programming problem

Answer B
Marks 1
Unit 1
Id
Question To find the optimal solution to the LPP using the graphical method

A find the feasible point that is the farthest away from the region

B find the feasible point that is at the highest location

C find the feasible point that is closest to the origin

D None of the alternative is correct

Answer D
Marks 1
Unit 1
Id
Question Which of the following cases does not require reformulation of the problem in order to obtain a
solution?
A Alternate optimality

B Infeasibility

C Unboundness

D Each case requires a reformulation

Answer A
Marks 1
Unit 1
Id
Question Whenever all constraints in the LPP are expressed as equalities, the linear program is said
to be written in

A Standard form

B Bounded form

C Feasible form

D Feasible form

Answer A
Marks 1
Unit 1
Id
Question Problem solving encompasses

A Identification of problem

B Identification of problem and the action to resolve it

C sorting of problem and finding of objective function

D Identification of problem and finding of objective function

Answer B
Marks 1
Unit 1
Id
Question Long form of LPP is

A Linear programming problem

B Linear Problem parameters

C Linear programming parameters

D all of above

Answer A
Marks 1
Unit 1
Id
Question Assignment model can be applied in

A Decision making

B Problem solving

C Manufacturing Industry

D Only in service sector

Answer A
Marks 1
Unit 1
Id
Question A dummy job is an

A Imaginary

B Real

C Rigid

D Can’t say

Answer A
Marks 1
Unit 1
Id
Question In transportation problem following are always transported
A Consignments
B Goods

C Demand

D Supply
Answer A
Marks 1
Unit 1
Id
Question . Initial basic solution from VAM IS

A Least

B Maximum

C Can’t say

D None of above

Answer A
Marks 1
Unit 1
Id
Question Demand variation occurs because of change in

A Customer preference

B Competitors entry

C Market condition

D None of above

Answer A
Marks 1
Unit 1
Id
Question Following represents the aim or goal of the system

A Decision variable

B Objective function

C Constraints
D None of above

Answer B
Marks 1
Unit 1
Id
Question In real life supply & demand requirement will be rarely

A Unequal

B Equal

C Stable

D None of above

Answer B
Marks 1
Unit 1
Id
Question Lpp is widely used ………………modeling technique

A Mathematical

B Statistical

C Graphical

D None of above

Answer A
Marks 1
Unit 1
Id
Question LP Consists of linear objectives &……………….
A Linear variables

B Linear constraints

C Linear functions

D None of above

Answer B
Marks 1
Unit 1
Id
Question .………………… represents the aim of the system.

A Constraints

B Decision variable

C Objective functions

D Can’t say

Answer C
Marks 1
Unit 1
Id
Question .…………………method solve the LPP in iteration to enhance the value of the objective
function

A Complex

B Simplex

C Corner point

D Iso profit

Answer B
Marks 1
Unit 1
Id
Question …………….is special type of linear programming

A Transportation problem

B Assignment

C Cann’t say
D Queuing

Answer A
Marks 1
Unit 1
Id
Question …………… model helps to manager to take decision

A Transportation

B Assignment

C LPP

D All above

Answer D
Marks 1
Unit 1
Id
Question ……………is used to collect a set of experimental data and figure out to graph

A LPP

B Mathematical model

C Corner point model

D Operation research model

Answer B
Marks 1
Unit 1
Id
Question Initial basic solution can be obtained by modified distribution method

A TRUE

B FALSE

C Cannot say

D Data is not sufficient

Answer B
Marks 1
Unit 1
Id
Question Least cost method is a best method to find basic solution
A TRUE

B FALSE

C Cannot say

D Data is not sufficient

Answer B
Marks 1
Unit 1
Id
Question …………. Method is more accurate

A North west corner

B Least cost

C VAM

D None of above

Answer C
Marks 1
Unit 1
Id
Question In a balanced transportation model where supply equals demand,

A all constraints are equalities

B none of the constraints are equalities

C all constraints are inequalities

D none of the constraints are inequalitie

Answer A
Marks 1
Unit 1
Id
Question . In a transportation problem, items are allocated from sources to destinations
A . at a maximum cost
B at a minimum cost
C at a minimum profit
D at a minimum revenue
Answer B
Marks 1
Unit 1
Id
Question The assignment model is a special case of the ________ model.
A maximum-flow
B transportation
C shortest-route
D none of the above
Answer D
Marks 1
Unit 1
Id
Question The linear programming model for a transportation problem has constraints for supply at each
______ and _______ at each destination.
A destination / source
B source / destination
C demand / source
D source / demand

Answer A
Marks 1
Unit 1
Id
Question An assignment problem is a special form of transportation problem where all supply and demand
values equal
A 0
B 1
C 2
D 3
Answer A
Marks 1
Unit 1
Id
Question In the linear programming formulation of the shortest route problem, there is one constraint for
each node indicating
A capacity on each path
B whatever comes into a node must also go out
C capacity on each arc
D maximum capacity on a path

Answer A
Marks 1
Unit 1
Id
Question The minimal spanning tree problem determines the ___________ total branch lengths connecting
all nodes in the network
A selected
B maximum
C minimum
D divided

Answer B
Marks 1
Unit 1
Id
Question The objective of the maximal flow solution approach is to _________ the total amount of flow
from an origin to a destination

A minimize
B maximize
C discriminate
D divide

Answer B
Marks 1
Unit 1
Id
Question Once a project is underway, the project manager is responsible for the
A people
B cost
C time
D all of the above
Answer D
Marks 1
Unit 1
Id
Question Attributes of decision-making techniques include all of the following except:
A payoffs
B constraints
C alternatives
D states of nature

Answer B
Marks 1
Unit 1
Id
Question .With the criterion ____________, the decision maker attempts to avoid regret.
A minimax regret
B equal likelyhood
C Hurwicz
D maximin
Answer A
Marks 1
Unit 1
Id
Question To lose the opportunity to make a defined profit by making the best decision is referred to as:
A equal likelihood criterion
B state
C payoff
D regret
Answer D
Marks 1
Unit 1
Id
Question When is it most appropriate to use a decision tree?
A if the decision maker wishes to minimize opportunity loss
B if a decision situation requires a series of decisions
C if the decision maker must use perfect information
D if all states of nature are equally likely to occur
Answer B
Marks 1
Unit 1
Id
Question The coefficient of optimism may be selected to being a value between:
A 0 and -1
B 0 and +1
C -1 and +1
D -6 and +6
Answer B
Marks 1
Unit 2
Id
Question The expected opportunity loss criterion will always result in the same decision as the expected
value criterion
A TRUE
B False
C Cannot say
D Insufficient information
Answer B
Marks 1
Unit 1
Id
Question A cereal company that is planning on marketing a new low-cholesterol cereal should be concerned
about the states of nature--that is the probability that people will stay interested in eating healthy
foods.
A TRUE
B False
C Cannot say
D Insufficient information
Answer A
Marks 1
Unit 1
Id
Question The length of a queue
A could be finite
B could be infinite
C can constantly change
D all of the above
Answer B
Marks 2
Unit 2
Id
Question Items may be taken from a queue
A on a first-come-first-serve basis
B on a last-come-first-serve basis
C according to the due date of the item
D all of the above
Answer A
Marks 2
Unit 2
Id
Question Which of the following items is not a part of the queuing system?
A arrival rate
B service facility
C waiting line
D activity flow
Answer D
Marks 2
Unit 2
Id
Question In a single-server queuing model, the average number customers in the queuing system is
calculated by dividing the arrival rate by:
A service rate
B service time
C service rate minus arrival rate
D service rate plus arrival rate
Answer C
Marks 2
Unit 2
Id
Question The most important factors to consider in analyzing a queuing system are
A the service and arrival rate
B the nature of the calling population
C The queue discipline
D all of the above
Answer D
Marks 2
Unit 2
Id
Question Queuing analysis is a deterministic technique.

A TRUE
B False
C Cannot say
D Insufficient information
Answer A
Marks 2
Unit 2
Id
Question The operating characteristics of a queuing system provide information rather than an optimization
of a queuing system
A TRUE
B False
C Cannot say
D Insufficient information
Answer A
Marks 2
Unit 2
Id
Question The applicability of forecasting methods depends on

A the time frame of the forecast

B the existence of patterns in the forecast
C the number of variables to which the forecast is related
D All of the above
Answer C
Marks 1
Unit 1
Id
Question ._________ is a gradual, long-term, up or down movement of demand.

A seasonal pattern

B cycle

C trend

D prediction

Answer A
Marks 1
Unit 1
Id
Question .___________ is good for stable demand with no pronounced behavioral patterns.

A longer-period moving average

B shorter-period moving average
C moving average
D weighted moving average
Answer D
Marks 1
Unit 1
Id
Question The Delphi method for acquiring informed judgments and opinions from knowledgeable
individuals uses a series of questionnaires to develop a consensus forecast about what will occur
in the future.
A TRUE
B False
C Cannot say
D Insufficient information
Answer A
Marks 2
Unit 2
Id
Question .___________ methods assume that what has occurred in the past will continue to occur in the
future.
A Time series
B Regression
C Quantitative
D Qualitative
Answer A
Marks 1
Unit 1
Id
Question .In exponential smoothing, the closer alpha is to ___________, the greater the reaction to the most
recent demand.

A -1
B 0
C 1
D 2
Answer B
Marks 1
Unit 2
Id
Question Time series methods tend to be most useful for short-range forecasting.

A TRUE
B False
C Cannot say
D Insufficient information
Answer A
Marks 1
Unit 1
Id
Question An exponential smoothing forecast will react more strongly to immediate changes in the data than
the moving average.

A TRUE
B False
C Cannot say
D Insufficient information
Answer B
Marks 1
Unit 1
Id
Question Longer-period moving averages react more quickly to recent demand changes than do shorter-
period moving averages.

A TRUE
B False
C Cannot say
D Insufficient information
Answer A
Marks 1
Unit 1
Id
Question the first step in a solving operation research problem is

A Model Building

B Obtain alternate solution

C Interpreting the variables

D Formulation of the probl;em

Answer D
Marks 1
Unit 1
Id
Question The distinguishing features of an LPP model is

A Relationship among all the variable is linear

B It has single objective function and constraints

C Value of the decision variable is non negative

D All of above

Answer D
Marks 1
Unit 1
Id
Question The constraints of a maximization problem are normally of

A Less than or equal type

B Greater than or equal type

C Less than type

D Greater than type

Answer A
Marks 1
Unit 1
Id
Question Resources in a LPP problem are indicate d by
A Objective function

B Decision variables

C Constraints

D Slack variables

Answer B
Marks 1
Unit 1
Id
Question In graphical solution of solving LP problem to convert inequalities in to equations we

A Use slack variables

B Use surplus variables

C Draw lines

D Simply assume them as equations

Answer D
Marks 1
Unit 1
Id
Question For constraints of the type ≤ we mark the feasible region as

A The region not containing region

B The region containing the origin

C The region on the line

D The region in the first quadrant

Answer B
Marks 1
Unit 1
Id
Question An isoprofit line represents

A An infinite number of solutions all of which yield the same profit

B An infinite number of solutions all of which yield the maximum profit

C An infinite number of optimum solution

D A boundry of the feasible region

Answer A
Marks 1
Unit 1
Id
Question In a graphical solution of minimization problem we move the Iso- cost line

A Towards right

B Towards left

C Towards the origin

D Away from origin

Answer D
Marks 1
Unit 1
Id
Question In a graphical method of LP problem the optimal solution happens to be

A One of the constraint line

B Origin

C One of the corner point

D One of the central point

Answer C
Marks 1
Unit 1
Id
Question If an Iso profit line yielding the optimal solution coincides with a consraints lone then

A The solution is unbounded

B The solution is infeasible

C The coinciding constraints is redundant

D None of the above

Answer C
Marks 1
Unit 1
Id
Question The dummy sources or destinations in a transportation problem is added to

A Satify the RIM condition

B Present solution from becoming degenerate

C Ensure that the total cost does not exceed a limit

D None of the above

Answer D
Marks 1
Unit 1
Id
Question The solution of a transportation problem with m- rows(Supplies) and n-
columns(destinations) is feasible if the number of occupied cells are

A M+n

B M*n

C M+n-1

D M+n+1

Answer C
Marks 1
Unit 1
Id
Question While improving a a solution of a transportation problem we relocate units to the
unoccupied cell having its oppurtinity cost as

A Equal to zero

B Most negative number

C Most positive number

D Any value

Answer B
Marks 1
Unit 1
Id
Question Multiple optimal solution for a transportation problem are indicated in the optimum table
by

A Occupied cells with positive opportunity costs

B Un Occupied cells with zero opportunity costs

C Occupied cells with zero opportunity costs

D Un Occupied cells with positive opportunity costs

Answer B
Marks 1
Unit 1
Id
Question To solve a transportation problem for minimization the relative loss matrix is obtained by

A Substracting all the elements from the largest element of the matrix

B Substracting smallest element from all elements of the matrix

C Treating maximum elements at

D Adding a dummy raw or column

Answer A
Marks 1
Unit 1
Id
Question In Monte carlo simulation random number are used to

A Calculate the probabilities

B Calculate cumulative probabilities

C Simulate the values of the variable

D Summarise the output

Answer C
Marks 1
Unit 2
Id
Question Allocations to the dummy row cells in the optimum solution of a transportation problem
indicate

A Unutlised resources at the respective origins

B Shortage of resources of the respective origins

C Unutlised demand at the respective destinations

D Unfulfilled demand at the respective destinations

Answer D
Marks 1
Unit 1
Id
Question While using random numbers Monte carlo simulation it is

A Not necessary to assign the exact range of random numbers

B Necessary to find out the cumulative probability distribution

C Necessary to use particular random numbers

D None of the above

Answer A
Marks 1
Unit 2
Id
Question MODI stands for

A Modern distributions

B Markov distribution method

C Modified distribution method

D Model index method

Answer C
Marks 1
Unit 1
Id
Question The purpose of simulation technique is to

A Create a real world situation

B Avoid cost of experimenting on real situation

C Approximately understand the behaviour of real life situation

D All of the above

Answer C
Marks 1
Unit 2
Id
Question transportation problem is basically

A Iconic model

B Transshipment model

C Maximization model

D Minimization model
Answer B
Marks 1
Unit 1
Id
Question The prohibited cell in a transportation problem is considered by considering its costs

A ∞

B -∞
C 0

D negative

Answer C
Marks 1
Unit 1
Id
Question The opportunity cost /penalty of a row in VAM is obtained by

A Deducting smallest element in the row from all other element of the row

B Deducting a smallest element in the row from the next higgest element of the row

C Deducting a smallest element from the higgest element of the row

D Adding smallest element in the row to the next higgest element of the row
Answer B
Marks 1
Unit 1
Id
Question In Monte carlo simulation the solution obtained using different set of random number will
be

A Different

B Exactly same

C Non-real

D None of the above

Answer A
Marks 1
Unit 2
Id
Question Assignment problem is solved by

A simplex method

B graphical method

C Vector method

D Hungarian method

Answer D
Marks 1
Unit 1
Id
Question Lpp is widely used ………………modeling technique

A Mathematical

B Statistical

C Graphical

D None of above

Answer A
Marks 1
Unit 1
Id
Question To balance an assignment matrix we have to

A Add a dummy row or column depending on given situation

B Add a dummy row

C Add a dummy column

D Remove a row or column depending upon the given situation

Answer A
Marks 1
Unit 1
Id
Question LP Consists of linear objectives &……………….
A Linear variables

B Linear constraints

C Linear functions

D None of above

Answer A
Marks 1
Unit 1
Id
Question The pproperty of the optimum assignment matrix is

A It will have zero as element of one diagonal

B It will have zero as element of atleast one row or column

C It will have atleast one zero in each row and column

D It will not have zero as its element

Answer A
Marks 1
Unit 1
Id
Question .………………… represents the aim of the system.

A Constraints

B Decision variable

C Objective functions

D Cann’t say

Answer C
Marks 1
Unit 1
Id
Question An optimum assignment requires that the minimum number of lines which can be drawn
through the squares zero opportunity cost to be equal to the number of

A Rows or columns

B Rows and columns

C Rows + columns-1

D Rows + columns+1

Answer A
Marks 1
Unit 1
Id
Question .…………………method solve the LPP in iteration to enhance the value of the objective
function

A Complex

B Simplex

C Corner point

D Iso profit

Answer B
Marks 1
Unit 1
Id
Question The assignment problem

A Requires that only one activity be assigned to each resources

B In a special case of transportation problem

C Can be used for maximization objective

D All of the above

Answer A
Marks 1
Unit 1
Id
Question .…………….is special type of linear programming

A Transportation problem

B Assignment

C Can’t say

D Queuing

Answer A
Marks 1
Unit 1
Id
Question To convert the assignment problem in to maxamization problem

A Deduct smallest element in the matrix from all other elements

B Deduct smallest element of the matrix from the largest element in it

C Deduct smallest element of each row from other elements in it

D Deduct smallest element of each row from the largest element in it

Answer B
Marks 1
Unit 1
Id
Question .…………. Method is more accurat

A North west corner

B Least cost

C VAM

D None of above

Answer C
Marks 1
Unit 1
 Id
Question .…………… model helps to manager to take decision

A Transportation

B Assignment

C LPP

D All above
Answer D
Marks 1
Unit 1
Id
Question If the assignment matrix is not optimal (after drawing the lines) then to improve it

A Add smallest uncovered element to the elements on the lines

B Substract smallest uncovered element from the inter section element of the lines

C Substract smallest uncovered element from all uncovered elements

D Substract smallest element from the elements

Answer C
Marks 1
Unit 1
Id
Question Floods technique of solving an assignment matrix uses the concept of

A Maximum cost

B Minimum cost

C Opportunity cost

D Negative cost

Answer B
Marks 1
Unit 1
Id
Question .……………is used to collect a set of experimental data and figure out to graph
 A LPP

B Mathematical model

C Corner point model

D Operation research model

Answer A
Marks 1
Unit 1
Id
Question Floods technique of solving an assignment matrix uses the concept of

A Maximum cost

B Minimum cost

C Opportunity cost

D Negative cost

Answer B
Marks 1
Unit 1
Id
Question Initial basic solution can be obtained by modified distribution method

A TRUE

B False

C Cannot say

D Data is not sufficient

Answer B
Marks 1
Unit 1
Id
Question Prohibited assignment In an assignment problem is addressed by

A Considering its cost as negative

B Considering its cost as INFINITY

C Considering its cost as zero

D None of the above

Answer B
Marks 1
Unit 1
Id
Question The field of management science

A concentrates on the use of quantitative methods to assist in decision making.

B approaches decision making rationally, with techniques based on the scientific method.

C is another name for decision science and for operations research.

D each of the above is true.

Answer D
Marks 1
Unit 1
Id
Question Least cost method is a best method to find basic solution

A TRUE

B FALSE

C Cannot say

D Data is not sufficient

Answer B
Marks 1
Unit 1
Id
Question the characteristics of Queuing model is independent of
A Number of servers

B Limit of queue length

C Service pattern

D Queue discipline

Answer A
Marks 1
Unit 2
Id
Question Identification and definition of a problem

A cannot be done until alternatives are proposed.

B is the first step of decision making.

C is the final step of problem solving.

D requires consideration of multiple criteria

Answer B
Marks 1
Unit 1
Id
Question In a Queuing model notation(a/b/c):d/e), what does c represent

A Arrival rate

B Service pattern

C Number of servers

D Capacity of the system

Answer C
Marks 1
Unit 2
Id
Question The quantitative analysis approach requires

A the manager’s prior experience with a similar problem.

B a relatively uncomplicated problem.

C mathematical expressions for the relationships.

D each of the above

Answer C
Marks 1
Unit 1
Id
Question
Which of the following costs estimates and performance measures are not used for
economic analysis of queuing system

A Cost per server per unit of time

B Cost per unit of time for a customer waiting in the system

C Average number of customer in the system

D Average waiting time of the customer in the system

Answer B
Marks 1
Unit 2
Id
Question A physical model that does not have the same physical appearance as the object being modeled is

A an analog model.

B an iconic model.

C a mathematical model.

D a qualitative model.

Answer A
Marks 1
Unit 1
Id
Question For a simple queue, traffic intensity is given by

A Mean arrival rate/mean service rate

B Number present in the queue/number served

C Mean Arrival Rate

D mean service rate

Answer A
Marks 1
Unit 2
Id
Question Management science and operations research both involve

A qualitative managerial skills.

B quantitative approaches to decision making.

C operational management skills.

D scientific research as opposed to applications.

Answer B
Marks 1
Unit 1
Id
Question Customer behaviour in which he moves from one queque to another in multiple channel
situation is

A Backing

B Reneging

C Jockeying

D Alternating

Answer D
Marks 1
Unit 2
Id
Question George Dantzig is important in the history of management science because he developed
A the scientific management revolution.

B World War II operations research teams.

C the simplex method for linear programming.

D powerful digital computers

Answer C
Marks 1
Unit 1
Id
Question A calling population in a queuing system is considered to be infinite when

A All the customer arrive at once

B Arrivals are independent of each other

C Arrivals are depending upon each other

D All of the above

Answer A
Marks 1
Unit 1
Id
Question A model that uses a system of symbols to represent a problem is called

A mathematical.

B iconic.

C analog.

D constrained

Answer A
Marks 1
Unit 1
Id
Question Which of the following is not an assumption of the single server queuing method

A Service times are poisson distributed

B Queue discipline is not first came first serve

C Mean arrival rate < mean service rate

D Arrivals follow poisson distribution

Answer D
Marks 1
Unit 1
Id
Question Slack

A is the difference between the left and right sides of a constraint.

B is the amount by which the left side of a < constraint is smaller than the right side.

C is the amount by which the left side of a > constraint is larger than the right side.

D exists for each variable in a linear programming problem.

Answer B
Marks 1
Unit 1
Id
Question In a matrix of transition probability the probability values should add upto one in each

A Row

B Column

C Diagonal

D All of the above

Answer A
Marks 1
Unit 1
Id
Question Which of the following special cases does not require reformulation of the problem in
 order to obtain a solution?

A alternate optimality

B infeasibility

C unboundedness

D each case requires a reformulation.

Answer A
Marks 1
Unit 1
Id
Question Simulation, not being an analytical methods its result must be viewed as

A Unrealistic

B Exact

C Approximation

D Simplified

Answer C
Marks 1
Unit 1
Id
Question In the transition probabilities matrix the diagonal elements represent the probability of

A Gain

B Loss

C Transition

D Retention

Answer C
Marks 1
Unit 1
Id
Question The range of feasibility measures

A the right-hand-side values for which the objective function value will not change.
B the right-hand-side values for which the values of the decision variables will not change.

C the right-hand-side values for which the dual prices will not change.

D each of the above is true.

Answer C
Marks 1
Unit 1

Id
Question Which of the following is not an assumption of Markov analysis

A The number of possible states are limited

B The transition probabilities are not changed over a time

C There are limited number of future periods

D Future state can be predicted from preceding state

Answer B
Marks 1
Unit 1
Id
Question The amount that the objective function coefficient of a decision variable would have to
improve before that variable would have a positive value in the solution is the

A dual price.

B surplus variable.

C reduced cost.

D upper limit.
Answer C
Marks 1
Unit 1

Id
Question The values in the cj - zj , or net evaluation, row indicate

A the value of the objective function.

B the decrease in value of the objective function that will result if one unit of the variable
corresponding to the jth column of the A matrix is brought into the basis.

C the net change in the value of the objective function that will result if one unit of the
variable corresponding to the jth column of the A matrix is brought into the basis.

D the values of the decision variables.

Answer C
Marks 1
Unit 1
Id
Question In the simplex method, a tableau is optimal only if all the cj – zj values are

A zero or negative.

B zero.

C negative and nonzero.

D positive and nonzero.

Answer A
Marks 1
Unit 1
Id
Question For the basic feasible solution to remain optimal

A all cj - zj values must remain  0.

B no objective function coefficients are allowed to change.

C the value of the objective function must not change.

D each of the above is true.

Answer A
Marks 1
Unit 1
Id
Question The parts of a network that represent the origins are

A the axes
B the flow

C the nodes

D the arrows
Answer C
Marks 1
Unit 1
Id

Question The dual variable represents

A the marginal value of the constraint

B the right-hand-side value of the constraint

C the artificial variable

D the technical coefficient of the constraint

Answer A
Marks 1
Unit 1
Id
Question The number of units shipped from origin i to destination j is represented by

A xij.

B xji.

C cij.

D cji.

Answer A
Marks 1
Unit 1
Id
Question The difference between the transportation and assignment problems is that
A total supply must equal total demand in the transportation problem

B the number of origins must equal the number of destinations in the transportation problem
C each supply and demand value is 1 in the assignment problem

D there are many differences between the transportation and assignment problems

Answer C
Marks 1
Unit 1
Id
Question 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 alternatives is correct.

Answer D
Marks 1
Unit 1
Id
Question Arcs in a transshipment problem

A must connect every node to a transshipment node.

B represent the cost of shipments.

C indicate the direction of the flow.

D All of the alternatives are correct

Answer C
Marks 1
Unit 1
Question To use the Hungarian method, a profit-maximization assignment problem requires

A converting all profits to opportunity losses.

B a dummy agent or task.

C matrix expansion.

D finding the maximum number of lines to cover all the zeros in the reduced matrix.
Answer A
Marks 1
Unit 1
Id

Question Which method usually gives a very good solution to the assignment problem?

A northwest corner rule

B Vogel's approximation method

C MODI method

D none of above
Answer D
Marks 1
Unit 1
Id
Question 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 sum of the unit costs in each row or column.

D finding the difference between the two lowest unit costs in each row and column
Answer D
Marks 1
Unit 1

Question 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

Answer D
Marks 1
Unit 1

Question The transportation model relies on certain assumptions. They include all of the following except

A the items must be homogeneous

B there is only one route being used between each origin and destination

C the shipping cost per unit is the same

D the items must be large scale

Answer D
Marks 1
Unit 1
Id
Question Which of the following are supply points that a transportation model can analyze?

A factories

B warehouses

C departments

D all of the above

Answer D
Marks 1
Unit 1

Question The basis for the transportation model is

A a way to provide a map for people to see results

B a method to arrive at the lowest total shipping cost

C so delivery drivers know where to go

D a form of accounting

Answer B
Marks 1
Unit 1
Id
Question The following transportation model is a programming model:
A analytical

B non-linear

C linear

D rotating

Answer C

Marks 1
Unit 1
Id
Question Before the analyst of the transportation model can begin, what data would they need to collect?

A A list of destinations

B Unit cost to ship

C A list of origins

D All of the above

Answer D
Marks 1
Unit 1
Id
Question What does the transportation problem involve finding:

A highest cost-plan

B lowest cost-plan

C closest destinations

D farthest destinations

Answer B
Marks 1
Unit 1
Id
Question Transportation problems be solved

A manually

B with a table
C with excel

D all of the above

Answer D
Marks 1
Unit 1
Id
Question The objective function of the transportation model is to

A reduce shipping costs

B decrease shipping distance

C maximize costs

D minimize costs

Answer D
Marks 1
Unit 1
Id
Question Goods are not sent from

A warehouses

B factories

C grocery stores

D department stores

Answer C
Marks 1
Unit 1
Id
Question Goods are received at all of the following except

A docks

B departments

C factories

D warehouses
Answer A
Marks 1
Unit 1
Id
Question The method for finding the lowest-cost plan for distributing stocks of goods or supplies from
multiple origins to multiple destinations that demand the goods is

A cost-volume analysis

B transportation model analysis

C factor rating analysis

D linear regression analysis

Answer B
Marks 1
Unit 1
Id
Question Except to be used to minimized the costs associated with distributing good, transportation model
can also be used in

A production planning

B capacity planning

C transshipment problem

D all of the above

Answer D
Marks 1
Unit 1
Id
Question Which one of the following is a linear programming model ?

A Cost-volume analysis

B Transportation model analysis

C Factor rating analysis

D Linear regression analysis

Answer B
Marks 1
Unit 1
Id
Question Destination points are

A points that receive goods from factories, warehouses, and departments

B points where goods are sent from factories, warehouses, and departments

C supply points

D selling points

Answer A
Marks 1
Unit 1
Id
Question Transportation problems can be solved manually in a straightforward manner except for

A medium problems

B very small, but time consuming problems

C large problems

D all of the above

Answer D
Marks 1
Unit 1
Id
Question The transportation model is a

A linear model

B quadratic model

C model with two variables

D both a and c

Answer D
Marks 1
Unit 1
Id
Question The transportation model is used to determine

A what type of transportation to use (boat, truck, train or plane) to transport goods, while minimizing
costs

B what day of the week goods should be transportation on to minimize costs

C how to distribute goods from multiple origins to multiple destinations to minimize total
shipping costs

D how to best package goods so that they wouldn't break while transporting them

Answer C
Marks 1
Unit 1
Id
Question What assumption is used in the transportation model?:

A The items to be shipped are heterogeneous.

B Shipping cost per unit is the different regardless of the number of units shipped

C There is more than one route or mode of transportation being used between each origin and each
destination.

D The items to be shipped are the same regardless of their source or destination

Answer D
Marks 1
Unit 1
Id
Question Which of the following is needed for a transportation model?

A a list of origins and each one's capacity or supply quantity per period

B a list of destinations and each one's demand per period

C the unit cost of shipping items from each origin to each destination

D all of the above

Answer D
Marks 1
Unit 1
Id
Question The transportation model is a linear __ model.
A solution

B programming

C data

D shipping

Answer B
Marks 1
Unit 1
Id
Question When a team of scientists from different disciplines work together for finding the best
possible solution in the interest of the organization as a whole then the solution thus
obtained is called ______________________.

A Feasible solution
B Optimum strategy
C Optimal decision
D Quantitative solution
Answer A
Marks 1
Unit 1
Id
Question 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
Answer B
Marks 1
Unit 1
Id
Question Both objective functions and constraints can be expressed as ____________________.

A Linear equalities
B Non-linear equalities
C Linear inequalities
D Non-linear inequalities
Answer C
Marks 1
Unit 1
Id
Question When a linear programming problem is represented in the canonical form, the
minimization 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
Answer B
Marks 1
Unit 1
Id
Question When a linear programming problem is represented in the canonical form, all constraints
are of ________ type.

A =
B ≥
C ≠
D ≤
Answer A
Marks 1
Unit 1
Id
Question 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
Answer B
Marks 1
Unit 1
Id
Question 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
Answer B
Marks 1
Unit 1
Id
Question 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
Answer C
Marks 1
Unit 1
Id
Question To obtain inequality constraints introduce _________ variables (Si’s) for <= type of
constraint.

A Stack
B Surplus
C Slack
D Artificial
Answer D
Marks 1
Unit 1
Id
Question The new system after adding artificial variable is equivalent to the old system of
constraints only if the artificial variables are valued at ________.

A One
B Three
C Two
D Zero
Answer D
Marks 1
Unit 1
Id
Question For long term planning, it is important to know the bounds within which each available
resource can vary, without causing drastic changes in the current ______________
solution.

A Non optimal
B Degenerate
C Optimal
D Unbounded
Answer B
Marks 1
Unit 1
Id
Question The unit cost to ship from each source to each destination is written in the
____________________ corner of the cell in the matrix.

A Lower-right-hand
B Lower-left-hand
C Upper-right-hand
D Upper-left-hand
Answer C
Marks 1
Unit 1
Id
Question A ___________ is the sequence of cells in the transportation table such that no cell
appears more than once in the sequence.
A Loop
B Rim
C Degeneracy
D Transportation problem
Answer A
Marks 1
Unit 1
Id
Question Identify in which among the following methods does a row or column difference indicate
the minimum unit penalty incurred by failing to make an allocation to the least cost cell in
that row or column.

A Matrix minima method

B MODI method
C Vogel’s approximation method
D North-west corner rule
Answer A
Marks 1
Unit 1
Id
Question In infeasible assignment problem _______ value is assigned to the cells.

A ∞
B 1
C 0
D -1
Answer C
Marks 1
Unit 1
Id
Question 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
Answer C
Marks 1
Unit 1
Id
Question .____________ 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 Preemptive priority
Answer A
Marks 1
Unit 2
Id
Question When the customer arrivals are completely random, the ____________ is followed.

A Deterministic model
B Statistical model
C Poisson distribution
D Probability concept
Answer C
Marks 1
Unit 2
Id
Question 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
Answer C
Marks 1
Unit 2
Id
Question Lending system in a library manned by single librarian is an example of
____________________ waiting line.

A Simplest waiting line

B Single facility waiting channel
C Multiple channel
D Parallel facility
Answer B
Marks 1
Unit 2
Id
Question The technique of Monte Carlo involves the selection of _____________ observations
within the simulation model.

A Random
B Discrete
C Sequential
D In-discrete
Answer A
Marks 1
Unit 2