Suppose that you are using the simplex method to solve a ...

[sheilaspns]

Suppose that you are using the simplex method to solve a canonical linear programming problem in which each entry in the vector b is positive.
 
  If you obtain a tableau which contains just one negative entry in the bottom row and no positive entry aik above it, then the objective function is unbounded and no optimal solution exists.
  A) True B) False

Question 2

Suppose a system contains three inequalities and three unknowns x1, x2 and x3.
 
  If the simplex method results in an optimal solution in which the slack variable x6 is zero, this means that at the optimal values of x1, x2, and x3, the third inequality is an equality.
  A) True B) False

[cclemon1]

Answer to Question 1

A

Answer to Question 2

A

[sheilaspns]

Thank you!

[cclemon1]

Happy to help