Assessment 3 – GraphicalLP                                                                       

You are given the following linearprogramming problem.

           Maximize Z=.           $46X1 + $69X2

                       S.T.                 4X1 + 6X2      < 84

                                               2X1 + 1 X2     > 20

                                               4X1                < 60

Using graphical procedure, solve the problem. (Graph theconstraints and identify the region of feasiblesolutions). What are the values of X1, X2 ,S1, S2, S3, andthe value of the objective function (Z) at optimum? If there aremultiple optimum solutions, please give two of the optimumsolutions.

Optimum solution 1:

X1 =              X2 =              S1 =               S2 =               S3 =               Z =                

Optimum solution 2: (if there is a second optimumsolution)

X1 =              X2 =              S1 =               S2 =               S3 =               Z =