I had a linear programming problem where I am optimizing some function
$$f(x) = \sum_{j}x_jq_jp_j - \sum_{i}\left(\sum_{j}x_jq_jC_{ij} \right) c_i$$
Where $q, p, C, c$ are known.
I now want to extend this problem to something where my $p$ vector depends on the $x$ vector.
That is, I want to change the value of $p_j$ depending on the $x_j$ and original $p_j$. In particular, I want to do it in the following way. Let's take the example where:
$x = [1,0,1]^T$ and $p=[30,20,50]^T$
In this case, I would like my vector $p$ to be altered using the following rule: redistribute the % lost in $p$ following the multiplication with $x$ over all other $p$. So in this case, because the second element of $x$ is 0, I want to redistribute the 20/100 lost over the other $p$, such that $p_{new} = [36,0,60]$ (the other elements became 20% higher)
I am not sure how to incorporate this logic into my linear programming problem.