Engineering Optimization: Theory and Practice, Fourth Edition

168 Linear Programming I: Simplex Method

subject to

3 x+ 4 y≤ 24

x−y≤ 3

x+ 4 y≤ 4

3 x+y≥ 3

x≥ 0 , y≥ 0

3.40 Maximizef=^3 x+^2 y

subject to

9 x+ 10 y≤ 330

21 x− 4 y≥ − 36

x+ 2 y≥ 6

6 x−y≤ 72

3 x+y≤ 54

x≥ 0 , y≥ 0

3.41 Rework Problem 3.40 by changing the constraintx+ 2 y≥6 tox+ 2 y≤6.

3.42 Maximizef=^3 x+^2 y

subject to

9 x+ 10 y≤ 330

21 x− 4 y≥ − 36

x+ 2 y≤ 6

6 x−y≤ 72

3 x+y≥ 54

x≥ 0 , y ≥ 0

3.43 Maximizef=^3 x+^2 y

subject to

21 x− 4 y≥ − 36

x+ 2 y≥ 6

6 x−y≤ 72

x≥ 0 , y≥ 0