Download "user manual"

Transcript
The variable z is maximized when x1 = x4 = x6 = 0, which forces us to have x2 = , x5 = ,
and x3 = . Therefore, (z, x1 , x2 , x3 , x4 , x5 , x6 ) = (256, 0, 8, 3, 0, 12, 0) is a solution to the system
which has maximum z value. (0, 8, 3, 0, 12, 0) is called the basic feasible solution. Finally, dropping
the slack variables, we conclude that
z has the maximum of 256 at (0,8,3).
Ex.7 When is the maximum of the objective function in the linear program in Ex.6 obtained?