This download link is referred from the post: Calicut University M.Com 2020 Important Questions (Question Bank) || (University of Calicut)
MANGEMENT SCIENCE
- In a balanced transportation model where supply equals demand,
- all constraints are equalities
- none of the constraints are equalities
- all constraints are inequalities
- none of the constraints are inequalities
--- Content provided by FirstRanker.com ---
- In a transportation problem, items are allocated from sources to destinations
- at a maximum cost
- at a minimum cost
- at a minimum profit
- at a minimum revenue
--- Content provided by FirstRanker.com ---
- The assignment model is a special case of the ________ model.
- maximum-flow
- transportation
- shortest-route
- none of the above
--- Content provided by FirstRanker.com ---
- The linear programming model for a transportation problem has constraints for supply at each ________ and ________ at each destination.
- destination / source
- source / destination
- demand / source
- source / demand
--- Content provided by FirstRanker.com ---
- An assignment problem is a special form of transportation problem where all supply and demand values equal
- 0
- 1
- 2
- 3
--- Content provided by FirstRanker.com ---
- The transshipment model is an extension of the transportation model in which intermediate transshipment points are ________ between the sources and destinations.
- decreased
- deleted
- subtracted
- added
--- Content provided by FirstRanker.com ---
- Inventory costs include
- carrying
- ordering
- shortage costs
- all of the above
--- Content provided by FirstRanker.com ---
- In a(an) ________ inventory system a constant amount is ordered when inventory declines to a predetermined level.
- optional
- economic
- periodic
- continuous
--- Content provided by FirstRanker.com ---
- EOQ is a(an) ________ inventory system.
- periodic
- continuous
- optimal
- economic
--- Content provided by FirstRanker.com ---
- In the linear programming formulation of the shortest route problem, there is one constraint for each node indicating
- capacity on each path
- whatever comes into a node must also go out
- capacity on each arc
- a maximum capacity on a path
--- Content provided by FirstRanker.com ---
- The minimal spanning tree problem determines the ________ total branch lengths connecting all nodes in the network
- selected
- maximum
- minimum
- divided
--- Content provided by FirstRanker.com ---
- The objective of the maximal flow solution approach is to ________ the total amount of flow from an origin to a destination
- minimize
- maximize
- discriminate
- divide
--- Content provided by FirstRanker.com ---
- If an activity cannot be delayed without affecting the entire project, it is a ________ activity
- completed
- critical
- conjugated
- none of the above
--- Content provided by FirstRanker.com ---
- A ________ represents the beginning and end of activities, referred to as events.
- path
- arc
- branch
- node
--- Content provided by FirstRanker.com ---
- When an activity is completed at a node, it has been
- finished
- ended
- realized
- completed
--- Content provided by FirstRanker.com ---
- Project management differs from management for more traditional activities mainly because of
- its limited time frame
- its unique set of activities
- a and b
- none of the above
--- Content provided by FirstRanker.com ---
- The critical path is the ________ time the network can be completed.
- maximum
- minimum
- longest
- shortest
--- Content provided by FirstRanker.com ---
- Attributes of decision-making techniques include all of the following except:
- payoffs
- constraints
- alternatives
- states of nature
--- Content provided by FirstRanker.com ---
- With the criterion ________, the decision maker attempts to avoid regret.
- minimax regret
- equal likelihood
- Hurwicz
- maximin
--- Content provided by FirstRanker.com ---
- To lose the opportunity to make a defined profit by making the best decision is referred to as:
- equal likelihood criterion
- state
- payoff
- regret
--- Content provided by FirstRanker.com ---
- The length of a queue
- could be finite
- could be infinite
- can constantly change
- all of the above
--- Content provided by FirstRanker.com ---
- Items may be taken from a queue
- on a first-come-first-serve basis
- on a last-come-first-serve basis
- according to the due date of the item
- all of the above
--- Content provided by FirstRanker.com ---
- Which of the following items is not a part of the queuing system?
- arrival rate
- service facility
- waiting line
- activity flow
--- Content provided by FirstRanker.com ---
- In a single-server queuing model, the average number customers in the queuing system is calculated by dividing the arrival rate by:
- service rate
- service time
- service rate minus arrival rate
- service rate plus arrival rate
--- Content provided by FirstRanker.com ---
- The most important factors to consider in analyzing a queuing system are
- the service and arrival rate
- the nature of the calling population
- the queue discipline
- all of the above
--- Content provided by FirstRanker.com ---
- Queuing analysis is a deterministic technique.
- True
- False
--- Content provided by FirstRanker.com ---
- The operating characteristics of a queuing system provide information rather than an optimization of a queuing system.
- True
- False
- The applicability of forecasting methods depends on
- the time frame of the forecast
- the existence of patterns in the forecast
- the number of variables to which the forecast is related
- all of the above
--- Content provided by FirstRanker.com ---
- Management Science process includes
- defining problem
- developing model
- both a and b
- a only
--- Content provided by FirstRanker.com ---
- ________ is an idealised representation of real life
- model
- module
- analogue
- iconic model
--- Content provided by FirstRanker.com ---
- If the value of the game is zero it is called
- zero sum game
- two person zero game
- fair game
- none
--- Content provided by FirstRanker.com ---
- Principles of modelling ?
- simplicity
- validity
- clarity
- all of the above
--- Content provided by FirstRanker.com ---
- The outcome of a game in the form of gain or losses is called.......
- pay off
- saddle point
- pay off matrix
- none
--- Content provided by FirstRanker.com ---
- The loss incurred because of failure to take the best possible decision
- opportunity loss
- contemporary loss
- opportunity cost
- expected loss
--- Content provided by FirstRanker.com ---
- For a linear programming equations, convex set of equations is included in region of
- feasible solutions
- disposed solutions
- profit solutions
- loss solutions
--- Content provided by FirstRanker.com ---
- In graphical solutions of linear inequalities, solution can be divided into
- one subset
- two subsets
- three subsets
- four subsets
--- Content provided by FirstRanker.com ---
- Linear programming used to optimize mathematical procedure and is
- subset of mathematical programming
- dimension of mathematical programming
- linear mathematical programming
- all of above
--- Content provided by FirstRanker.com ---
- In linear programming, objective function and objective constraints are
- solved
- linear
- quadratic
- adjacent
--- Content provided by FirstRanker.com ---
- What refers to Linear Programming that includes an evaluation of relative risks and uncertainties in various alternatives of choice for management decisions?
- Probabilistic Programming
- Stochastic Programming
- Both A and B
- Linear Programming
--- Content provided by FirstRanker.com ---
- What enables us to determine the earliest and the latest times for each of the events and activities and thereby helps in the identification of the critical path?
- Programme Evaluation
- Review Technique(PERT)
- Both A and B
- Deployment of resources
--- Content provided by FirstRanker.com ---
- ________ models involves the allocation of resources to activities in such a manner that some measure of effectiveness is optimized.
- Sequencing
- Allocation Models
- Queuing Theory
- Decision Theory
--- Content provided by FirstRanker.com ---
- Allocation problems can be solved by
- Linear Programming Technique
- Non – Linear Programming Technique
- Both A and B
- None of the above
--- Content provided by FirstRanker.com ---
- Allocation Models are ________
- Iconic models
- Analogue Models
- Symbolic Models
- None of the above
--- Content provided by FirstRanker.com ---
- Every LPP is associated with another LPP is called ________
- Primal
- Dual
- Non - linear programming
- None of the above
--- Content provided by FirstRanker.com ---
- As for maximization in assignment problem, the objective is to maximize the ________
- Profit
- optimization
- cost
- None of the above
--- Content provided by FirstRanker.com ---
- ________ is one of the fundamental combinatorial optimization problems.
- Assignment problem
- Transportation problem
- Optimization Problem
- None of the above
--- Content provided by FirstRanker.com ---
- PERT and CPM
- are most valuable when a small number of activities must be scheduled.
- have different features and are not applied to the same situation.
- do not require a chronological relationship among activities.
- have been combined to develop a procedure that uses the best of each
--- Content provided by FirstRanker.com ---
- Arcs in a project network indicate
- completion times.
- precedence relationships.
- activities.
- the critical path.
--- Content provided by FirstRanker.com ---
- Activities G, P, and R are the immediate predecessors for activity W. If the earliest finish times for the three are 12, 15, and 10, then the earliest start time for W
- is 10.
- is 12.
- is 15.
- cannot be determined.
--- Content provided by FirstRanker.com ---
- The critical path
- is any path that goes from the starting node to the completion node.
- is a combination of all paths.
- is the shortest path.
- is the longest path
--- Content provided by FirstRanker.com ---
- Times between two successive requests arriving, called the
- Interarrival time
- Arrival time
- Poisson distribution
- Average residual service time
--- Content provided by FirstRanker.com ---
- With the transportation technique, the initial solution can be generated in any fashion one chooses. The only restriction is that
- the solution must be optimal.
- the solution is not degenerate.
- one must use the northwest-corner method.
- the edge constraints for supply and demand are satisfied.
--- Content provided by FirstRanker.com ---
- Transportation models can be used for which of the following decisions?
- facility location
- production mix
- media selection
- portfolio selection
- employee shift scheduling
--- Content provided by FirstRanker.com ---
- The two most common objectives for the assignment problem are the minimization of
- uncertainty or inexperience
- total costs or inexperience
- total costs or total time
- total time or inexperience
- total costs or uncertainty
--- Content provided by FirstRanker.com ---
- In an assignment problem
- the number of rows and columns must be equal.
- the number of rows must exceed the number of columns.
- the number of rows must equal or exceed the number of columns
- the number of columns must equal or exceed the number of rows.
- none of the above
--- Content provided by FirstRanker.com ---
- The decisions which are affect the business in the short run ?
- tactical solutions
- strategic decisions
- management decisions
- none
--- Content provided by FirstRanker.com ---
- Which of the following methods is used only with the assignment problem?
- the Hungarian method
- stepping-stone method
- MODI method
- Vogel's approximation method
- the simplex method
--- Content provided by FirstRanker.com ---
- Monte Carlo simulation gets its name from which of the following?
- Model formulation
- Analysis
- Data collection
- Random-number assignment
--- Content provided by FirstRanker.com ---
- Which of the following statistical methods are commonly used to analyze simulation results?
- t-tests
- Regression analysis
- Analysis of variance
- All of the above
--- Content provided by FirstRanker.com ---
- VAM stands for ________
- Vogeal's Approximation Method
- Vogel's Approximate Method
- Vangel's Approximation Method
- Vogel's Approximation Method
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
This download link is referred from the post: Calicut University M.Com 2020 Important Questions (Question Bank) || (University of Calicut)