Question no:1

Question no:1

The graphical method can be used to solve any linear programming problem

Select one :

a).True

b).False

Question no:2

In the two-phase method, the first phase gives the feasible solution, while the second phase the optimal solution

Select one :

a).True

b).False

Question no:3

For a solution of linear system of equations, the jacobi method converges faster than the Gauss-Seidel method.

Select one :

a). True

b). False

Question no:4

For a linear programming problem, if the feasible region is unbounded, then it implies that the problem is poorly constructed

Select one :

a). True

b). False

Question no:5

Let A be a 3x3 matrix such that A is invertible. Then the number 0 is not an eigenvalue of A

Select one :

a). True

b). False

Question no:6

In the big-M method for the linear programming problem, if the artificial variables are part of the optimal solution, then the solution exists for the problem

Select one :

a). True

b). False

Question no:7

Let A be a symmetric matrix. Then the eigenvalues of A and A^T are the same.

Select one :

a). True

b). False

Question no:8

In linear programming problems, artificial variables are introduced when the constraints are of < = or > = type.

Select one :

a). True

b). False