A activity in a network diagram is said to be ______________ if the delay in its start will further delay the project completion time.
1.forward pass
2.backward pass
3.critical.
4.non-critical.
A feasible solution of an Linear Programming Problem that optimizes the objective function is called ______
1.basic feasible solution
2.optimum solution
3.feasible solution
4.solution
A game is said to be strictly determinable if__________
1.maximin value equal to minimax value
2.maximin value is less than or equal to minimax value
3.maximin value is greater than or equal to minimax value
4.maximin value is not equal to minimax value
A Linear Programming Problem have ______________ optimal solution
1.1
2.2
3.more than 1
4.more than 2
All of the following may be used to find the EOQ except ________
1.optimal number of days supply to order
2.number of orders which minimize ordering costs optimal
3.number of rupees per order optimal
4.number of orders per year
An Iso-profit line represents _______
1.a boundary of the feasible region
2.an infinite number of solution all of which yield the same cost
3.an infinite number of solutions all of which yield the same profit
4.an infinite number of optimal solutions
An n-tuple of real numbers which satisfies the constraints of Linear Programming Problem is called ________
1.solution
2.basic solution
3.basic feasible solution
4.feasible solution
An _____ represent the start or completion of some activity and as such it consumes no time
1.activity
2.event
3.slack
4.path
Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has _______
1.solution
2.basic solution
3.basic feasible solution
4.feasible solution
At any iteration of the usual simplex method, if there is at least one basic variable in the basis at zero level and all the index numbers are non-negative, the current solution is _______
1.basic solution
2.non basic solution
3.degenerate
4.non degenerate
Charnes method of penalty is called ________
1.Simplex Method
2.Dual Simplex Method
3.Big-M Method
4.Graphical Method
Chose the correct statement: A degenerate solution is one that______
1.gives an optimum solution to the Linear Programming Problem
2.gives zero value to one or more of the basic variables
3.yields more than one way to achieve the objective
4.makes use of all available resources
Customers arrive at a box office window, being manned ny single individual, according to Poisson input process with mean rate of 20 per hour, while the mean service time is 2 minutes. Which of the following is not true for this system?
1.E(n) = 2 customers
2.E(m) = 4/3 customers
3.E(v) = 6 minutes
4.E(w) = 16 minutes
Economic order quantity results in ________
1.equalisation of carrying cost and procurement cost
2.favourable procurement price
3.reduced chances of stock outs
4.minimization of set up cost
Float analysis is useful for ________
1.total float
2.free float
3.independent float
4.variance of each float
For a salesman who has to visit n cities, following are the ways of his tour plan ______
1.n!
2.(n+a)!
3.(n-a)!
4.n
For finding an optimum solution in transportation problem ______________ method is used.
1.Simplex
2.Big-M
3.Modi
4.hungarian method.
Graphical method is also known as ______
1.Simplex Method
2.Dual Simplex Method
3.Big-M Method
4.Search-Approach Method
If an artificial variable is present in the basic variable column of optimal simplex table, then the problem has ______ solution.
1.alternative
2.no solution
3.bounded
4.infeasible
If one or more variable vanish then a basic solution to the system is called ____
1.non feasible region
2.feasible region
3.degenerate solution
4.basic solution
If the given Linear Programming Problem is in its canonical form then primal-dual pair is _______
1.symmetric
2.un symmetric
3.square
4.non square
If the given Linear Programming Problem is in its standard form then primal-dual pair is ______
1.symmetric
2.un symmetric
3.square
4.triangle
In a network diagram an event is denoted by the symbol _________
1.arrow
2.straight line
3.curve
4.circle
In a transportation table, an ordered set of______________ or more cells is said to form a loop
1.2
2.3
3.4
4.5
In Program Evaluation Review Technique the maximum time that is required to perform the activity under extremely bad conditions is known as _______
1.normal time
2.optimistic time
3.most likely time
4.pessimistic time
In the basic EOQ model, if the lead time increases from 2 to 4 days, the EOQ will ________
1.double increase
2.remain constant
3.but not double
4.decrease by a factor of two
In the network, one activity may connect any ______________ nodes
1.1
2.2
3.3
4.4
Linear Programming Problem is a technique of finding the _____
1.optimal value
2.approximate value
3.initial value
4.infeasible value
Linear Programming Problem that can be solved by graphical method has ______
1.linear constraints
2.quadratic constraints
3.non linear constraints
4.bi-quadratic constraints
Operation research approach is typically based on the use of ________
1.physical model.
2.mathematical model.
3.iconic model.
4.descriptive model.
The assignment problem is a special case of transportation problem in which ______
1.number of origins are less than the number of destinations
2.number of origins are greater than the number of destinations
3.number of origins are greater than or equal to the number of destinations
4.number of origins equals the number of destinations
The assignment problem will have alternate solutions when the total opportunity cost matrix has _____
1.atleast one zero in each row and column
2.when all rows have two zeros
3.when there is a tie between zero opportunity cost cells
4.if two diagonal elements are zeros.
The average arrival rate in a single server queuing system is 10 customers per hour and average service rate is 15 customers per hour. The average time that a customer must wait before it is taken up for service shall be ______________minutes.
1.6
2.8
3.10
4.12
The cost of a slack variable is ________
1.0
2.1
3.2
4.-1.
The difference between free float and tail event slack is ________
1.total float
2.independent float
3.interference float
4.slack
The dummy source or destination in a transportation problem is added to ______
1.satisfy rim conditions
2.prevent solution from becoming degenerate
3.ensure that total cost does not exceed a limit
4.the solution not be degenerate
The initial event which has all outgoing arrows with no incoming arrow is numbered _______
1.0
2.1
3.-1
4.2
The irreducible minimum duration of the project is called ______
1.critical time
2.normal time
3.cost slope
4.crash duration
The method used to solve Linear Programming Problem without use of the artificial variable is called ______
1.Simplex Method
2.Big-M Method
3.Dual Simplex Method
4.Graphical Mehtod
The model in which only arrivals are counted and no departure takes place are called ___________
1.pure birth model
2.pure death model
3.birth death model
4.death birth model
The problem of replacement is felt when job performing units fail _______
1.suddenly and gradually
2.gradually
3.suddenly
4.neither gradually nor suddenly
The region common to all the constraints including the non-negativity restrictions is called the _______
1.solution space
2.unique solution
3.optimum solution
4.infeasible solution
The server utilization factor is also known as ________
1.erlang distribution
2.poisson distribution
3.exponential distribution
4.traffic intensity
The time between the placement of an order and its delivery is called as ______
1.The time between the placement of an order and its delivery is called as ______
2.lead time
3.Economic Order Quantity
4.capital time
When the sum of gains of one player is equal to the sum of losses to another player in a game, this situation is known as ____
1.two-person game
2.two-person zero-sum game
3.zero-sum game
4.non-zero-sum game
When the total demand is equal to supply then the transportation problem is said to be ______
1.balanced
2.unbalanced
3.maximization
4.Minimization of cash balance
Which of the following methods is used to verify the optimality of the current solution of the transportation problem______
1.Least cost method
2.Vogel's Approximation method
3.Row minima method
4.Modified Distribution method
________ is used for non-repetitive jobs
1.Queue
2.Replacement
3.CPM
4.PERT
________ of a queuing system is the state where the probability of the number of customers in the system depends upon time
1.pure birth model
2.pure death model
3.transient state
4.steady state
_________ method is an alternative method of solving a Linear Programming Problem involving artificial variables
1.Simplex Method
2.Big-M Method
3.Dual Simplex Method
4.Graphical Mehtod