1.  Values of index row, cj – zj, under one or more of the non-base decision variables ,is/are zero

2.  Some of the values in the constant column, bi are zero

3.  All the replacement ratios, (bi/ais), (‘s’ indicates key column) are negative

2.  Some of the values in the constant column, bi are zero

3.  All the replacement ratios, (bi/ais), (‘s’ indicates key column) are negative

4.  Values of index row cj – zj indicate optimality with artificial variable in the base

2.  Slack variable

3.  Basic solution

4.  None of these

1.  2 or 4

2.  1 or 0

4.  0 or 4

1.  Feasible solution space

2.  Point where the two constraints lines intersect

4.   Intersection of the first constraint line with Y axis

1.  Decision variable are in the base

2.  Decision variables and surplus variable are assigned zero values

4.   Base variables satisfy the constant equations

2.  Convert the in equation with the sign greater than or equal to, in the form of an equation

3.  Apply Big – M method for solution to linear programming problems

4.   Indicate the sensitivity of the surplus variable

1.  proportionality (linearity)

2.  additivity

3.  divisibility

4.  deterministic

1.  is based on the measure of effectiveness

2.  is linear

3.  every constraint functions are linear

1.  1,2,3,4

2.  2,1,3,4

4.  4,3,2,1