Question 1

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 A

Question 2

During an iteration while moving from one solution to the next, degeneracy may occur when

Accepted Answer

A)  The closed path indicates a diagonal move 
B)  Two or more occupied cells are on the closed path but neither of them represents a corner of the path. 
C)  Two or more occupied cells on the closed path with minus sign are tied for lowest circled value 
D)  Either of the above 
A)  The closed path indicates a diagonal move 
B)  Two or more occupied cells are on the closed path but neither of them represents a corner of the path. 
C)  Two or more occupied cells on the closed path with minus sign are tied for lowest circled value 
D)  Either of the above C

Question 3

The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that

Accepted Answer

A)  The solution be optimal 
B)  The rim conditions are satisfied 
C)  The solution not be degenerate 
D)  All of the above 
A)  The solution be optimal 
B)  The rim conditions are satisfied 
C)  The solution not be degenerate 
D)  All of the above B

Question 4

If one of the constraint of an equation in an LP problem has an unbounded solution, then

Accepted Answer

A)  Solution to such LP problem must be degenerate 
B)  Feasible region should have a line segment 
C)  Alternative solutions exist 
D)  None of the above 
A)  Solution to such LP problem must be degenerate 
B)  Feasible region should have a line segment 
C)  Alternative solutions exist 
D)  None of the above

Question 5

While solving a LP model 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

Question 6

If a non-redundant constraint is removed from an LP problem then

Accepted Answer

A)  Feasible region will become larger 
B)  Feasible region will become smaller 
C)  Solution will become infeasible 
D)  None of the above 
A)  Feasible region will become larger 
B)  Feasible region will become smaller 
C)  Solution will become infeasible 
D)  None of the above

Question 7

The solution space (region) of an 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 & b 
A)  An incorrect formulation of the LP model 
B)  Objective function is unbounded 
C)  Neither a nor b 
D)  Both a & b

Question 8

While solving a 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

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

During an iteration while moving from one solution to the next, degeneracy may occur when

The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that

If one of the constraint of an equation in an LP problem has an unbounded solution, then

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

If a non-redundant constraint is removed from an LP problem then

The solution space (region) of an LP problem is unbounded due to

While solving a LP problem, infeasibility may be removed by

Linear Programming and Decision-Making Techniques

Markov Analysis, Queuing Theory, Operations Research and Mathematical Modeling

Simulation Modeling and Analysis

Linear Programming and Project Management

Linear Programming Models and Techniques

Queuing Systems

Markov Analysis and Simulation Techniques for Queuing Systems

Filters

Exam 6: LP and Transportation Models: Assumptions, Limitations, and Solutions

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

During an iteration while moving from one solution to the next, degeneracy may occur when

The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that

If one of the constraint of an equation in an LP problem has an unbounded solution, then

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

If a non-redundant constraint is removed from an LP problem then

The solution space (region) of an LP problem is unbounded due to

While solving a LP problem, infeasibility may be removed by

Linear Programming and Decision-Making Techniques

Markov Analysis, Queuing Theory, Operations Research and Mathematical Modeling

Simulation Modeling and Analysis

Linear Programming and Project Management

Linear Programming Models and Techniques

Queuing Systems

Markov Analysis and Simulation Techniques for Queuing Systems

Filters