Suppose that you have been asked to solve a mixed-integer ILP with 10,000 continuous and n binary decision variables. Determine the largest n’s for which the problem could be totally enumerated in one 24-hour day and in one 24-hour, 30-day month by each of the following computer environments.

(a) An engineering workstation that can enumerate one choice of binary variables each second, including solving the resulting LP.

(b) A parallel processing computer that can evaluate 8192 choices simultaneously every second, including solving the resulting LPs.