In $(\mathbb{Z},<)$ is it possible to define the operation of addition?
No. For instance, let $X=\{0,1\}\times\mathbb{Z}$ with the lexicographic order. Identifying $\mathbb{Z}$ with $\{0\}\times\mathbb{Z}$ in $X$, then $(\mathbb{Z},\geq)$ is elementarily embedded in $(X,\geq)$ (you can prove this using Ehrenfeucht–Fraïssé games, for instance). If addition were definable (even with parameters) in $(\mathbb{Z},\geq)$, the same definition would give an addition operation that makes $(X,\geq)$ into an ordered abelian group. But that is impossible since $X$ has elements greater than every integer but not any elements less than every integer to be their negatives.
If you more strongly want addition to be definable without parameters, then there's a much simpler argument that it's impossible: the map $f(x)=x+1$ is an automorphism of $(\mathbb{Z},\geq)$. If addition were definable without parameters, then $f$ would preserve addition, but $f(x+y)=x+y+1$ whereas $f(x)+f(y)=x+y+2$.
No, this is not possible. (Although things like successor and predecessor are definable - e.g. $Pred(x)=y$ iff $y< x$ and $\forall z(z<x\implies z\le y)$.) One way to see this is by considering automorphisms of the structure in question. The map $$f:\mathbb{Z}\rightarrow\mathbb{Z}: z\mapsto z+14$$ (say) is an automorphism of the structure $(\mathbb{Z},\le)$, and hence must preserve any relation or function definable in $(\mathbb{Z},\le)$. However, we have $$3+1=4\quad\mbox{ but }\quad f(3)+f(1)=3+14+1+14=32\color{red}{\not=}18=f(3+1).$$ We can also prove stronger results, concretely classifying all possible relations and functions definable in $(\mathbb{Z},\le)$ (and then just checking that $+$ isn't on the list). But such an approach takes more work.
Of course, this method has drawbacks. For example, consider the expansion $(\mathbb{Z},0,\le)$. This structure is rigid (= no nontrivial automorphisms), so we can't use the argument above to show that anything is undefinable. Yet addition is still undefinable in this structure - it just requires a more intricate argument, such as Eric Wofsey's answer. Relevant tools for proving general undefinability results include Ehrenfeucht-Fraisse games and quantifier elimination (of expansions).