Answer on Question #42157, Economics, Economics of Enterprise
A. If and , the cost of producing any given output is minimized and . Since the lower bound is valid for every , we can search for the best one, that is, the largest lower bound:
The problem of finding the best lower bound:
is called the dual problem associated with the Lagrangian defined above. It is optimal value if the dual optimal value is not used. As noted above, is concave. This means that the dual problem, which involves the maximization of with sign constraints on the variables, is a convex optimization problem.
**Example:** For the problem of minimum distance to a polyhedron above, the dual problem is
Comments