Consider a feasible solution x to the standard form problem minimize c 0x subject to ax = b x ≥ 0, and let z = {i : xi = 0}. show that x is an optimal solution if and only if the linear programming problem minimize c 0 d subject to ad = 0 (1) di ≥ 0, i ∈ z, has an optimal cost of zero