A activity in a network diagram is said to be……….if the delay in its start will further delay the project completion time.
A. forward pass
B. backward pass
C. critical.
D. non-critical.
ANSWER: C
If the net evaluation corresponding to any non-basic variable is zero, it is an indication of the existence of an
A. initial basic feasible solution
B. optimum basic feasible solution
C. optimum solution.
D. alternate optimum solution.
ANSWER: D
The simplex method is also called the
A. dual simplex method.
B. Modi method
C. simplex technique
D. Big-M method
ANSWER: C
The region common to all the constraints including the non-negativity restrictions is called the………
A. solution space
B. unique solution
C. optimum solution
D. infeasible solution
ANSWER: A
The penalty for not taking correct decision is known as
A. fine
B. loss
C. cost
D. opportunity cost
A wide class of allocation models can be solved by a mathematical technique is known as model.
A. classic
B. linear
C. non linear
D. descriptive
ANSWER: B
The slack variables indicate
A. excess resource available.
B. shortage of resource
C. nil resource
D. idle resource
ANSWER: D
The total opportunity cost matrix is obtained by doing
A. row operation on row opportunity cost matrix
B. column operation on row opportunity cost matrix
C. column operation on column opportunity cost matrix
D. none of the above.
ANSWER: B
The assignment problem will have alternate solutions when the total opportunity cost matrix has
A. atleast one zero in each row and column
B. when all rows have two zeros
C. when there is a tie between zero opportunity cost cells
D. if two diagonal elements are zeros.
ANSWER: C
The similarity between assignment problem and transportation problem is
A. both are rectangular matrices
B. both are square matrices
C. both can be solved y graphical method
D. both have objective function and non-negativity constraints
ANSWER: D
