Use graphical method (operation research).

Draw the graph and feasible area and determine the optimum solution.

Use the simplex method to solve the (LP) model: max Z = 16x1 + 17x2 + 10x3 Subject to X1 + 2x2 + 4x3 < 2000 2x1 + x2 + X3 < 3600 x1 + 2x2 + 2x3 < 2400 X1 < 30 X1, X2, X3 N 0