"Again, significantly outperforms LP." No, this is mathematically impossible. You cannot out-optimize a mathematical global optimization solver. Whether that i

"Again, significantly outperforms LP." No, this is mathematically impossible. You cannot out-optimize a mathematical global optimization solver. Whether that is LP, MILP, or NLP. Exactly because they provide a certificate of optimality. It is like stating that you found a non-negative number that is smaller than 0. It’s not progressive. It’s flat out wrong. "But there are lots of situations that LP can't optimize while RL can" I will be satisfied if you just show us 1. Stay in your lane, and state that you built a fast heuristic that works (finds good solutions but not optimal) in the problems you tried. Nobody can dispute this. But don't make claims you cannot support.