Please switch off your mobile phones or keep it in silent mode.Please close all your books, copies and laptops before we proceed with the quiz.

Welcome to QT Quiz

Ayesha

Nitin Swatanu

Ankit Arpan

Anurag

RULES OF THE GAME

There are 6 rounds and a group gets 2 questions in each round.Every correct answer carries 2 marks.There is no negative marking.The time allowed for every question is 50 seconds.Questions cannot be passed.Any queries will be entertained only after the quiz is over.

There is a bonus round in the end which may be held depending on availability of time. The rules will be disclosed at that

point of time only.

ROUND 1

Question 1.The method in which we find the corner points of the feasible region graphically and then compute the profit at each of these points to find the optimal solution is called as _____________ ? A

B

C

D

Iso-profit line method

End-point method

Corner point method

Edge solution method

Question 2.A measurable input quantity that is inherent in the problem is known as __________ ?

A

B

C

D

Assumption

Model

Constraint

Parameter

Question 3.A transportation problem can be solved by :i. Simplex method ii. Transportation method iii. Multiple

optimal method A

B

C

D

ii. only

i. & ii. only

ii. & iii. only

All of the above

Question 4.A LPP has a bounded feasible region. If this problem has an equality(=) constraint then

A

B

C

D

This must be a minimization problem

The feasible region must consist of a line segment

The problem must be degenerate

The problem must have more then one optimal solution

Question 5.If a particular constraint doesn’t affect the feasible region, then it is called as a __________ ?

A

B

C

D

Redundant constraint

Zero-value constraint

Dummy constraint

It cannot be considered as a constraint

Question 6.Which of the following are the methods used for solving Operations Research models ?

A

B

C

D

Analytical procedures

Iterative procedures

Monte-Carlo Techniques

All of these

Question 7.

In a transportation problem every loop has _______ ?

A

B

C

D

Even number of cells

Odd number of cells

Either even or odd number of cells

Inadequate data

Question 8.Estimating election results before actually the counting is completed represents which kind of model ?

A

B

C

D

Iconic model

Dynamic model

Predictive model

Prescriptive model

ROUND 2

Question 1.In which of the following situations Operations Research can be used ?

A

B

C

D

Transportation loading and unloading

Cash flow planning

Both of these

None of these

Question 2.In LP, variables do not have to be integer valued and may take on any fractional value. This assumption is called __________ ?

A

B

C

D

Proportionality

Divisibility

Additivity

Certainty

Question 3.Which of the following is a physical model in Operations Research Methodology ?

A

B

C

D

Analogue model

Symbolic model

Deterministic model

Probabilistic model

Question 4.

Having more than 1 optimal solution __________ .

A

B

C

D

Provide management with greater flexibility in using resourcesCreate confusion as in which solution to select

Doesn’t affect at all

Both A & B

Question 5.Which model came into existence due to difficulty in representing more than three variables graphically? ?

A

B

C

D

Analogue

Iconic

Symbolic

Physical

Question 6.Which of this is not a phase of operation Research in Scientific Methodology?

A

B

C

D

Operation phase

Research phase

Action phase

Judgment phase

Question 7.Per unit contribution of a variable in the objective function is independent of the size of the variable. This property is known as _______ ?

A

B

C

D

Deterministic

Automotiveness

Proportionality

Rationality

Question 8.A model of a proposed building provided by an architect is an example of ____________ model ?

A

B

C

D

Analogue model

Physical model

Symbolic model

None of the above

ROUND 3

Question 1.

Post optimality analysis is also known as ______________ ?

A

B

C

D

Quantitative

Sensitivity

Deterministic

None of the above

Question 2.The dummy source or destination in a Transportation problem is added to ____________ ?

A

B

C

D

Satisfy rim condition

Ensure Transportation cost doesn’t exceed a limit

Prevent solution from becoming degenerate

To select the shadow price

Question 3.A constraint is termed as ___________ if the LHS and RHS of it remains equal when the optimal value of the decision variables are substituted into the constraints .

A

B

C

D

Redundant constraint

Non-redundant constraint

Non-binding constraint

Binding constraint

