Chapter 4.3, Problem 2E

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 $7x+6y+5z$ subject to the constraints

$\{\begin{array}{c}3x-4y-z\ge 1\\ 2x-y-3z\ge 7\\ x\ge 0,y\ge 0,z\ge 0.\end{array}$