We discuss the dual problem, the constraint qualification, and optimality conditions for the minimisation of a convex function under (possibly non-linear) constraints. The results are also known as Lagrange duality, and solutions to the dual problem are known as Lagrange multipliers.
