Operations Research.
Transformation of a primal problem may lead to wildly different forms of dual problems. Slater’s constraint qualification: strong duality holds for a convex optimization as long as it is strictly feasible. - Strong duality holds for LPs and convex QPs as long as they are feasible.