Question 1

While solving LP problem graphically, the area bounded by the constraints is called

Accepted Answer

A)  Feasible region 
B)  Infeasible region 
C)  Unbounded solution 
D)  None of the above 
A)  Feasible region 
B)  Infeasible region 
C)  Unbounded solution 
D)  None of the above A

Question 2

Activities lying on the critical path are called………….

Accepted Answer

A)  Net work 
B)  Critical path 
C)  Critical activities 
D)  None of the above 
A)  Net work 
B)  Critical path 
C)  Critical activities 
D)  None of the above C

Question 3

Activities that cannot be started until one or more of the other activities are completed, but immediately succeed them are called ……activities

Accepted Answer

A)  Predecessor 
B)  Successor 
C)  Dummy 
D)  End 
A)  Predecessor 
B)  Successor 
C)  Dummy 
D)  End B

Question 4

If two constraints do not intersect in the positive quadrant of the graph, then

Accepted Answer

A)  The problem is infeasible 
B)  The solution is unbounded 
C)  One of the constraints is redundant 
D)  None of the above 
A)  The problem is infeasible 
B)  The solution is unbounded 
C)  One of the constraints is redundant 
D)  None of the above

Question 5

Which of the following may not be in a linear programming formulation?

Accepted Answer

A)  . 
C)  =. 
D)  All the above 
A)  . 
C)  =. 
D)  All the above

Question 6

All negative constraints must be written as

Accepted Answer

A)  Equality 
B)  Non equality 
C)  Greater than or equal to 
D)  Less than or equal to 
A)  Equality 
B)  Non equality 
C)  Greater than or equal to 
D)  Less than or equal to

Question 7

………. . models in which the input and output variables follow a probability distribution.

Accepted Answer

A)  Iconic 
B)  mathematical 
C)  analogue 
D)  Deterministic model 
A)  Iconic 
B)  mathematical 
C)  analogue 
D)  Deterministic model

Question 8

An activity which must be completed before one or more other activities start is known as ………. activity.

Accepted Answer

A)  Predecessor 
B)  Successor 
C)  Dummy 
D)  End 
A)  Predecessor 
B)  Successor 
C)  Dummy 
D)  End

Question 9

While solving an LP problem infeasibility may be removed by

Accepted Answer

A)  Adding another constraint 
B)  Adding another variable 
C)  Removing a constraint 
D)  Removing a variable 
A)  Adding another constraint 
B)  Adding another variable 
C)  Removing a constraint 
D)  Removing a variable

Question 10

While solving an LP problem, infeasibility may be removed by

Accepted Answer

A)  Adding another constraint 
B)  Adding another variable 
C)  Removing a constraint 
D)  Removing a variable 
A)  Adding another constraint 
B)  Adding another variable 
C)  Removing a constraint 
D)  Removing a variable

Question 11

………. Example of probabilistic model

Accepted Answer

A)  Game theory 
B)  Charts 
C)  Graphs 
D)  All the above 
A)  Game theory 
B)  Charts 
C)  Graphs 
D)  All the above

Question 12

The solution space of a LP problem is unbounded due to

Accepted Answer

A)  An incorrect formulation of the LP model 
B)  Objective function is unbounded 
C)  Neither (a) nor (b) 
D)  Both (a) and (b) 
A)  An incorrect formulation of the LP model 
B)  Objective function is unbounded 
C)  Neither (a) nor (b) 
D)  Both (a) and (b)

Question 13

Any activity which does not consume either any resource or time is called ………. . activity.

Accepted Answer

A)  Predecessor 
B)  Successor 
C)  Dummy 
D)  End 
A)  Predecessor 
B)  Successor 
C)  Dummy 
D)  End

Question 14

In linear programming problem if all constraints are less than or equal to, then the feasible region is

Accepted Answer

A)  Above lines 
B)  Below the lines 
C)  Unbounded 
D)  None of the above 
A)  Above lines 
B)  Below the lines 
C)  Unbounded 
D)  None of the above

Question 15

……. is a series of related activities which result in some product or services.

Accepted Answer

A)  Network 
B)  transportation model 
C)  assignment 
D)  none of these 
A)  Network 
B)  transportation model 
C)  assignment 
D)  none of these

Question 16

Straight lines shown in a linear programming graph indicates

Accepted Answer

A)  Objective function 
B)  Constraints 
C)  Points 
D)  All the above 
A)  Objective function 
B)  Constraints 
C)  Points 
D)  All the above

Question 17

…. ……. . is that sequence of activities which determines the total project time.

Accepted Answer

A)  Net work 
B)  Critical path 
C)  Critical activities 
D)  None of the above 
A)  Net work 
B)  Critical path 
C)  Critical activities 
D)  None of the above

Question 18

An event which represents the beginning of more than one activity is known as ………. . event.

Accepted Answer

A)  Merge 
B)  Net 
C)  Burst 
D)  None of the above 
A)  Merge 
B)  Net 
C)  Burst 
D)  None of the above

While solving LP problem graphically, the area bounded by the constraints is called

Activities lying on the critical path are called………….

Activities that cannot be started until one or more of the other activities are completed, but immediately succeed them are called ……activities

If two constraints do not intersect in the positive quadrant of the graph, then

Which of the following may not be in a linear programming formulation?

All negative constraints must be written as

………. . models in which the input and output variables follow a probability distribution.

An activity which must be completed before one or more other activities start is known as ………. activity.

While solving an LP problem infeasibility may be removed by

While solving an LP problem, infeasibility may be removed by

………. Example of probabilistic model

The solution space of a LP problem is unbounded due to

Any activity which does not consume either any resource or time is called ………. . activity.

In linear programming problem if all constraints are less than or equal to, then the feasible region is

……. is a series of related activities which result in some product or services.

Straight lines shown in a linear programming graph indicates

…. ……. . is that sequence of activities which determines the total project time.

An event which represents the beginning of more than one activity is known as ………. . event.

Linear Programming and Decision-Making Techniques

Markov Analysis, Queuing Theory, Operations Research and Mathematical Modeling

Simulation Modeling and Analysis

Linear Programming Models and Techniques

LP and Transportation Models: Assumptions, Limitations, and Solutions

Queuing Systems

Markov Analysis and Simulation Techniques for Queuing Systems

Filters

Exam 4: Linear Programming and Project Management

While solving LP problem graphically, the area bounded by the constraints is called

Activities lying on the critical path are called………….

Activities that cannot be started until one or more of the other activities are completed, but immediately succeed them are called ……activities

If two constraints do not intersect in the positive quadrant of the graph, then

Which of the following may not be in a linear programming formulation?

All negative constraints must be written as

………. . models in which the input and output variables follow a probability distribution.

An activity which must be completed before one or more other activities start is known as ………. activity.

While solving an LP problem infeasibility may be removed by

While solving an LP problem, infeasibility may be removed by

………. Example of probabilistic model

The solution space of a LP problem is unbounded due to

Any activity which does not consume either any resource or time is called ………. . activity.

In linear programming problem if all constraints are less than or equal to, then the feasible region is

……. is a series of related activities which result in some product or services.

Straight lines shown in a linear programming graph indicates

…. ……. . is that sequence of activities which determines the total project time.

An event which represents the beginning of more than one activity is known as ………. . event.

Linear Programming and Decision-Making Techniques

Markov Analysis, Queuing Theory, Operations Research and Mathematical Modeling

Simulation Modeling and Analysis

Linear Programming Models and Techniques

LP and Transportation Models: Assumptions, Limitations, and Solutions

Queuing Systems

Markov Analysis and Simulation Techniques for Queuing Systems

Filters