Simplex Algorithm: A Maximization Example. explain the details (steps) of the simplex algorithm. Recall the model Maximize (max) z = 5x1 + 4x2 Subject to (s.t.) 6x1 + 4x2 24 X1 + 2x2 6 -X1 + X2 1 We use the Reddy Mikks model to X2 2 X, X220 (Raw material M1) (Raw material M2) (Production relationship) (Demand constraint) (Sign restriction)