# Question

By inspecting Fig. 5.2, explain why Property 1b for CPF solutions holds for this problem if it has the following objective function.

(a) Maximize Z = x3.

(b) Maximize Z = - x1 + 2x3.

(a) Maximize Z = x3.

(b) Maximize Z = - x1 + 2x3.

## Answer to relevant Questions

Consider the three-variable linear programming problem shown in Fig. 5.2. Consider a two-variable mathematical programming problem that has the feasible region shown on the graph, where the six dots correspond to CPF solutions. The problem has a linear objective function, and the two dashed lines ...Consider the following problem. Maximize Z = 4x1 + 3x2 + x3 + 2x4, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0, x4 ≥ 0. Let x5 and x6 denote the slack variables for the respective constraints. After you apply the simplex ...Consider the following problem. Minimize Z = 2x1 + 3x2 + 2x3, Subject to And x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. Let x4 and x6 be the surplus variables for the first and second constraints, respectively. Let x-bar5 and x-bar7 be ...Reconsider the model in Prob. 3.1-5.Post your question

0