Operational Research Mcq

Front 1

Operations research Model in which value of all variables and all possible outcomes are known with certainty are called _____ Model

Back 1

Deterministic

Front 2

Operation research model in which some or all variables are redome in nature are called _____ Models

Back 2

Probabilistic

Front 3

Mean, medium and mode are measures of

Back 3

Central tendency

Front 4

_ _ _ _ _ and _ _ _ _ _ are techniques applied in project management.

Back 4

CPM, PERT

Front 5

Operation research techniques are _ _ _ _ _ in nature

Back 5

Quantitative

Front 6

_ _ _ _ _ are the entities whose values are to ba determined from the solution of the LLP

Back 6

Decision variables

Front 7

_ _ _ _ _ specifies the objective or goal of solving the LLP

Back 7

Objective function

Front 8

Objective function is expressed in term of the _ _ _ _ _

Back 8

Decision variables

Front 9

_ _ _ _ _ are the restrictions or limitations imposed on the LLP

Back 9

Constraints

Front 10

The type of constraint which specifies maximum capacity of a resource is ' _ _ _ _ _ or equal to' constraint

Back 10

Less than

Front 11

The incoming variable column in the complex algorithm is called _ _ _ _ _

Back 11

Key column

Front 12

The outgoing variable now in the simplex algorithm is called _ _ _ _ _

Back 12

Key row

Front 13

The intersection added to the LHS of a less than or equal to constraint to convert it into equality is called _ _ _ _ _

Back 13

Slack variables

Front 14

The intersection value of key column and key row is called _ _ _ _ _

Back 14

Key element

Front 15

A resource which is partially utilizes is called _ _ _ _ _ in simplex.

Back 15

aboundant resources

Front 16

The value of one extra unit of resource is called _ _ _ _ _ in simplex

Back 16

Shadow price

Front 17

To find initial feasible solution of a transportation problem the method which starts allocation from the lowest cost is called _ _ _ _ _ method.

Back 17

Least cost

Front 18

In a transportation problem, the method of penalties is called _ _ _ _ _ method.

Back 18

Vogle's approximately

Front 19

When the total of allocations of a transportation problem match with supply and demand values, the solution is called ______ solution.

Back 19

Feasible

Front 20

When the allocations of a transportation problem satisfy the rim condition (m + n -- 1) the solution is called _____ solution

Back 20

Non - degenerate

Front 21

When there is a degeneracy in the transportation problem, we add an imaginary allocation called _____ in the solution.

Back 21

Epsilon

Front 22

If the number of rows and columns in an assignment problem are not equal than it is called ______ Problem.

Back 22

Unbalanced

Front 23

The method of solution of assignment problems is called _____ method.

Back 23

Hungarian

Front 24

When a maximization assignment problem is converted into minimization problem, the resulting matrix is called _ _ _ _ _

Back 24

Regret Matrix

Front 25

The extra row or column which is added to balance assignment problem is called _ _ _ _ _

Back 25

Dummy

Front 26

When a particular assignment in the given problem is not possible or restricted as a condition, it is called a _ _ _ _ _ problem.

Back 26

Prohibited

Front 27

The longest path in the network diagram is called _ _ _ _ _ path.

Back 27

Critical

Front 28

The second longest path in the network diagram is called _ _ _ _ _ path

Back 28

Subcritical

Front 29

Forward pass calculations are done to find _ _ _ _ _ times of events.

Back 29

Earliest

Front 30

Backward pass calculations are done to find _ _ _ _ _ times of events.

Back 30

Latest

Front 31

An activity whose start or end cannot be delayed without affecting total project completion time is called _ _ _ _ _ activity.

Back 31

Critical

Front 32

The two types of costs involved in project crashing are _ _ _ _ _ and _ _ _ _ _ costs.

Back 32

Direct , Indirect

Front 33

To find initial feasible solution of a transportation problem the method which starts allocation from the lowest cost is called _ _ _ _ _ method

Back 33

Least cost

Front 34

In a transportation problem the method of penalties is called _ _ _ _ _ method

Back 34

Vogel's approximation

Front 35

