# Simplex Tableaux Problem

I have the following LP which I need to solve using the simplex method. I know there are no feasible solutions as there are constricting constraints. How do I use the Tableaux method to show this?

\begin{align} \text{maximize} & 4x + 2y \\ \text{subject to} & 4x + 6y \geq 12 \\ & 2x + 4y \leq 4 \\ & x \geq 0 \\ & y \geq 0 \end{align}

Any help would be much appreciated!

-
WolframAlpha suggests there is no maximum: wolframalpha.com/input/…. Are you sure you've copied it correctly? –  Austin Mohr Oct 1 '12 at 0:25
You need to (1) convert it into the linear program for feasibility and (2) use the simplex method to solve this other program and show it's not feasible. The linear program for feasibility is usually called "phase 1". So you need to follow the steps for doing "phase 1". Hopefully this will be enough to let you figure out what's going on –  Peter Shor Oct 1 '12 at 4:27
@Austin: $12 \leq 4x + 6y \leq 4x+8y \leq 8$, so there are no solutions. He's copied it correction. I have no idea what WolframAlpha is doing. –  Peter Shor Oct 1 '12 at 4:32