Operations Research.
under the constraints that the λs are all nonnegative. - The dual problem is always a convex optimization. - The primal optimum is lower bounded by the dual optimum, which is also known as weak duality. - Strong duality is situations where the primal optimum and the dual optimum are equal. -