There is a fulfillment problem in the e-commerce logistics field, where the fulfillment of each order is composed of a main transport (from City A to City B, referred to as a route) and an end transport (from City B to Site c, also referred to as a route).
To solve for the optimal fulfillment days for main transport carriers on each route and for each end transport carrier on each route, in order to maximize the fulfillment accuracy of all orders.
In constructing the mathematical model, we can introduce three sets of binary variables. If the main transport carrier has a fulfillment day of $t$ on route $i$, then $y_{it}$ = 1. If the end transport carrier has a fulfillment day of $t'$ on route $j$, then $z_{jt'}$ = 1. For each order, which is comprised of route $i$ and route $j$ fulfilled by the main transport carrier and end transport carrier respectively, with a fulfillment day of $t$, we have $x_{ijt}$ = 1.
For example, if the trajectory of a certain order is City A - City B - Site c, with a total fulfillment day of 4, then possible combinations for the fulfillment days of the main transport and end transport could be: 1 day for main transport and 3 days for end transport; 3 days for main transport and 1 day for end transport; or 2 days for both main and end transport.
The possible formulation is
$$\max \sum\limits_{i,j}{\sum\limits_{t}{a_{ijt}x_{ijt}}}$$ s.t. $$\sum\limits_{i,j}{\sum\limits_{t}{b_{ijt}x_{ijt}}} \geq M$$ $$\sum\limits_{t}{x_{ijt}} = 1 \;\;\;\; \forall i,j$$ $$\sum\limits_{t}{y_{it}} = 1 \;\;\;\; \forall i$$ $$\sum\limits_{t}{z_{jt}} = 1 \;\;\;\; \forall j$$
if $y_{it} = 1$ and $z_{jt'}=1$ then $x_{ij,t+t'}=1$.
We can use the variable $x$ to represent the overall accuracy, but how can we establish the relationship between variable $x$ and auxiliary variables $y$ and $z$?