Optimization, Linear Programming, Convex Optimization, Duality, Towards Data Science.
provides a lower bound to its primal version solution. Hence, the difference between dual optimal solution and primal optimal solution is known as Duality Gap. For linear problems and convex nonlinear problems, duality gap is zero. For these problems, a solution cannot be feasible to both primal