?### The objective of the transportation problem which is to be maximized is to

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

?### Cramerâ€™s Rule is also known as ______________.

?### The Lenderâ€™s are also known as ______________

?### Under annuity due, payment is due at the ______________.

?### Bankerâ€™s discount is given by the formula ______________.

?### Unbounded solution in an LPP is ______________.

?### Unbounded solution in an LPP is ______________.

?### The Key row is selected when the column of Zj-Cj is finding the ratio which is ______________.

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

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

?### The test of optimality in simplex method is ______________.

?### The critical path satisfy the condition that ______________

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

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

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

1.

0.

-1.

Unaltered.

?### Inverse of a matrix exists if and only if ______________.

determinant value exists.

determinant value is zero.

determinant value is one.

determinant value is negative.

?### I stands for ______________

Simple Interest

Compound Interest

Rate of interest

No of years.

?### Simple interest will be the income for ______________.

lender.

borrower.

both

neither lender nor borrower.

?### 51-46+3(5) = ______________

40

20

41

52

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

100A/100+nr.

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

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

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

?### An LPP has ______________.

one optimal solution.

two optimal solutions.

Three optimal solutions.

none of these.

?### The two forms of LPP are ______________.

standard form and canonical form.

standard form and general form.

matrix form and canonical form.

matrix form and standard form.

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

positive.

negative.

non-negative.

zero.

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

maximum.

minimum.

positive.

negative.

?### Which of the following is not true about feasibility?

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

it is independent of the objective function.

it implies that there must be a convex region satisfying all the constraints.

extreme points of the convex region gives the optimum solution.

?### Network models have advantage in terms of project ______________

Planning

Scheduling.

Controlling.

All the above.

?### If an activity has zero slack, it implies that ______________

It lies on the critical path.

It is a dummy acitivity.

The project is progressing well.

None of the above.

?### Float or slack analysis is useful for ______________

Projects behind the schedule only.

Projects ahead of the schedule only.

Both a & b.

None of the above.

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

Additional funds.

No of days

Both a & b

None of the above

?### Network is the graphical display of a project that contains both _________________

Activities and events.

Activities and dummy activities.

Both (a) & (b).

Neither (a) nor (b).

?### PERT is a tool for ______________ and control time.

Delaying.

Planning.

Both a & b

None of the above

?### Transportation problem is a special class of ______________.

LPP.

assignment problem.

none of the two.

both 1 and 2.

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

assigned cells and empty cells.

allocated cells and un allocated cells.

occupied and unoccupied cells.

assigned and unoccupied cells.

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

maximizes or minimizes the transportation cost.

maximizes the transportation cost.

minimizes the transportation cost.

has degenerate solution.

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

dummy row with cost 0.

dummy column with cost 0.

dummy row with cost 1.

dummy column with cost 1.

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

dummy column is added.

dummy row added.

row with cost 1 is added.

column with cost 1 is added.

?### Zero matrix is otherwise known as ______________.

null matrix.

square matrix.

unit matrix.

triangular matrix.

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

square matrix.

row matrix.

column matrix.

none of these.

?### If the number of rows of a matrix is greater than the number of columns then the matrix is called as ______________.

a row matrix.

a column matrix.

a rectangular matrix.

a square matrix.

?### The ______________ is the order of the largest square submatrix.

Rank of a matrix

Size of a matrix

Both a & b

None of the above.

?### The formula for the face value A is given by ______________.

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

100T.D/nr.

100r/100-nr.

Pnr/100.

?### Under compound interest the formula for A is given by ______________.

A=P(1+ni).

A=P(1+i).

A=Pnr/100.

A=P(1+i)n.

?### The region on the graph sheet with satisfies the constraints including the non-negativity restrictions is called the ______________ space

solution.

interval.

concave.

convex.

?### An LPP deals with problems involving only ______________.

single objective.

multiple objective.

two objective.

none of these.

?### In Graphical solution the feasible solution is any solution to a LPP which satisfies ______________.

only objective function.

non-negativity restriction.

