Equivalences of optimization problems

Defining what it means for two optimization problems to be "equivalent" is hard, and is not usually done rigorously.

Loose definition: Equivalent optimization problems

Two optimization problems are called equivalent whenever there are "simple" (as in "easy to compute") functions and such that

The difficulty in defining this equivalence arises from optimization theory almost always being applied computationally. If we simply defined two problems being equivalent as the existence of arbitrary such functions as in the definition above, then all problems that have an optimal solution would be equivalent; we can simply let and map everything to an optimal solution.