##
1. If the feasible region of a LPP is empty, the solution is ______________.

1.

If the feasible region of a LPP is empty, the solution is ______________.

1.

If the feasible region of a LPP is empty, the solution is ______________.

2.

Graphic method can be applied to solve a LPP when there are only _____________ variable.

3.

The solution need not be in ___________ numbers.

4.

All the parameters in the linear programming model are assumed to be ____________.

5.

In maximization cases, _____________ are assigned to the artificial variables as their coefficients in the objective function.

6.

If in a LPP , the solution of a variable can be made infinity large without violating the constraints, the solution is _____________.

7.

A minimization problem can be converted into a maximization problem by changing the sign of coefficients in the _____________.

8.

If there are ‘m’ original variables and ‘n’ introduced variables, then there will be _____________ columns in the simplex table.

9.

Any column or raw of a simplex table is called a __________.

10.

Every LPP is associated with another LPP is called ______________.