Is there an implicit condition OPT<P(|input|) in approximation schemes?
FPTAS is commonly used for optimization problems whose associated decision problem is in NP.  For those problems, it is guaranteed that the optimal solution has polynomial size (that's part of the definition of NP), so this issue does not arise.