A linear programming problem is given as follows:

Maximize = 1 + 22 Subject to 31 + 22 18 21 + 32 36 1 12 2 9 1, 2 0

Solve the given problem by drawing a graph that contains the following:

Lines for all the constraints Feasible solution area (shade the area)

All the extreme points circled Variable values (decision, slack and surplus variables) at each extreme point next to the circle. For example, (1, 2, 1, 2, ) = (6,8,16,0, ).

A line for the objective function with the exact slope over the optimal point

Choose all the possible changes which make the Problem above have multiple optimal solutions.

a) Addition of a new constraint, 41 + 82 90

b) Removal of the non-negativity constraints for 1

c) Increase of the coefficient of 1 on the 2 nd constraint to 6

d) Decrease of the coefficient of 1 on the 2nd constraint to -8

e) Set the coefficient of 1 in the objective function to 0

f) Decrease of the 4th constraints quantity to 3

Can you guys answer the 2nd part please?? i have an assignement due soon??? I need A-F answered badly