In Program Evaluation Review Technique for an activity, the optimistic time 2, the pessimistic time is 12 and most-likely time is 4. What is the expected time.
A. 0
B. 1
C. 5
D. 6
ANSWER: C
An n-tuple of real numbers which satisfies the constraints of Linear Programming Problem is called
A. solution
B. basic solution
C. basic feasible solution
D. feasible solution
ANSWER: A
An assignment problem is a particular case of
A. transportation Problem
B. assignment Problem
C. travelling salesman problem
D. replacement Problem
ANSWER: A
The linear function to be maximized or minimized is called _____________function.
A. injective
B. surjective
C. bijective
D. optimal
ANSWER: D
Linear Programming Problem is a technique of finding the
A. optimal value
B. approximate value
C. initial value
D. infeasible value
ANSWER: A
All equality constraints can be replaced equivalently by _____________ inequalities
A. 1
B. 2
C. 3
D. 4
ANSWER: B
A Linear Programming Problem have ____________ optimal solution
A. 1
B. 2
C. more than 1
D. more than 2
ANSWER: C
The assignment algorithm was developed by.
A. HUNGARIAN
B. VOGELS
C. MODI
D. HUHN
ANSWER: A
___________ is a completely degenerate form of a transportation problem
A. Transportation Problem
B. Assignment Problem
C. Travelling salesman problem
D. Replacement Problem
ANSWER: B
For finding an optimum solution in transportation problem ____________ method is used.
A. Simplex
B. Big-M
C. Modi
D. Hungarian
ANSWER: C