Identify if the given linear programming problem is a standard maximization problem. If it is a standard maximization problem, then express the constraints as slack variable equations, write the...

Identify if the given linear programming problem is a standard maximization problem.  If it is a standard maximization problem, then express the constraints as slack variable equations, write the objective function in standard form, and set up the initial simplex tableau.  If it is not a standard maximization problem, then explain all the reasons why it is not and type NA (or Not Applicable) in the remaining boxes.

Minimize: Z=24x+30y+18z

subject to: x+7y-4z≤150

5x+9y+2x≤435

8x-3y+16z≥345

x≥0, y≥0, z≥0

Standard Max Answer Here, Yes or No with reasons (Keyboard only):

Slack Variable Equations Here: (enter NA if it is not a standard maximization problem)

Objective Function in Standard Form Here: (enter NA if it is not a standard maximization problem)

Initial Simplex Tableau Here: (enter NA if it is not a standard maximization problem)