5.23 Strong duality in linear programming. We prove that strong duality holds for the LP minimize cl f subject to Ar ≤ 6 and its dual maximize subject to ATz + c = 0, z ≥ 0, provided at least one of the problems is feasible. In other words, the only possible exception to strong duality occurs when p = 0 and d ≠0.
Consider the example:
Minimize subject to [%J--[+1].
Formulate the dual LP and solve the primal and dual problems. Show that p = d and solve it using the methods: Lagrangian and dual function (not the knowledge of LP duality)