Question: Rewrite the linear programming problem as a maximization problem with constraints involving inequalities of the form≤ a constant (with the exception of the inequalities x≥0, y≥0, and z ≥0).

Minimize C = 2x-3y

Subject to 3x +5y ≥20

3x+y≤16

-2x+y≤1

x≥ 0, y≥ 0