1. While solving a linear programming problem infeasibility may be removed by ______________.
a) adding another constraint
b) adding another variable
c) removing a constraint
d) removing a variable
2. The right hand side constant of a constraint in a primal problem appears in the corresponding dual
as______________.
a) a coefficient in the objective function
b) a right hand side constant of a function
c) an input output coefficient a left hand side constraint
d) coefficient variable
3. During iteration while moving from one solution to the next, degeneracy may occur
when______________
a) the closed path indicates a diagonal move
b) two or more occupied cells are on the closed path but neither of them represents a corner of the path.
c) two or more occupied cells on the closed path with minus sign are tied for lowest circled value.
d) the closed path indicates a rectangle move.
4. Maximization assignment problem is transformed into a minimization problem by______________.
a) adding each entry in a column from the maximum value in that column
b) subtracting each entry in a column from the maximum value in that column
c) subtracting each entry in the table from the maximum value in that table
d) adding each entry in the table from the maximum value in that table
5. Priority queue discipline may be classified as______________.
a) pre-emptive or non-pre-emptive
b) limited
c) unlimited
d) finite
6. Replace an item when______________.
a) average cost upto date is equal to the current maintenance cost
b) average cost upto date is greater than the current maintenance cost
c) average cost upto date is less than the current maintenance cost.
d) next year running cost in more than average cost of nth year
7. In time cost trade off function analysis______________.
a) cost decreases linearly as time increases
b) cost increases linearly as time decreases
c) cost at normal time is zero
d) cost increases linearly as time increases
8. The transportation problem deals with the transportation of ______________.
a) a single product from a source to several destinations
b) a single product from several sources to several destinations
c) a single product from several sources to a destination
d) a multi -product from several sources to several destinations
9. The minimum number of lines covering all zeros in a reduced cost matrix of order n can be
______________.
a) at the most n
b) at the least n
c) n-1
d) n+1
10. For a 2.5% increase in order quantity (under fundamental EOQ problem) the total relevant cost
would ______________
a) increase by 2.5%.
b) decrease by 2.5%
c) increase by 0.25%.
d) decrease by 0.25%.