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

Question 1

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

Answer 1

The problem is infeasible

Question 2

The solution space (region) of an 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 & b

Answer 2

Neither a nor b

Question 3

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

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

Answer 3

Feasible region

Question 4

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

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

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

Question 6

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

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 7

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

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

Question 8

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

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