I'm not sure of this, can I have a constraint like this in a linear programming problem to be solved with simplex algorithm?
$$n_1t_1 + n_2t_2 > 200$$
where $n_1$ and $t_1$, $n_2$ and $t_2$ are different variables.
linear programmingoptimization
I'm not sure of this, can I have a constraint like this in a linear programming problem to be solved with simplex algorithm?
$$n_1t_1 + n_2t_2 > 200$$
where $n_1$ and $t_1$, $n_2$ and $t_2$ are different variables.
Best Answer
it's non linear. it looks like separation of variables via substitution may work, introducing additional constraints, see p15 of:
[1]http://web.mit.edu/15.053/www/AMP-Chapter-13.pdf