Consider the following Linear Program: Maximum Z = 2X1 + 3X2

Boundary Function:

X1 + 3 X2 ≤ 6

3 X1 + 2 X2 ≤ 6

X1, X2 ≥ 0

Questions:

a) Express the problem in equation form.

B) Determine all the basic solutions to the problem, and classify them as feasible and unfeasible.

C) Use direct substitution in the objective function to determine the optimal optimal feasible solution.

D) Graphical verification that the solution obtained in (c) is the optimal solution LP, concluding that the optimal solution can be determined algebraically by considering only a feasible basic solution. E) Show how basic solutions are not eligible to be represented in the graphics solution space.