When the total of allocation of a transportation problem match with supply and demand values the solution is called _ _ _ _ _ solution

Back 35

Feasible

Front 36

When the allocation of a transportation problems satisfy the condition (m+n-1) the solution is called _ _ _ _ _ solution

Back 36

Non degenerate

Front 37

When there is a degeneracy in transportation problem we added an imaginary allocation called _ _ _ _ _ in the solution

Back 37

Epsilon

Front 38

If the number of rows and column in an assignment problem are not equal then it is called _ _ _ _ _ problem

Back 38

Unbalanced

Front 39

In project crashing, rent and overheads are treated as _____ costs

Back 39

Indirect

Front 40

In project crashing, the costs associated with actual activities (e.g. manpower, materials, machinery etc.) are called _____ costs.

Back 40

Direct

Front 41

In project crashing, as we systematically crash the project, direct cost of project _____ and indirect cost of project _____

Back 41

Increases, Decreases

Front 42

In project crashing, as we systematically crash the project, total project cost initially _____ and after the optimal point, it _____

Back 42

Decreases, increases

Front 43

The shortest possible completion time of an activity in PERT is called _____ time.

Back 43

Optimistic

Front 44

The longest possible completion time of an activity in PERT is called _____ time

Back 44

Pessimistic

Front 45

In PERT, the time estimate calculated by using formula (a+4m+b/6) is called _____ time

Back 45

Expected

Front 46

In PERT, the expected project completion time is also called as ______ project completion time

Back 46

Mean

Front 47

Fill in the blanks with '<' or '>' sign as applicable a ___ m ___ b

Back 47

e - < , <

Front 48

The participants in a game are called _____

Back 48

Players

Front 49

A game having more than two players is called _____

Back 49

n - person

Front 50

the outcome of the interaction of selected strategies of opponents in a game is called ______

Back 50

Payoff

Front 51

In a game, the alternatives or courses of action available to each player are called _____

Back 51

strategies

Front 52

A situation in a game where, in the payoff matrix, maximin of row is equal to minimax of column is called _____

Back 52

Saddle point

Front 53

Operations Research (OR) were initiated in England during

Back 53

World war 2

Front 54

Today. OR is a dominant _____ tools.

Back 54

Decision making

Front 55

In OR. Operation refers to the ______ carried out in an organization. Whereas. the word Research refers to the ______ and testing characterized by the scientific method.

Back 55

Activities, process of observation

Front 56

Operations Research (OR) is concerned with using a scientific approach to solve problems for management by ensuring ______

Back 56

Optimum utilisation of resources

Front 57

Operation Research follows an _______

Back 57

Inter - Disciplinary approach

Front 58

Operations Research is an _____ of problem solving and ______ which is used in managing organizations.

Back 58

Analytical problem, Decision making

Front 59

In Operations Research, problems are broken down into _______ then solved in defined steps ______

Back 59

basic components, mathematical analysis

Front 60

Quantitative basis for _______ is provided by managers by OR

Back 60

Decision making

Front 61

OR involves various _______ to solve the problems.

Back 61

Technique

Front 62

Operations Research is an ________ method of problem solving.

Back 62

Analytical

Front 63

An operations oriented planning model helps in better _____ different divisions Of a company.

Back 63

Co-ordinating

Front 64

OR techniques helps to find an ______ by taking into account all the factor

Back 64

Optimum solution

Front 65

OR techniques provide a solution only when all the elements related to aproblem can be ______

Back 65

Quantified

Front 66

A _____ represents the limitations/ restrictions imposed on the values of decision variables in the solution.

Back 66

Constraint

Front 67

_____ is a statement that indicates the objective of an organization.

Back 67

Resources

Front 68

Since the objective function and constraints are expressed as ______ problem can be solved graphically.

Back 68

Linear function

Front 69

There is only major ______ objective in the problem.

Back 69

One

Front 70

Linear programming is adaptive and more flexibility to analyse the problems.

Back 70

Flexible

Front 71

______ can be used when the number of decision variables are two.

Back 71

Graphical method

Front 72

Graphical Method is also known as ______

Back 72

