Exercise 2.7 We say that two linear programming problems are equiva- lent if one can be...

Transcribed Image Text:

Exercise 2.7 We say that two linear programming problems are equiva- lent if one can be obtained from the other by (i) multiplying the objective function by -1 and changing it from min to max, or max to min, and/or (ii) multiplying some or all constraints by -1. For example, min{cTx: Ax ≥ b} and max{-cx: -Ax ≤ -b} are equivalent problems. Find a linear pro- gram which is equivalent to its own dual. Exercise 2.7 We say that two linear programming problems are equiva- lent if one can be obtained from the other by (i) multiplying the objective function by -1 and changing it from min to max, or max to min, and/or (ii) multiplying some or all constraints by -1. For example, min{cTx: Ax ≥ b} and max{-cx: -Ax ≤ -b} are equivalent problems. Find a linear pro- gram which is equivalent to its own dual.

Answer rating: 100% (QA)

Solution max ZXX2 show that 222 1 ... View the full answer