51-46+3(5) = _______
1.40
2.20
3.41
4.52
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.
An LPP deals with problems involving only ______
1.single objective.
2.multiple objective.
3.two objective.
4.None of these.
An LPP has ________
1.one optimal solution.
2.two optimal solutions.
3.Three optimal solutions.
4.None of these.
Banker's discount is given by the formula _______
1.Anr/100.
2.Pnr/100.
3.Anr.
4.Pnr.
Cramer's Rule is also known as _______
1.Inverse Matrix Method
2.Matrix Method
3.Matrix Method
4.Inverse Method
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
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).
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.
Graphical method can be used only when the decision variables is _______
1.more than 3.
2.more than1.
3.two.
4.one.
I stands for ________
1.Simple Interest
2.Compound Interest
3.Rate of interest
4.No.of.years.
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.
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).
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.
If any two rows and columns of a determinant are identical, the value of the determinant is _____
1.1.
2.0.
3.-1.
4.-1.
If the number of rows of a matrix is greater than the number of columns then the matrix is called as ______
1.a row matrix.
2.a column matrix.
3.a rectangular matrix.
4.a square matrix.
In an LPP the solution for the problems involving more than 2 variables can be solved using _______
1.graphical method.
2.simplex method.
3.hungarian method.
4.All the above.
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.
In Graphical solution the feasible solution is any solution to a LPP which satisfies ________
1.only objective function.
2.non-negativity restriction.
3.only constraint.
4.all the three.
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.
In simplex method the LPP has unbounded solution if the variable in the key column is _____
1.maximum.
2.minimum.
3.positive.
4.negative.
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.
In transportation problem 'NWC' stands for ______
1.North West Corner
2.Net Working Capital
3.Naval Weapons Center
4.Nuclear Weapons Convention
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.
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.
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).
Network models have advantage in terms of project ________
1.Planning
2.Scheduling.
3.Controlling.
4.All the above.
PERT is a tool for _________ and control time.
1.Delaying.
2.Planning.
3.Both a & b
4.None of the above
Simple interest will be the income for ________
1.lender.
2.borrower.
3.both.
4.neither lender nor borrower.
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.
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.
The critical path satisfy the condition that _______
1.Ej=Lj and Ej=Lj.
2.Lj-Ej= Lj- Lj.
3.Lj-Ej= Lj- Lj=d(constant).
4.All the above.
The formula for the face value A is given by ______
1.(B.DxT.D)/(B.D-T.D).
2.100T.D/nr.
3.100r/100-nr.
4.Pnr/100.
The Key column in simplex method is selected when the column of Zj-Cj is ____
1.most negative.
2.largest negative.
3.positive.
4.zero.
The Key row is selected when the column of Zj-Cj is finding the ratio which is _________
1.maximum.
2.minimum.
3.largest positive.
4.most negative.
The Lender's are also known as _________
1.Creditor's
2.Debtor's
3.Buyer's
4.None of the above.
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.
The region on the graph sheet with satisfies the constraints including the non-negativity restrictions is called the ______________ space
1.solution.
2.interval.
3.concave.
4.convex.
The test of optimality in simplex method is _____
1.Zj-Cj >0.
2.Zj-Cj <0.
3.Zj-Cj =0.
4.Zj-Cj<0.
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.
The ______________ is the order of the largest square submatrix.
1.Rank of a matrix
2.Size of a matrix
3.Both a & b
4.None of the above.
Transportation problem is a special class of ______
1.LPP.
2.assignment problem.
3.none of the two.
4.both 1 and 2.
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.
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.
Under compound interest the formula for A is given by _______
1.A=P(1+ni).
2.A=P(1+i).
3.A=Pnr/100.
4.A=Pnr/100.
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.
Which of the following is associated with any L.P.P?
1.feasible solution.
2.optimum solution.
3.basic solution.
4.All the above.
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.
Zero matrix is otherwise known as ______
1.null matrix.
2.null matrix.
3.unit matrix.
4.triangular matrix.
_______ 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.