only constraint.

all the three.

?### In an LPP the solution for the problems involving more than 2 variables can be solved using ______________ _.

graphical method.

simplex method.

hungarian method.

all the above

?### The Key column in simplex method is selected when the column of Zj-Cj is ______________.

most negative.

largest negative.

positive

zero.

?### Which of the following is associated with any L.P.P?

feasible solution.

optimum solution.

basic solution.

all the above.

?### The slack for an activity is equal to ______________

LF-LS.

EF-ES.

LS-ES.

None of the above.

?### A dummy activity is used in the network diagram when ______________

Two parallel activities have the same tail and head events.

The chain of activities may have a common event yet he independent by themselves.

Both a & b

None of the above.

?### Activity â€“on-arrow (AOA) diagram is preferred over Activity â€“ on-node (AON) diagram because ______________

AOA diagrams are simple to construct.

AOA diagrams give a better sense of the flow of time throughout a project.

AOA diagrams do not involve dummy activities

ALL the above.

?### Earliest finish time that an activity can be finished without ______________ of precedence requirements.

Planning.

Violation.

Both a & b

None of the above

?### A small circle or rectangle that is known as ______________ serves as a junction point in the project network.

Event

Node

Slack.

Variables.

?### Project ______________ phase allocates resources to work packages.

Planning.

Scheduling.

Controlling.

Both b & c.

?### The Objective function of Transportation problem is to ______________.

maximize the total cost.

minimize or maximize the total cost.

minimize the total cost.

total cost should be zero.

?### In Least cost method the allocation is done by selecting ______________.

upper left corner.

upper right corner.

middle cell in the transportation table.

cell with the lowest cost.

?### Purpose of MODI method is to get ______________.

degenerate solution.

non-degenerate solution.

optimal

basic feasible solution.

?### The application of assignment problems is to obtain ______________.

only minimum cost.

only maximum profit.

minimum cost or maximum profit.

assign the jobs.

?### The assignment problem is said to be balanced if it is ______________.

square matrix.

rectangular matrix.

unit matrix.

triangular matrix.

?### The objective of Transportation problem is to allocate ______________.

number of origins to equal number of destinations at minimum cost.

number of origins to equal number of destination at maximum cost.

only to maximize cost.

only to maximize the profit.

?### If A and B are matrices of same order then ______________.

A+B=B+A.

A+Bâ‰ B+A.

A+B

A+B>B+A.

?### When all the elements of a matrix are zeros, the matrix is called ______________.

unit matrix.

square matrix.

null matrix.

Row matrix.

?### ( 3 8 9 - 2 ) is a row matrix of order______________.

4x4.

1x4

1x1.

4x1.

?### If a matrix has 4 rows and 3 columns, then the size will be denoted by

3x4

3x3

4x3

4x4

?### The borrowers are also known as ______________.

Debtorâ€™s

Creditorâ€™s

Both a & b

None of the above.

?### The compound interest for Rs 20000 for 3 years at 10 & is ______________.

2500.

2200.

6000.

2500.

?### When the payments are to be made at the end of each interval the annuity is called ______________.

immediate annuity.

annuity due.

both( a) and( b).

present annuity.

?### In the canonical form of LPP if the objective function is of maximization, then all the constraints other than non-negativity conditions are _________...

greater than type.

lesser than type.

greater than or equal to type.

lesser than or equal to type.

?### The non-negative variable which is added to LHS of the constraint to convert the inequality â‰¤ into equation is called _______________.

random variable.

decision variable.

surplus variable.

slack variable.

?### In graphical method the LPP has unbounded solution if the solution space has

no upper boundary.

no lower boundary.

no boundary in the first quadrant.

none of the above.

?### The ______________ is the method available for solving an L.P.P.

graphical method.

least cost method.

MODI method.

hungarian method.

?### The another term commonly used for activity slack time is ______________

Total float.

Independent float.

Free float.

All the above.

?### While drawing the network diagram for each activity project we should look ______________

What acitivities preceede this acitivity.

What acitivities follow this acitivity.

