Deck 4: Linear Programming and Project Management

Question 1

The solution space of a LP problem is unbounded due to

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

Answer 1

Neither (a) nor (b)

Question 2

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

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

Answer 2

Feasible region

Question 3

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

A) <=.
B) >.
C) =.
D) All the above

Answer 3

>.

Question 4

While solving an LP problem infeasibility may be removed by

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

Question 5

Straight lines shown in a linear programming graph indicates

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

Question 6

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

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

Question 7

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

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

Question 8

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

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

Question 9

All negative constraints must be written as

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

Question 10

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

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

Question 11

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

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

Question 12

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

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

Question 13

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

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

Question 14

While solving an LP problem, infeasibility may be removed by

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

Question 15

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

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

Question 16

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

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

Question 17

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

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

Question 18

………. Example of probabilistic model

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