Question

6 Proof of the dual theorem Proof: We will assume that the primal LP is in canonical form Maximize Zr, such that Arb 20 12 Its dual is Minimize W·ry, such that ATy c (no sign constraints on y). Step 1: Suppose xB is the basic variables in the optimal BFS (say r*) f follows from the above discussion that Row (0) of the optimal tableau will be the Prianal LP. It Basic VariableRow2 RHS It follows that, if we let We laVE In other words, y" is dual feasible Step 2: The dual objective function takes value bg at feasible solution . However, it is not difficult to see that which is the optimal value for the primal LP Step 3 We have found a dual feasible solution ý and a primal feasible solution , for which y.It follows that g is optimal for the dual, and optimal value for the dual'r optimal value for the primal. We complete the proof
please explain it to me clearly

Answer 1

ANSOER- Such thab Heaie C. bm dualthe olang Mnimaaoo tp Such that ATyzc, 20 Heae 9, tm

and20 In his Case '. the dual 13 y,-y-3322 and yny2 , уз 20 19 fasblehe Primdl, and 'y is sble fo Suose the dual. then By defnon,Ay2. Since so -negatve tomponent wiSe Ne have However, S)nce AL Gndno- tomponenb- lse We have ond y