# Question

Consider the following problem.

Maximize Z = 3x1 + 7x2 + 2x3,

Subject to

And x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.

Maximize Z = 3x1 + 7x2 + 2x3,

Subject to

And x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.

## Answer to relevant Questions

Consider the model given in Prob. 5.2-2. Let x6 and x7 be the slack variables for the first and second constraints, respectively. You are given the information that x2 is the entering basic variable and x7 is the leaving ...Consider the three-variable linear programming problem shown in Fig. 5.2. Use the weak duality property to prove that if both the primal and the dual problem have feasible solutions, then both must have an optimal solution. Suppose that a primal problem has a degenerate BF solution (one or more basic variables equal to zero) as its optimal solution. What does this degeneracy imply about the dual problem? Why? Is the converse also true? Construct the dual problem for the linear programming problem given in Prob. 4.6-3.Post your question

0