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)

Accepted Answer

C

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

Accepted Answer

The area bounded by the constraints in a linear programming problem is known as the feasible region, where all the constraints are satisfied.

Question 3

Which of the following may not be in a linear programming formulation?
A) <=.
B) >.
C) =.
D) All the above

Accepted Answer

In linear programming formulations, inequalities such as <= and = are commonly used to define constraints. However, the strict inequality > is not typically used because it does not define a closed set, which is necessary for the feasible solution space in linear programming.

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

Accepted Answer

Removing a constraint can potentially make an infeasible linear programming (LP) problem feasible by relaxing the conditions that are causing the infeasibility. Constraints define the feasible region, and if they are too restrictive, they might not leave any feasible solution space.

Question 5

Straight lines shown in a linear programming graph indicates
A) Objective function
B) Constraints
C) Points
D) All the above

Accepted Answer

Straight lines in a linear programming graph represent the constraints that limit the feasible solution area. These constraints are usually linear inequalities or equations.

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

Accepted Answer

In linear programming, if all constraints are of the type "less than or equal to," the feasible region is found below the lines representing these constraints on a graph. This is because each constraint limits the solution to values that do not exceed a certain maximum, effectively creating a boundary below the lines when graphed.

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

Accepted Answer

A network is a series of related activities which result in some product or services, often represented in project management and operations research.

Question 8

Any activity which does not consume either any resource or time is called ………. . activity.
A) Predecessor
B) Successor
C) Dummy
D) End

Accepted Answer

Dummy activities are used in project management and network diagrams to represent paths that have no resources or time associated with them. They are typically used to show dependencies between tasks.

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

Accepted Answer

The answer of All negative constraints must be written as
A)...

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

Accepted Answer

Successor activities are those that follow the completion of one or more activities in a project schedule, indicating they cannot start until the preceding activities are completed.

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

Accepted Answer

An event that represents the beginning of more than one activity is known as a Burst event. This term is often used in the context of process modeling and diagramming, where a single event triggers multiple subsequent actions or processes.

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

Accepted Answer

If two constraints do not intersect in the positive quadrant, it does not necessarily mean the problem is infeasible, unbounded, or that one constraint is redundant. It could simply mean that the feasible region is defined by other constraints or that the constraints are parallel.

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

Accepted Answer

A Predecessor activity is one that must be completed before one or more subsequent activities can begin. It precedes other activities in a project schedule.

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

Accepted Answer

Removing a constraint can potentially remove the cause of infeasibility by relaxing the problem, allowing for a feasible solution to be found.

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

Accepted Answer

The critical path is the sequence of activities that determines the total project time. It represents the longest stretch of dependent activities and any delay in the critical path directly affects the project completion time.

Question 16

Activities lying on the critical path are called………….
A) Net work
B) Critical path
C) Critical activities
D) None of the above

Accepted Answer

Critical activities are the tasks or activities that lie on the critical path in a project schedule. These activities directly impact the project's total duration, as any delay in these tasks will delay the project's completion date.

Question 17

………. . models in which the input and output variables follow a probability distribution.
A) Iconic
B) mathematical
C) analogue
D) Deterministic model

Accepted Answer

The answer of ………. . models in which the input...

Question 18

………. Example of probabilistic model
A) Game theory
B) Charts
C) Graphs
D) All the above

Accepted Answer

Game theory is an example of a probabilistic model because it involves the study of mathematical models of strategic interaction among rational decision-makers, often under conditions of uncertainty.

Quiz 4: Linear Programming and Project Management

The solution space of a LP problem is unbounded due to

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

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

While solving an LP problem infeasibility may be removed by

Straight lines shown in a linear programming graph indicates

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.

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

All negative constraints must be written as

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

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

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

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

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

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

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

………. Example of probabilistic model