### Linear Programming : Simplex Method

Please see the attached file for the fully formatted problems. 1. Consider the following maximum problem in standard form: Maximize Z = 8X1 + 2X2 + 3X3 subject to the constraints X1 + 3X2 + 2X3 < 10 4X1 + 2X2 + 3X3 < 8 X1 > 0, X2 > 0, X3 > 0 (a) Rewrite the two constraints as equations by adding sla