A activity in a network diagram is said to be ________ if the delay in its start will further delay the project completion time.
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 the available resources
A game is said to be fair if _______
1.lower and upper values are zero
2.only lower value to be zero
3.only upper value to be zero
4.lower and upper values are not equal to zero
A queuing system is said to be a ______________ when its operating characteristic are dependent upon time
1.pure birth model
2.pure death model
1.the usage rate is reasonably constant
2.replenishment is not instantaneous
3.only one product is involved
4.there are no quantity discount price
1.Zj-Cj value in the simplex table.
2.variable in the B-column in the simplex table.
3.variable not in the B-column in the simplex table.
4.value in the XB column in the simplex table.
Every basic feasible solution of a general assignment problem having a square pay-off matrix of order n should have assignments equal to___
Graphical method of linear programming is useful when the number of decision variable are ___
Graphical method of linear programming is useful when the number of decision variable are _______
Identify the correct statement
1.an assignment problem may require the introduction of both dummy row and dummy column
2.an assignment problem with m rows and n columns will involves a total of m x n possible assignments
3.an unbalanced assignment is one where the number of rows is more than, or less than the number of columns
4.balancing any unbalanced assignment problem involves adding one dummy row or column
If all aij values in the entering variable column of the simplex table are negative, then ______
1.solution is unbounded
2.solution is degenerate
3.there exist no solution
4.there are multiple solutions
1.the project is progressing well
2.it is a dummy activity
3.it lies on the critical path
4.it lies a non critical path
If primal linear programming problem has a finite solution, then dual linear programming problem should _______
1.have optimal solution
2.satisfy the Rim condition
3.have degenerate solution
4.have non-degenerate solution
3.basic feasible solution
4.no feasible solution
If the procurement cost used in the formula to compute EOQ is half of the actual procurement cost, the EOQ so obtained will be _________
1.half of EOQ
2.one third of EOQ
3.one fourth of EOQ
4.0.707 time EOQ
If there is no non-negative replacement ratio in a solution which is sought to be improved, then the solution is ______
In a given system of m simultaneous linear equations in n unknowns (m<n) there will be _____
1.n basic variables
2.m basic variables
3.(n-m) basic variables
4.(n+m) basic variables
In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are ________
Slack is also known as ________
Solution of a Linear Programming Problem when permitted to be infinitely large is called ______
3.non feasible region
4.optimum basic feasible solution
1.capacity of the system is infinite
2.arrivals are independent of each other
3.service rate is faster than arrival rate
4.all customers arrive at once
The coefficient of an artificial variable in the objective function of penalty method are always assumed to be _______
The dual of the dual is ______
The group replacement policy is suitable for identical low cost items which are likely to _______
2.fail completely and suddenly
3.fail over a period of time
4.be progressive and retrogressive
1.both are rectangular matrices
2.both are square matrices
3.both can be solved y graphical method
4.both have objective function and non-negativity constraints
1.dual simplex method.
1.row operation on row opportunity cost matrix
2.column operation on row opportunity cost matrix
3.column operation on column opportunity cost matrix
4.None of the above.
1.total demand and total supply are equal and the number of sources equals the number of destinations.
2.none of the routes is prohibited
3.total demand equals total supply irrespective of the number of sources and destinations
4.number of sources matches with number of destinations
What type of distribution does a time follow in program evaluation review technique model?
Which of the following is correct?
1.Re-order quantity in a fixed order-interval system equals EOQ
2.Review period of the item is always kept higher than its lead time
3.Re-order level of an item is always more than its minimum stock
4.Buffer stock is the total stock kept to meet the demand during lead time
1.Rent for storage space
2.Extra expenses for an overnight express mail.
4.Electricity and heat for the buildings
While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to_________
1.minimize total cost of assignment.
2.reduce the cost of assignment to zero
3.reduce the cost of that particular assignment to zero
4.reduce total cost of assignment
3.Travelling salesman problem