Engineering Optimization: Theory and Practice, Fourth Edition

164 Linear Programming I: Simplex Method

−x+ 6 y≥ 12

5 x+ 2 y≤ 68

x≤ 10

x≥ 0 , y≥ 0

3.17 Rework Problem 3.16 by changing the objective to Minimizef=x−y.

3.18 Maximizef=x+ 2 y

subject to

x−y≥ − 8

5 x−y≥ 0

x+y≥ 8

−x+ 6 y≥ 12

5 x+ 2 y≥ 68

x≤ 10

x≥ 0 , y≥ 0

3.19 Rework Problem 3.18 by changing the objective to Minimizef=x−y.

3.20 Maximizef=x+ 3 y

subject to

− 4 x+ 3 y≤ 12

x+y≤ 7

x− 4 y≤ 2

x≥ 0 , y≥ 0

3.21 Minimizef=x+ 3 y

subject to

− 4 x+ 3 y≤ 12

x+y≤ 7

x− 4 y≤ 2

xandyare unrestricted in sign

3.22 Rework Problem 3.20 by changing the objective to Maximizef=x+y.