Problems:
Problem-1
Solve the following linear programming model using graphical techniques:
Maximize Z = 1.5x1+x2
Subject to: x1≤4
x2≤6
x1+x2≤5
x1,x2≥0
Do not submit the graph. In your answer, include each of the corner points and the Z value associated with each of the corner points. Highlight the corner point that optimizes the solution. If there is no feasible solution, then indicate so. If the solution lies along a constraint equation, then indicate the constraint equation and the bounds for x1 and x2.
Problem - 2
Solve the following linear programming model by graphical techniques:
Maximize Z = 6.5x1+10x2
Subject to: 2x1+4x2≤40
x1+x2≤15
x1≥8,x2≥0
Do not submit the graph. In your answer, include each of the corner points and the Z value associated with each of the corner points. Highlight the corner point that optimizes the solution. If there is no feasible solution, then indicate so. If the solution lies along a constraint equation, then indicate the constraint equation and the bounds for x1 and x2.