Consider the following linear program:
Max s.t.
x1 + 2x2
x1 + 5x2 ... 10 2x1 + 6x2 ... 16 x1, x2 > 0
a. Write the problem in standard form.
b. How many variables will be set equal to zero in a basic solution for this problem?
c. Find all the basic solutions, and indicate which are also feasible.
d. Find the optimal solution by computing the value of each basic feasible solution.