Problem. Solve each system using matrix notation.
For unlimited access to Homework Help, a Homework+ subscription is required.
Solve the following linear programming below. If it has infinitelymany optimal solutions, find all optimal solutions.
For all the problems, all of the greater thanand less than signs (>,<) should be a greater/less than equalto signs.
-Solve using the simplexmethod:
1) Maximizesubject: p= x + 2y +3z
3x + y+ 3z<1
2x + y + z<2
x> 0, y> 0, z >0
2) Minimize subject to: c=10s + 3t,
5s + 4t > 4
2s + 3t > 2
s> 0, t> 0
-Solve:
3)Maximizesubject to P = 3x+ 2y + z
2x + 3y + z <30
x - 2y + z > 20
2x + 5y + 2z >0
x > 0, y > 0, z >0