Geometric method

Front 73

______ solution happens when the constraints have contradictory nature.

Back 73

Infeasible

Front 74

A solution which has infinity answer is called _______

Back 74

Unbounded solution

Front 75

Infeasible means ______ Whereas, Unbounded mean _______

Back 75

Not possible, infinite solution

Front 76

All points inside the feasible region or on the boundary of the feasible region or at the corner of the feasible region _____ all constraints.

Back 76

Satisfy

Front 77

A constraint is called _______ when it does not affect the solution.

Back 77

Rebundant

Front 78

_______ optimal solution means a problem has more than one solution which gives the optimal answer.

Back 78

Alternate

Front 79

TO find optimal solution to a Linear Programming problem there are ______ methods available.

Back 79

Two

Front 80

Finding co-ordinates Of constraint lines to represent constraint lines on the graph.

Back 80

Cordinates

Front 81

The feasible region is the region bounded by

Back 81

Constraint line

Front 82

The Simplex method is developed by _______ in 1947.

Back 82

George.B.Datzing

Front 83

The variables with non-zero positive valUes that make up the basis are called basic variables and the remaining variables are called _______

Back 83

Non - basic variable

Front 84

______ refers to the repetition Of the steps so as to obtain closer approximations to the solution of a problem.

Back 84

Iteration

Front 85

Zj row is also known as _______

Back 85

Shadow price level

Front 86

_______ is the element at the intersection Of key row and key column.

Back 86

Key elements

Front 87

______ represent an idle or unutilized resource represented by a constraint.

Back 87

Slack variables

Front 88

_______ represents an excess amount of resources utilized.

Back 88

Surplus variables

Front 89

An artificial variable is a ________

Back 89

Fictitious variables

Front 90

Cj—Zj row is also known as _______

Back 90

Index row and Net evaluation row

Front 91

_______ variables in a simplex table means the which are not in the basis Of that table.

Back 91

Non basic

Front 92

The ________ indicates the variable that Will leave the in Order to make room for the inccyning variable.

Back 92

Key row

Front 93

The ________ column with the positive index number i.e. the variable which has maximum positive (Cj — Zj) value is called incorning variable for the next table.

Back 93

Key column

Front 94

An ________ is a process or set Of rules to be followed in calculations or other problem solving operations. especially by a computer.

Back 94

Algorithm

Front 95

The _________ is an algebraic procedure that starts at a feasible extremepoint of simplex. normally the origin, and systematically moves from onefeasible extreme point to another.

Back 95

Simplex method

Front 96

The region of feasible solution in LPP graphical method is called _______

Back 96

Feasible solution

Front 97

When it is not possible to find solution in LPP, it is called as case of ________

Back 97

Infeasible solution

Front 98

When the feasible region is such that the value of objective function can extend to infinity, it is called a case of _________

Back 98

Unbounded solution

Front 99

When the constraints are a mix of 'less than' and 'greater than' it is a problem having _________

Back 99

Mixed constraint

Front 100

In case of an ' _______ ' constraint, the feasible region is a straight line.

Back 100

Equal to

Front 101

In linear programming, unbounded solution means ________

Back 101

Infinite solution

Front 102

In simplex, a maximization problem is optimal when all Delta J, i.eCj - Zj — values are ________

Back 102

Either zero or negative

Front 103

If in an assignment problem, number of rows is not equal to number of columns then ______

Back 103

Problem is unbalanced

Front 104

The __________ is made on a One to one basis.

Back 104

assignment

Front 105

There are _____ types of Assignments Problans

Back 105

TWO

Front 106

If the problerm is _________ then the necessary number of dummy row(s)/column(s), are added

Back 106

Unbalance

Front 107

For optünaliw, we will cover _______ from rows and columns.

Back 107

Maximum zeros

Front 108

After giving _________ we cancel all the remaining zeroes in that columns and rows.

Back 108

Assignment

Front 109

After row minirnization next step is _______

Back 109

Column minimization

Front 110

If the problem is not balanced, henceforth to balance it ________ is required.

Back 110

Dummy

Front 111

If the problem is not balanced, henceforth to balance it ________ is required.

