Business Mathematics Online MCQ Set 1

QN01. The objective of the transportation problem which is to be maximized is to

1. maximize the total profit.
2. minimize the total loss .
3. neither maximize nor minimize.
4. optimal cost.

Answer

(A)maximize the total profit.

QN02. A diagonal matrix in which all the diagonal elements are equal is a ______________.

1. scalar matrix.
2. column matrix.
3. unit matrix.
4. None of these.

Answer

(A)scalar matrix.

QN03. Cramer's Rule is also known as ______________.

1. Inverse Matrix Method
2. Matrix Method
3. Determinant Method
4. Inverse Method

Answer

(C)Determinant Method

QN04. The Lender's are also known as ______________

1. Creditor's
2. Debtor's
3. Buyer's
4. None of the above.

Answer

(A)Creditor's

QN05. Under annuity due, payment is due at the ______________.

1. beginning of the time.
2. end of the time.
3. at the middle of the time.
4. each.

Answer

(A)beginning of the time.

QN06. Banker's discount is given by the formula ______________.

1. Anr/100.
2. Pnr/100.
3. Anr.
4. Pnr.

Answer

(A)Anr/100.

QN07. Unbounded solution in an LPP is ______________.

1. where the objective function can be decreased indefinitely.
2. which maximizes the objective function.
3. where the objective function can be increased or decreased indefinitely.
4. where the objective function can be increased indefinitely.

Answer

(C)where the objective function can be increased or decreased indefinitely.

QN08. The Key row is selected when the column of Z_j-C_j is finding the ratio which is ______________.

1. maximum.
2. minimum.
3. largest positive.
4. most negative.

Answer

(B)minimum.

QN09. Graphical method can be used only when the decision variables is ______________.

1. more than 3.
2. more than1.
3. two.
4. one.

Answer

(C)two.

QN10. ______________ is the time consuming job (or) task that is a key subpart of the total project.

1. Activity.
2. Event.
3. Node.
4. All the above.

Answer

(A)Activity.

QN11. The test of optimality in simplex method is ______________.

1. Z_j-C_j >0.
2. Z_j-C_j <0.
3. Z_j-C_j =0.
4. Z_j-C_j<0.

Answer

(A)

Z_j-C_j >0.

QN12. The critical path satisfy the condition that ______________

1. E_j=L_j and E_j=L_j.
2. L_j-E_j= L_j- L_j.
3. L_j-E_j= L_j- L_j=d(constant).
4. All the above.

Answer

(D)

E_j=L_j and E_j=L_j.

QN13. If A, B are two matrices and K is a scalar then ______________.

1. K(A+B) ≠KA+KB
2. K(A+B)=KA+KB.
3. K(A+B)<KA+KB.
4. K(A+B)>KA+KB.

Answer

(B)K(A+B)=KA+KB.

QN14. If A,B and C are matrices the associative property is ______________.

1. (AB)C<A(BC).
2. (AB)C>A(BC).
3. (AB)C≠A(BC).
4. (AB)C=A(BC).

Answer

(D)

(AB)C=A(BC).

QN15. If any two rows and columns of a determinant are identical, the value of the determinant is ______________.

1. 1.
2. 0.
3. -1.
4. Unaltered.

Answer

(B)0.

QN16. Inverse of a matrix exists if and only if ______________.

1. determinant value exists.
2. determinant value is zero.
3. determinant value is one.
4. determinant value is negative.

Answer

(A)determinant value exists.

QN17. I stands for ______________

1. Simple Interest
2. Compound Interest
3. Rate of interest
4. No.of.years.

Answer

(A)Simple Interest

QN18. Simple interest will be the income for ______________.

1. lender.
2. borrower.
3. both.
4. neither lender nor borrower.

Answer

(A)lender.

QN19. 51-46+3(5) = ______________

1. 40
2. 20
3. 41
4. 52

Answer

(B)20

QN20. Face value of a bill of exchange is given by the formula ______________.

1. 100A/100+nr.
2. (B.DxT.D)/B.D-T.D).
3. (B.DxT.D)/B.D+T.D).
4. (B.D+T.D)/B.D-T.D).

Answer

(B)(B.DxT.D)/B.D-T.D).

