Simplex Method (Quiz 1)

a) We can use > or < in an LP formulation.

• True

• False

a) We cannot use = in an LP formulation.

• True

• False

a) In an LP, best corner point feasible solution must be an optimal solution.

• True

• False

a) A problem cannot have multiple optimal solutions.

• True

• False

a) Number of feasible solutions in an LP problem can be infinitely many.

• True

• False

a) At each Simplex iteration, basic variables must satisfy the canonical form.

• True

• False

a) For a maximization problem, the nonbasic variable with the most positive z^th row coefficient will be the entering variable.

• True

• False

a) For a maximization problem, if all of the z^th row coefficients are greater than equal to 0, the optimal solution is obtained.

• True

• False

a) For a minimization problem, the nonbasic variable with the most positive z^th row coefficient will be the entering variable.

• True

• False

a) For a minimization problem, if all of the z^th row coefficients are greater than equal to 0, the optimal solution is obtained.

• True

• False