Question

Assessment 3 – Graphical LP                                                                         

You are given the following linear programming problem.

            Maximize Z =.            $46X1 + $69X2

                        S.T.                  4X1 + 6X2      < 84

                                                2X1 + 1 X2     > 20

                                                4X1                 < 60

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

Optimum solution 1:

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

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

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

Answer 1

Optimum solution 1:

X1 =4.5          X2 =11          S1 =0            S2 =0           S3 =0                 Z =966                

Optimum solution 2:

X1 =15           X2 =4             S1 =0            S2 =0           S3 =0                 Z =966