Consider the following LP:
max,z=,3x_(1)+x_(2)
s.t. 4x_(1)+x_(2)>=4
,2x_(1)+x_(2)<=4
,x_(1)+x_(2)=3
,x_(1),x_(2)>=0
(a) Solve the problem graphically
(b) Solve the LP using the Big M method.
(c) Identify in each step of the algorithm the basic solution, indicate if it is feasible, state the objective function value and plot the point in the graph.
(d) Is the problem unbounded, infeasible, does it has a unique optimal solution or alternative optimal solutions?
Consider the following LP:
max 2= 3x1+x2 s.t. 4x1+x24 2x1+x24 x1+x2=3 x1,x20
a) Solve the problem graphically
b Solve the LP using the Big M method
c) Identify in each step of the algorithm the basic solution,indicate if it is fea sible, state the objective function value and plot the point in the graph.
d Is the problem unbounded, infeasible, does it has a unique optimal solution or alternative optimal solutions?