TITLE: Linear programming simplex - can I have a constraint with a multiplication?
QUESTION [4 upvotes]: 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.

REPLY [5 votes]: It's non linear. It looks like separation of variables via substitution may work, introducing additional constraints, see p$15$ of: http://web.mit.edu/15.053/www/AMP-Chapter-13.pdf
{"set_name": "stack_exchange", "score": 4, "question_id": 465999}