How to determine all the basic solutions of an optimization
problem, and classify them as feasible or infeasible?
As an example,
Maximize z= 2x1 + 3x2
Subject to:
x1 + 3x2 <= 6
3x1 + 2x2 <= 6
x1 + x2 >= 0
Some solutions are (2,0), (0,2), (0,0), (6/7, 12/7), but are
there more solutions? And how do you tell if they are
infeasile/feasible? Would you need to graph it?