1. True or False

a. Unbounded solution cases is if the objective value increase (maximum case) or decrease (minimization case) indefinitely. Select one: True/False

b. The procedure for starting Linear Programming with (=) and (>=) constraint is to use artificial variables that play the role of slacks at the first iteration, and then dispose of them legitimately at a later iteration. Select one: True/False

c. If the primal objetive is minimization, then it is true when the dual objective is also minimization. Select one: True/False

d. Vogel Approximation Method (VAM) is one of three method to determine a starting basic feasible solution instead of iterative computation of the Transportation Algorit

e. The procedure for obtaining the simultaneous solution of a system of linear equations is called the Gauss-Jordan method of elimination, or Gaussian elimination Select one: True/False