1. Minimize x + y + z subject to the constraints

2. Minimize 375 - 2x - 3y subject to the constraints

Write each linear programming problem as a maximization problem with all inequalities (except x ‰¥ 0, y ‰¥ 0, c) written in the form [linear inequality] ‰¤ [constant].

Transcribed Image Text:

2x + 3y + z 27 5x + 6y + 7z 2 8 (xz 0, yz 0, z2 0. y 2 0, zz 0. (xz 0, y z 0 |xs 30, y s 25 |x + ys 45 (x+yz 15.