Q-7 The following LPP needs to be solved by Simplex algorithm. This is a product mix problem wherein there are 3 products represented by the 3 variables respectively. X1, X2 and X3 represent the number of units of the various products manufactured per month. Maximize 3X1 + 2X2 + 5X3 Subject to: X1 + 2X2 + X3 =0