What activity can concurrently take place with this activity.

All the above.

?### Resource leveling is the process of ______________ the utilization of resources in a project.

Emerging

Smoothing out.

Minimize

Maximize

?### Latest finish time that an activity can be finished without ______________ the entire project.

Delaying.

Planning

Both a & b

None of the above

?### ______________ phase identify manpower that will be responsible for each task.

Planning.

Scheduling.

Controlling.

All the above.

?### In Transportation problem the preferred method of obtaining either optimal or very close to the optimal solution is ______________.

north west corner rule.

least cost method.

vogelâ€™s approximation method.

simplex method.

?### Transportation problem is said to be unbalanced if ______________.

total supply is not equal to total demand.

Tot al supply is greater than total demand.

total supply is lesser than total demand.

All the above

?### In North West corner rule if the demand in the column is satisfied one must move to the ______________.

left cell in the next column.

right cell in the next row.

right cell in the next column.

left cell in the next row.

?### The assignment problem is said to be balanced if ______________.

number of rows is greater than number of columns.

number of rows is lesser than number of columns.

number of rows is equal to number of columns.

if the entry of row is zero.

?### Vogelâ€™s approximation method is also known as ______________.

Penalty method

North west method.

Least cost method

None of the above.

?### If A,B and C are matrices of the same order then ______________.

(A+B)+C=A+(B+C).

(A+B)+C â‰ A+(B+C).

(A+B)+C> A+(B+C).

(A+B)+C < A+(B+C).

?### When the number of rows is not equal to the number of columns then the matrix is said to be ______________.

unit matrix.

Rectangular matrix.

null matrix.

row matrix.

?### O.R. Stands for ______________

Operations research

Open Report

Own Record

On Road

?### Compound Interest is always ______________ the Simple Interest.

Lesser than

Equal to

Greater than

None of the above.

?### 3x- 4+7 = 0, then x = ?

-1

+1.

0.

2

?### In Graphical solution the redundant constraint is ______________.

which forms the boundary of feasible region.

which do not optimizes the objective function.

which does not form boundary of feasible region.

which optimizes the objective function.

?### In the standard form of LPP if the objective functions is of minimization then all the constraints ______________.

equations.

inequalities.

greater than or equal to type.

lesser than or equal to type.

?### In a linear programming minimization model the objective function is to be ______________.

minimized.

maximized.

minimized or maximized.

standardized.

?### The graphical method is applicable to solve an L.P.P when there is ______________.

Only one variable.

Two variables.

More than two variables

None of the above.

?### In the PERT network each activity time assumes a Beta distribution because ______________

It is a unimodal distribution that provides information regarding the uncertainty of time estimates of activities.

It has got finite non-negative error.

It need not be symmetrical about model value .

All the above

?### In time cost trade off function analysis ______________

Cost decreases linearly as time increases.

Cost at normal time is zero.

Cost increases linearly as time increases.

None of the above.

?### ______________ is the point in time that marks the beginning or ending of an activity.

Event.

Activity.

Node.

Dummy activity.

?### The CPM is used for completing the project that involves ______________ of repetitive nature.

Activities

Node.

Event.

Dummy activity.

?### In Transportation problem the improved solution of the initial basic feasible solution is called ______________.

basic solution.

optimal solution.

degenerate solution.

non-degenerate solution.

?### Transportation problem is said to be balanced if ______________.

total supply is not equal to total demand.

total supply is greater than total demand.

total supply is lesser than total demand.

total supply is equal to total demand.

?### In transportation problem the solution is said to non-degenerate solution if occupied cells is ______________.

greater than m+n-1.

lesser than m+n-1.

greater than or equal to m+n-1.

lesser than or equal to m+n-1.

?### In North West corner rule if the supply in the row is satisfied one must move ______________.

down in the next row.

up in the next row.

right cell in the next column.

left cell in the next row.

?### In assignment problem if number of rows is greater than column then ______________.

dummy column is added.

dummy row added.

row with cost 1 is added.

column with cost 1 is added.

?