Linear Programming model below; Solve with Graphical Solution and Simplex Algorithm. Max Z: 5x 1 + 4x 2 Constraints: x 1 + x 2 ≤ 5 (1) 10x 1 + 4x 2 ≤ 41 (2) x 1 , x 2 ≥ 0 XXXXXXXXXX) a) Solve with the...

Linear Programming model below; Solve with Graphical Solution and Simplex Algorithm.
Max Z: 5x₁
+ 4x₂

Constraints: x₁
+ x₂
≤ 5          (1)
10x₁
+ 4x₂
≤ 41                      (2)

x₁
, x₂
≥ 0                         (3) - (4)
a) Solve with the Graph Method (Don't forget to use the iso-profit line and constraint numbers while determining the graphical method solution).
b) Solve with Simplex Algorithm (Show your row calculations including simplex intermediate steps under your tables, do not delete them).