Consider the simplex method for a canonical linear programming ...

[misspop]

Consider the simplex method for a canonical linear programming problem.
 
  If x is an extreme point of the feasible set and if the objective function cannot be decreased by moving along any of the edges of the feasible set which join at x, then x is an optimal solution.
  A) True B) False

Question 2

In the simplex method for a canonical linear programming problem, if a solution is not optimal then the variable which should be brought into the solution is the variable xk for which the entry in the bottom row is as negative as possible.
 
  A) True B) False

[paavo]

Answer to Question 1

B

Answer to Question 2

A

[misspop]

Excellent

[bitingbit]

Great answer, keep it coming