# In the simplex method, infeasibility of a linear programming problem is indicated, when

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

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

4

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

Explanation :
No Explanation available for this question

# In the simplex method, the existence of more than one optimum solution is indicated, when

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

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

4

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

Explanation :
No Explanation available for this question

# In an linear programming model there are 4 decision variables and three constraints. During an iteration, by simplex method, the coefficient of the base variables would form

1.  An identity matrix

2.  Slack variable

3.  Basic solution

4.  None of these

4

An identity matrix

Explanation :
No Explanation available for this question

# The value of base variable in the assignment model is

1.  2 or 4

2.  1 or 0

3.  1 or 2

4.  0 or 4

4

1 or 2

Explanation :
No Explanation available for this question

# The initial simplex table corresponded to what aspect of a graphical solution in two variable maximisation problem

1.  Feasible solution space

2.  Point where the two constraints lines intersect

3.  Intersection of X and Y axes

4.   Intersection of the first constraint line with Y axis

4

Intersection of X and Y axes

Explanation :
No Explanation available for this question

# A basic feasible solution in simplex method is one, when all the

1.  Decision variable are in the base

2.  Decision variables and surplus variable are assigned zero values

3.  Base variables are non-negative

4.   Base variables satisfy the constant equations

4

Base variables are non-negative

Explanation :
No Explanation available for this question

# Artificial variable is introduced, in the simplex method to

1.  Determine the initial basic feasible solution, when surplus variable is present

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

4

Determine the initial basic feasible solution, when surplus variable is present

Explanation :
No Explanation available for this question

# Limitations of linear programming models are based on criteria of

1.  proportionality (linearity)

3.  divisibility

4.  deterministic

5.  all of these

5

all of these

Explanation :
No Explanation available for this question

# Assumption made in the linear programming model is that, the object function

1.  is based on the measure of effectiveness

2.  is linear

3.  every constraint functions are linear

4.   all of these

4

all of these

Explanation :
No Explanation available for this question

1.  1,2,3,4

2.  2,1,3,4

3.  4,1,2,3

4.  4,3,2,1

4