Question 4.Non-negativity condition is an important component of LP model because ____________ ?

A

B

C

D

Variable value must remain under the control of decision maker

Value of variables make sense & correspond to real world problem

Variables are inter related in terms of limited resources

Value of variables remain unchanged

Question 5.Which variable is also termed as dependant variable and which is beyond the control of the decision maker ?

A

B

C

D

Decision variable

Uncontrollable variable

Result variable

None of the above

Question 6.If two constraints do not intersect in the positive quadrant of the graph, then ________________ ?

A

B

C

D

The problem is feasible

The solution is unbounded

One of the constraints is redundant

None of these

Question 7.

A transportation problem has __________ basis ?

A

B

C

D

Linear

Quadratic

Triangular

Both A & C

Question 8.If in a LP solution, the no. of simultaneous linear equation is ‘m’ and the no. of non-negative variables is ‘n’ , then the maximum no. of corner points is ________ ?

A

B

C

D

mPn

nPm

nCm

mCn

ROUND 4

Question 1.

Shadow price is ___________________________ ?

A

B

C

D

Price that is paid for purchase of resources

The saving made by eliminating excess quantity of resources

Increase in obj. funcn value by providing one additional unit of resource

The difference in value between a feasible solution and optimal solution

Question 2.

The role of artificial variables in the simplex method is _______?

A

B

C

D

To aid in finding initial soln. & start phases of simplex methodTo find optimal dual prices in the final simplex table

Both of the above

None of the above

Question 3.The objective function is parallel to a constraint that forms an edge or boundary on the feasible region, this property is known as ____________ ?

A

B

C

D

Multiple optimality

Redundancy

Pre-emptiveness

Infeasibility

Question 4.

A non-optimal solution cannot be improved by ___________ ?

A

B

C

D

Selecting variable with largest Dj(net profit) for maximization and min Dj for minimization

Selecting the variable with most non +ve replacement ratio as the outgoing variable

Obtaining a new simplex table

Selecting the variable in the optimality range tending to 0

Question 5.For a maximization type of LPP, ____ property occurs where there is no constraint on the solution so that one or more of the decision variable can be increased indefinitely without violating any of the restrictions(constraints).A

B

C

D

Un-boundedness

Infeasibility

Multiple optimality

Extensiveness

Question 6.

Which of the following is not a limitation of Operation Research ?

A

B

C

D

Magnitude of computation

Non-quantifiable factors

Money and time costs

Decision making

Question 7.If a negative value appears in the solution values(Xb) column of the simplex table then ,

A

B

C

D

The solution is optimal

The solution is infeasible

The solution is unbalanced

All of these

Question 8.

A constraint in an LP model becomes redundant because ______

A

B

C

D

Two iso-profit lines may be parallel to each other

The solution is unbounded

The constraint is not satisfied by the solution value

All of these

ROUND 5

Question 1.

The cutting plane method is designed for ____________ ?

A

B

C

D

Developing another simplex algorithm that combines the primal & dual simplex methods

Solving zero-one programming problems

Eliminating integer optimal solutions from the feasible space of linear programming problems

Eliminating non-integer optimal solutions from the feasible space of linear programming problems

Question 2.If a problem has multiple objectives we should use which of the following methodologies ?

A

B

C

D

Dynamic programming

Orthogonal programming

Multiplex programming

Goal programming

Question 3.If a problem is best solved in stages or time frames, we should use which of the following methodologies ?

A

B

C

D

Temporal programming

Genetic programming

Dynamic programming

Integer programming

Question 4.When an artificial variable is positive, it reverses the direction of the inequality in certain constraints. This solution of LPP is called

A

B

C

D

Semi-feasible solution

Pseudo-optimal solution

Pseudo-feasible solution

Optimized solution

Question 5.If we insist on obtaining only integer values of the decision variables, the problem is called ___________ ?

A

B

C

D

Linear programming problem

Integer programming problem

Non-linear programming problem

Restricted programming problem

Question 6.

A solution is said to be degenerate _____________ ?

A

B

C

D

