1. Infeasibility in a linear programming problem occurs when: A- There is an infinite solution B- More than one solution is optimum C-The visible region is unbounded D-There is no solution to satisfy all the constraints given. 2. If the total demand is equal to total supply, then resulting transportation is called: A- Equal standard form transportation B- Balance transportation C- Unbalance transportation D- None of the above 3. If the addition of a constraint to a linear programming problem does not change the solution, the constraint is said to be : A- un-bounded B- Infeasible C- Redundant D- Non negative 4. Sensitivity analysis in LP allows us to determine: A- How sensitive the optimal solution is to change the data values B- How sensitive the OFC and RHS values C- How sensitive the extreme points of the problem is to change the data values D- None of the above