This answer is based on the excellent work of Will Jagy. This solves all cases of $k>3.$
Let $p<k$ be an odd prime such that $p\not\mid k.$
Solve $kd\equiv -1\pmod{p}.$ Let $n=(kd+1)/p.$ Note that since $p<k,$ $n>d.$
Then for any integer $t,$ we can take $z=a^{d}t^p$ so that $$\begin{align}az^k+1&=a^{kd+1}t^{kp}+1\\&=\left(a^nt^k\right)^p+1\\
&=(a^nt^k+1)\left(1+a^nt^k\sum_{j=1}^{p-1} (-1)^j\left(a^nt^k\right)^{j-1}\right)
\end{align}$$
Where the last equation is because when $p$ is odd, $$
\begin{align}u^p+1&=(u+1)
\sum_{j=0}^{p-1} (-1)^ju^j
\\&=(u+1)\left(1+u\sum_{j=1}^{p-1}(-1)^ju^{j-1}\right)\end{align}$$
Now, since $n>d,$ we can set $$
\begin{align}x&=a^{n-d}t^{k-p}\\
y&=a^{n-d}t^{k-p}\sum_{j=1}^{p-1} (-1)^j\left(a^nt^k\right)^{j-1}
\end{align}$$
For $k\geq 4$ we can always find such a $p$ by taking a prime factor of $n-1$ or $n-2$ if $n$ is even or odd, respectively.
So this solves all cases $k>3.$
You don't need $p$ prime, just that $1<p<k$ is odd and $\gcd(p,k)=1.$
k even
So when $k$ is even, we can take $p=k-1.$ Then $d=p-1$ and $n=p.$
Then for any integer $t,$ $$\begin{align}z&=a^{k-2}t^{k-1}\\x&=at\\y&=at\sum_{j=1}^{k-2}(-1)^j\left(a^{k-1}t^k\right)^{j-1}.\end{align}$$
k odd
Likewise, if $k=2m+1$ is odd, then you can take $p=2m-1,$ $d=m-1$ and $n=m.$ Then for any integer $t$:
$$\begin{align}z&=a^{m-1}t^{2m-1}\\
x&=at^2\\
y&=at^2\sum_{j=1}^{2m-2}(-1)^j\left(a^mt^{2m+1}\right)^{j-1}
\end{align}$$
is a solution.
In particular, for $k>3$ there are infinitely many solutions $(x,y,z)$ with $a\mid x$ and $x\mid y$ and $x\mid z.$
Best Answer
Claim
$ax + by = c$ has infinite number of positive solution if and only if $a$ and $b$ are of opposite signs and $\gcd(a,b)|c$
Proof
WLOG let $a>0$ and $b<0$. There exists a solution because $\gcd(a,b)|c$.
If $(x',y')$ is a solution then $(x'-b,y'+a)$ is a solution so we get a increasing ordered pair of $(x,y)$ that satisfies the equation. Hence there are infinite number of positive solutions for this case.
It is not possible if $a$ and $b$ are of same sign. Suppose there are infinitely many solution when $a$ and $b$ are of same sign then there exists a solution $(x',y')$ with $\mid x'\mid>c$ and $\mid y'\mid>c$ , but this implies $\mid ax'+by'\mid>c$ thus leading to a contradiction.
For example $(a,b,c)=(rt,-rt,2rt)$ where $r$ is a constant and $t$ is a integer variable will give you different values for $a,b,c$ such that the equation has infinitely many solutions.