Consider a convex optimization problem with decision variable x. Though I'm interested in answers for any kind of convex optimization problem, let's say it's an LP, so we have something like:
\begin{equation*} \begin{array}{ll@{}ll} \text{min} & \displaystyle c^\text{T}x \\ \text{s.t.} & \displaystyle Ax\geq b \\ & x \geq 0 \end{array} \end{equation*}
Now let's say I have a second linear program where the constraint variables are defined by the decision variables of the first, i.e. the $x$ in what follows is the argmin of the preceding problem:
\begin{equation*} \begin{array}{ll@{}ll} \text{min} & \displaystyle d^\text{T}y \\ \text{s.t.} & \displaystyle By\geq x \\ \end{array} \end{equation*}
You could continue this chain of dependencies ad nauseam. This looks like it could be a common situation, where the decisions you make for one problem influence the feasible solutions of another, but I'm having a hard time finding examples in the literature. Possible examples that spring to mind include inventory management where you buy x units of something, and then use those x units to achieve some other goal $d^\text{T}y$, or optimal control where $c^Tx$ is a decision made at timestep $t$ and $d^Ty$ is a decision made a timestep $t+1$. But again I can't find any problems in this specific form.
Can anyone point me to some previously studied (class of) optimization problem where this setup arises?