# In canonical form of linear programming model

1.  All the inequalities indicating the constraints are in the same manner

2.  Right hand side of the in equation are constraints

3.  All the variable are non – negative

4.  All of these

4

All of these

Explanation :
No Explanation available for this question

# An inequation indicating the resource or specification constraints in the form as ∑aixj ≥ bi, is converted in the form of an equation by subtracting a non-negative variable Si (Si ≥ 0 ) is called

1.  Basic variable

2.  Non-basic variable

3.  Surplus variable

4.   Artificial variable

4

Surplus variable

Explanation :
No Explanation available for this question

# The artificial variables are made to leave the base and never to enter in the further iteration by the application of

1.  Big ‘M’ method

2.  Two phase method

3.  Simplex method

4.  Both (a) and (b)

4

Both (a) and (b)

Explanation :
No Explanation available for this question

# A constraints is expressed as x2 ≥ 3. It is converted in to the form of an equation as

1.  x1 + x2 + s1 + α1 = 3

2.  x1 + x2 – s2 + α1 = 3

3.  x1 + x2 - s1 + α1 = 3

4.   x1 + x2 + s1 - α1 = 3

4

x1 + x2 - s1 + α1 = 3

Explanation :
No Explanation available for this question

# A constraint in equation 5x1 - 3x2 ≤ -5 is converted as, ( 3x2 + α2 ) - ( 5x1 + s1 )= 5. Then ‘s’ is called as

1.  Basic variable

2.  Artificial variable

3.  Surplus variable

4.  Non-basic variable

4

Surplus variable

Explanation :
No Explanation available for this question

# The constraints in a given situation are found to be as follows 0 ≤ x ≤ 12 0 ≤ y ≤ 9 3x + 6y ≤ 66 The objective function, which is to be maximised is as follows P = 5x + 4y. The values of x and y are

1.  (11,6)

2.  (6,8)

3.  (6,6)

4.  (11,11)

4

(6,8)

Explanation :
No Explanation available for this question

# At the optional solution

1.  Value of the objective is same for the primal and dual

2.  Values of the decision variable (Wi) in the dual problem indicates the contribution per unit of the ith resource, to the value of the objective

3.  Both (a) and (b)

4.  None of these

4

Both (a) and (b)

Explanation :
No Explanation available for this question

# If primal contains ‘n’ decision variables and ‘m’ constraints, its dual would contain

1.  ‘n’ decision variables and ‘m’ constraints

2.  ‘m’ decision variables and ‘n’ constraints

3.  ‘m’ decision variables and ‘m’ constraints

4.  ‘n’ decision variables and ‘n’ constraints

4

‘m’ decision variables and ‘n’ constraints

Explanation :
No Explanation available for this question

# Dual of the dual is the

1.  Dual

2.  Primal

3.  Either dual or primal

4.  None of these

4

Primal

Explanation :
No Explanation available for this question

# If all the variables are unrestricted in sign and in the normal Canonical form, then its dual would have all the constraints in the form of equations and the dual variable would be

1.  Negative

2.  Non-negative

3.  Positive

4.  None of these

4