Chapter 4.3, Problem 1E

In Exercises 1–4, write each linear programming problem as a maximization problem with all inequalities (except $x\ge 0,y\ge 0,\mathrm{.....}$) written in the form $\left[\text{linear}\text{inequality}\le \text{constant}\right]$.

Maximize $3x+4y$ subject to the constraints

$\{\begin{array}{c}5x+3y\ge 6\\ 2x-3y\le 7\\ x\ge 0,y\ge 0.\end{array}$