If some basic variable(s) has a solution value equal to zeroIf some non-basic variable(s) has a solution value equal to zeroIf all basic variable (s) has a solution value equal to zeroIf all non-basic variable(s) has a solution value equal to zero

Question 7.The method for dealing with linear programming problems involving artificial variables is _________ ?

A

B

C

D

Two-phase method

Single-phase method

Big-L method

Auxiliary method

Question 8.If two points are selected in the region and the line segment formed by joining these two points lies completely in this region, then it represents __________ .

A

B

C

D

Non-convex set

Non-continuous set

Continuous set

Convex set

ROUND 6

Question 1.

An assignment problem is which form of transportation problem ?

A

B

C

D

Degenerated

Non-degenerated

Un-bounded

Basic form

Question 2.____________ may involve decisions under certainty or uncertainty , under static or dynamic conditions and against nature or some rational opponents?

A

B

C

D

Operations research

Quantitative analysis

Decision making

None of the above

Question 3.While plotting constants on a graph paper, terminal points on both the axes are connected by a straight line because _____ ?

A

B

C

D

The resources are limited in supply

The objective function is a linear function

The constants are linear equations or inequalities

All of the above

Question 4.For a set of ‘m’ equation in ‘n’ variables(n>m), a solution obtained by setting (n-m) variables equal to zero and solving for remaining m equations in n variables is called as ________ ?

A

B

C

D

Non-feasible solution

Basic feasible solution

Feasible solution

Basic solution

Question 5.Risk and payback period is considered to be______________ in a particular problem?

A

B

C

D

Variables

Objective

Constraints

None of the above

Question 6.

________ is a war against ad-hocism ?

A

B

C

D

Deterministic model

Qualitative techniques

Operational Research

All of the above

Question 7.

A model in Operations research is ___________ ?

A

B

C

D

An essence of reality

An approximation

An idealization

All of the above

Question 8.

Which of the following is not a feature of Operations research ?

A

B

C

D

Inter-disciplinary team approach

Holistic approach to the system

Use of scientific research

Perfectness of solution

BONUS ROUND

BONUS ROUND - RULES

Each question carries 3 marks.If you answer the question correctly within 60 seconds, you get 3 marksYou can take additional 30 seconds(total 90 seconds) to answer the question but a correct answer will fetch only 2 marks.

A wrong answer will attract a penalty of -1 in any case.Unanswered questions are passable to the next group.The group with the correct answer will get 2 points.

Question 1.Given : Maximize Z=2x1+4x2

STC : 1. x1+2x2<=5 2. 2x1+ x2<=4 3. x1 , x2 >=0

The no. of optimal solutions to this problem is

A

B

C

D

4

1

3

None of these

Question 2.

What is a drawback of analogue model used in operation research?

A

B

C

D

Unreliable & ungenuine

Less specific & concrete

All of the above

None of the above

Question 3.

Which of the following is not a correct closed loop ?

A. B.

C.

D.

Question 4.Which of the following is an important characteristics for assignment problem but not for transportation problem ?

A

B

C

D

The pay off matrix for the problem should be a square

The optimal solution contains only one assignment in a given row or column of the pay off matrix

All of the above

None of the above

Question 5.

A feasible solution to a transportation problem is basic _____ ?

A

B

C

D

If the corresponding cells in a transportation table contain a loop

If & only if corresponding cells in transportation table don’t contain loop

Data inadequate

If the cells do not contain a loop

Question 6.The feasible region represented by the constraints :x1+ x2 <= 1 , 3x1+ x2 >= 3 , x1,x2 >= 0 for the obj. function

Z=x1+2x2 is:

A

B

C

D

A singleton set

Unbounded set

Empty set

A polygon

Question 7.Special purpose algorithm developed for the transportation application are important because __________i. Computation time is comparatively very lessii. Requires less computer memory iii. Produce

integer solution A

B

C

D

i only

i. & iii. only

i. & ii. only

i. & ii. & iii.

Question 8.In LP, parameter (input data) of the model can change within certain limits without causing the optimum solution to change. This is referred to as ______?

A

B

C

D

Certainty

Variation

Sensitivity analysis

Feasibility range