The Simplex Algorithm: Problem 3

You should now have done the previous example and theexample from lectures.

This problem has three variables. Maximize


subject to the constraints



We rewrite this in the standard by introducing slack variables so that now the problem is:

Maximize


subject to the constraints




Write this problem in tabular form. Enter the numbers into the table below using the notation of the previous examples.

Basic Variables Constants x1 x2 x3
x4
x5
x6
f