Back 111

Dummy

Front 112

If the number of jobs is equal io the number of operators then the problern is terrned as ________ Assignment Problem.

Back 112

Balanced

Front 113

If the number Of jobs is not equal to the number of operators then the Assignment Problem is known as ________ Assignment Problem.

Back 113

Unbalanced

Front 114

Maximization Problem, then convert the maximization table into ________or Opportunity Loss Matrix.

Back 114

Regret matrix

Front 115

If cost. time. etc is given, then it is ________

Back 115

Minimization problem

Front 116

Whereas, if profit. sales, production, etc is given then it is Maximintion problems.

Back 116

Maximization problem

Front 117

For _________ minimization, we will take least value from each row andsubtract it from all values of that row.

Back 117

Row

Front 118

For _______ minimization, we will take least value frorn each column and subtract it from all values of that column.

Back 118

Column

Front 119

If m + n - I—Number Of allocations in transportation, it means ( where m is number Of rows and n= number of columns)

Back 119

There is no degeneracy

Front 120

Which of the following considers difference between two least cost for each row and column while finding initial basic feasible solution in transportation?

Back 120

Vogels approximately

Front 121

________ is a problem in which goods are transported from a set of sources to a set of destinations subject to the supply and demand Of the source and destination.

Back 121

Transportation

Front 122

Transportation problems whose main objective is to minimize the cost of shipping goods are called ________

Back 122

Minimizing

Front 123

An alternative Objective is to maximize the profit of shipping goods, in Whichcase the problems are called _______

Back 123

Maximizing

Front 124

When a transportation problem is unbalanced. _______ is used to even out demand and supply.

Back 124

Dummy variable

Front 125

The value of Dummy is ________

Back 125

zero

Front 126

If the number of occupied cells is less than m+n—l then the solution is known as

Back 126

Degenerate solution

Front 127

There are _______ types Of techniques available to find the Initial Basic Feasible Solution.

Back 127

Three

Front 128

When demand is not equal to supply. we need to add ________

Back 128

Dummy

Front 129

When demand is equal to supply it is ________ problems.

Back 129

Balance

Front 130

When demand is not equal to supply it is _______ problems.

Back 130

Unbalance

Front 131

A dummy variable is simply a _______ variable.

Back 131

Fictional

Front 132

If the number of occupied cells is equal to m+n—l i.e. number of independent constraint equations, then it is ________

Back 132

Basic Feasible Solution.

Front 133

if the number of occupied cells is less than m+n—l then the solution is known as _______ solution

Back 133

degenerate

Front 134

There are two technique to study the network analysis, viz. _______

Back 134

PERT and CPM

Front 135

The technique of PERT was developed by ______ (1958) for the 'Polaris' missile program.

Back 135

US. Navy

Front 136

This technique was developed by _______ (1957)

Back 136

E l. Du Pont de nemours & co.

Front 137

______ means constructing a network diagram that consists of all activities and events of a project which represents their inter-relationships.

Back 137

Network analysis

Front 138

______ is a task scheduled to be completed within a specific/ expected duration Of time.

Back 138

An Activity

Front 139

______ is the longest path in terms of project completion time by which the project is completed.

Back 139

Critical path

Front 140

________ an activity that must be completed prior to the start Of another activity

Back 140

Preceding activity

Front 141

Two or more activities are the start _______ in nature if the end of one activity is the start of another.

Back 141

Sequential

Front 142

_______ is an activity that cannot be started till One or more preceding activities are complete

Back 142

Succeeding Activity

Front 143

Activities that can be performed simultaneously (at the sarne time) are called ______

Back 143

Concurrent Activity

Front 144

The _______ is the cost directly dependent upon the amount Of resource

Back 144

Direct cost

Front 145

_______ is the cost towards the general administrative expenses, licence fee, taxes et

Back 145

Indirect cost

Front 146

The ______ is the activity duration under normal circurnstances

Back 146

Normal time

Front 147

The direct cost associated with the _______

Back 147

Normal completion time

Front 148

The minimurn possible time in which an activity can be completed, is called _______