QN21. An LPP has ______________.

1. one optimal solution.
2. two optimal solutions.
3. Three optimal solutions.
4. none of these.

Answer

(D)none of these.

QN22. The two forms of LPP are ______________.

1. standard form and canonical form.
2. standard form and general form.
3. matrix form and canonical form.
4. matrix form and standard form.

Answer

(A)standard form and canonical form.

QN23. In the standard form of LPP if the objective function is of minimization then the right hand side of the constraints should be ______________.

1. positive.
2. negative.
3. non-negative.
4. zero.

Answer

(C)non-negative.

QN24. In simplex method the LPP has unbounded solution if the variable in the key column is ______________.

1. maximum.
2. minimum.
3. positive.
4. negative.

Answer

(D)negative.

QN25. Which of the following is not true about feasibility?

1. it cannot be determined in a graphical solution of an L.P.P.
2. it is independent of the objective function.
3. it implies that there must be a convex region satisfying all the constraints.
4. extreme points of the convex region gives the optimum solution.

Answer

(A)it cannot be determined in a graphical solution of an L.P.P.

QN26. Network models have advantage in terms of project ______________

1. Planning
2. Scheduling.
3. Controlling.
4. All the above.

Answer

(D)All the above.

QN27. If an activity has zero slack,it implies that ______________

1. It lies on the critical path.
2. It is a dummy acitivity.
3. The project is progressing well.
4. None of the above.

Answer

(A)It lies on the critical path.

QN28. Float or slack analysis is useful for ______________

1. Projects behind the schedule only.
2. Projects ahead of the schedule only.
3. Both a & b.
4. None of the above.

Answer

(A)Projects behind the schedule only.

QN29. Crashing is the process of reducing the total time that it takes to complete a project by expanding ______________

1. Additional funds.
2. No.of.days
3. Both a & b
4. None of the above

Answer

(A)Additional funds.

QN30. Network is the graphical display of a project that contains both _________________

1. Activities and events.
2. Activities and dummy activities.
3. Both (a) & (b).
4. Neither (a) nor (b).

Answer

(A)Activities and events.

QN31. PERT is a tool for ______________ and control time.

1. Delaying.
2. Planning.
3. Both a & b
4. None of the above

Answer

(B)Planning.

QN32. Transportation problem is a special class of ______________.

1. LPP.
2. assignment problem.
3. none of the two.
4. both 1 and 2.

Answer

(A)LPP.

QN33. The cells in the Transportation problem can be classified as ______________.

1. assigned cells and empty cells.
2. allocated cells and un allocated cells.
3. occupied and unoccupied cells.
4. assigned and unoccupied cells.

Answer

(C)occupied and unoccupied cells.

QN34. The basic feasible solution to a transportation problem is said to be optimal if it ______________.

1. maximizes or minimizes the transportation cost.
2. maximizes the transportation cost.
3. minimizes the transportation cost.
4. has degenerate solution.

Answer

(C)minimizes the transportation cost.

QN35. In transportation problem if total supply < total demand we add ______________.

1. dummy row with cost 0.
2. dummy column with cost 0.
3. dummy row with cost 1.
4. dummy column with cost 1.

Answer

(A)dummy row with cost 0.

QN36. In Maximization case of transportation problem we convert into minimization by subtracting all the elements from the ______________.

1. zero.
2. one.
3. highest element.
4. lowest element.

Answer

(C)highest element.

QN37. In assignment problem if number of column is greater than row then ______________.

1. dummy column is added.
2. dummy row added.
3. row with cost 1 is added.
4. column with cost 1 is added.

Answer

(B)dummy row added.

QN38. In transportation problem 'NWC' stands for ______________.

1. North West Corner
2. Net Working Capital
3. Naval Weapons Center
4. Nuclear Weapons Convention

Answer

(A)North West Corner

QN39. Zero matrix is otherwise known as ______________.

1. null matrix.
2. square matrix.
3. unit matrix.
4. triangular matrix.

Answer

(A)null matrix.

QN40. When the number of rows and the number of columns of a matrix are equal, the matrix is ______________.

1. square matrix.
2. row matrix.
3. column matrix.
4. none of these.

Answer

(A)square matrix.