# Question

Consider the primal and dual problems in our standard form presented in matrix notation at the beginning of Sec. 6.1. Let y* denote the optimal solution for this dual problem. Suppose that b is then replaced by . Let denote the optimal solution for the new primal problem. Prove that

c≤ y*

c≤ y*

## Answer to relevant Questions

For any linear programming problem in our standard form and its dual problem, label each of the following statements as true or false and then justify your answer. (a) The sum of the number of functional constraints and the ...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? Consider the following problem. Maximize Z = x1 + x2, Subject to and x2 ≥ 0 (x1 unconstrained in sign). (a) Use the SOB method to construct the dual problem. (b) Use Table 6.12 to convert the primal problem to our standard ...Consider the model without nonnegativity constraints given in Prob. 4.6-14. (a) Construct its dual problem. (b) Demonstrate that the answer in part (a) is correct (i.e., variables without nonnegativity constraints yield ...Consider the following problem. Maximize Z = 3x1 + x2 +4x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0.Post your question

0