Back 148

crash time

Front 149

The total project cost which is the of the activity cost will also depend upon the ________

Back 149

Project completipn time

Front 150

The project cost in general involves _______ types of costs.

Back 150

Two

Front 151

The rate at which the Cost increases is called as the _______

Back 151

Crash slope

Front 152

It is assumed that less is the project duration more is the ________ associated with.

Back 152

Cost

Front 153

The total completion cost is referred as the _______

Back 153

Crashing cost

Front 154

When this normal period is reduced to some extent to the period called _______

Back 154

Crash cost

Front 155

The ________ assumes that the completion time of an activity in the project is fixed observes a single value.

Back 155

Critical path method (CPM)

Front 156

_______ assumes 3 time estimates associated with each activity in the project

Back 156

PERT

Front 157

_______ is the expected taken for the completion of an activity.

Back 157

Expected time or mean

Front 158

PERT does not make use of ______

Back 158

Dummy activities

Front 159

PERT is restricted to ______

Back 159

Time variables

Front 160

The normal curve divides into ______ parts

Back 160

Two equal

Front 161

The probability of normal curve is _______ always.

Back 161

50%

Front 162

Optimistic time is the shortest possible time required for the completion of the activity.

Back 162

Shortest

Front 163

Pessimistic time is the longest time period expected to complete the activity.

Back 163

Longest

Front 164

_______ is the time estimate within which the activity is completed moreoften

Back 164

Most likely time

Front 165

When we combine the values of optimistic time, most likely time and pessimistic time in a statistical manner, we can arrive at the _______ of an activity

Back 165

expected time

Front 166

The _______ analysis completion time (T) of the activity is a random variablecharacterized by sorne probability distribution.

Back 166

PERT

Front 167

_______ is defined as an activity between two or more persons involving activities by each person according to a set Of rules.

Back 167

Game

Front 168

_______ is a type of decision theory in which one's own choice Of action is determined after taking into account all possible alternatives

Back 168

Game theory

Front 169

The competitors in a also known as _______ , deterrnine the best course of action

Back 169

players

Front 170

A _______ represents a competitive situation between two parties and is played with certain pre-determined rules.

Back 170

Game

Front 171

A game having two players is known as a _______

Back 171

Two persons game

Front 172

All the possible courses of action that are available to a player are known as ________

Back 172

Strategies

Front 173

The two types of strategies are _______ and _______

Back 173

Pure strategy,

Front 174

A ________ provides a complete definition of how a player will play a game.

Back 174

Pure strategy

Front 175

_______ is the one in which the player selects more than one strategy with fixed probabilities before playing the games

Back 175

Mixed strategy

Front 176

A ______ occurs when each player selects one of his strategies.

Back 176

Play

Front 177

The choice of the strategy is made by both the _______ simultaneously.

Back 177

Player

Front 178

Every combination of strategies determines an outcome known as ________

Back 178

Payoff

Front 179

The various alternatives or courses of actions available to each player in a game are called as ______

Back 179

Strategies

Front 180

________ in Operations Research involves the selection Of an appropriate order in which a number of jobs (operations) can be assigned.

Back 180

Sequencing problem

Front 181

Sequencing problems help the managers in situations where there is a choice of the _______ which a particular job is to be performed.

Back 181

Sequence

Front 182

Sequencing problem can be solved using the _______ basis

Back 182

First come first served

Front 183

_______ means the time each requires at each machine.

Back 183

Processing time

Front 184

_______ means the order in which the machine are required to complete the job.

Back 184

Processing order

Front 185

_______ job can be at a time on a given machine.

Back 185

Only one

Front 186

_______ to be used are Of different types.

Back 186

Machines

Front 187

Each _______ started On a machine is to be performed up to thecompletion on that maclline.

Back 187

Job

Front 188

The time taken by the jobs in moving from One machine to another is very negligible and is taken as equal to _______

Back 188

Zero

Front 189

________ on a machine refers to the time a machine remains idle during the total elapsed time.

Back 189

Idle time

Front 190

_______ time is the time interval between starting the first job and completing the last job.

Back 190

Total elapsed