Approximate solutions for optimization problems become of interest if the 'true' optimum cannot be found: this may happen for the simple reason that an optimum does not exist or because of the 'bounded rationality' (or bounded accuracy) of the optimizer. This paper characterizes several approximate solutions by means of consistency and additional requirements. In particular we consider invariance properties. We prove that, where the domain contains optimization problems without maximum, there is no non-trivial consistent solution satisfying non-emptiness, translation and multiplication invariance. Moreover, we show that the class of 'satisficing' solutions is obtained, if the invariance axioms are replaced with Chernoff's Choice Axiom.