Consider the following set of inequalities:

2x1 + 3x2 … 12

-3x1 + 2x2 … -4 3x1 - 5x2 … 2 x1 unrestricted x2 Ú 0 A feasible solution can be found by augmenting the trivial objective function, maximize z = x1 + x2, and then solving the problem. Another way is to solve the dual, from which a solution for the set of inequalities can be found. Apply the two methods.