Reference no: EM13830286

Problem:

Rewrite the given linear programming problem as a maximization problem with constraints involving inequalities of the form ≤ (with the exception of the inequalities x ≥ 0, y ≥ 0)

Minimize C = 2x + 3y

Subject to x + y ≤ 9
x + 2y ≥ 10
4x + y ≥ 14
x ≥ 0, y ≥ 0

a. Minimize P = -2x - 3y
Subject to x + y ≤ 12
x - 2y ≤ -10
-4x + y ≤ -14
x ≥ 0, y ≥ 0

b. Minimize P = -2x - 3y
Subject to x + y ≤ 12
-x - 2y ≤ -10
-4x - y ≤ 14
x ≥ 0, y ≥ 0

c. Minimize P = -2x - 3y
Subject to x + y ≤ 12
-x + 2y ≤ 10
4x - y ≤ 14
x ≥ 0, y ≥ 0

d. Minimize P = -2x - 3y
Subject to x + y ≤ 12
-x - 2y ≤ -10
-4x - y ≤ -14
x ≥ 0, y ≥ 0

e. Minimize P = 2x + 3y
Subject to x + y ≤ 12
x - 2y ≤ -10
-4x - y ≤ -14
x ≥ 0, y ≥ 0

Additional Information:

This question is basically from Mathematics as well as it is about rewriting linear programming problem as a maximization problem with constraints involving inequalities of form ≤.