Simplex Method (Quiz 2)

a) A ……………………………. solution satisfies “all” constraints.

• good

• bad

• feasible

• infeasible

a) An …………………………... solution violates “at least one” constraint.

• Good

• Infeasible

• Bad

• Feasible

a) An ……………………………. solution is a feasible solution that provides “the most favorable” objective function value. (The largest for maximization and the smallest for minimization problems.)

• Infeasible

• Optimal

• Feasible

• Good

a) A problem might have no optimal solution in the following two cases:

• Unbounded solution & Multiple optimal solution

• Infeasible Solution & Degenerate solution

• Unbounded solution & Infeasible solution

• Unbounded solution & Degenerate solution

a) Assumer there is a total of n variables and m constraints in an LP model. Each variable can be either ………….…. variable or ……………... variable.

• basic & non-basic

• optimal & non-optimal

• feasible & infeasible

• good & bad

a) Number of basic variables always equals to the number of …………………………………….

• non-basic variables plus constraints

• variables minus constraints

• non-basic variables

• constraints

a) Nonbasic variables are always set to …………………….

• 1

• 10

• 0

• 0.1

a) If a basic variable equals to zero in a final Simplex tableau, then the problem has a …………….….. optimal solution.

• multiple

• infeasible

• unbounded

• degenerate

a) The problem is ...………………..……., if we cannot take a ratio test.

• infeasible

• unbounded

• degenerate

• optimal

a) The problem is ...………………..……., if a final solution of Big-M or Phase I of Two-Phase method yields at least one artificial variable greater than zero.

• infeasible

• unbounded

• degenerate

• optimal