method of solving linear programming problems, extending the simplex algorithm to problems with greater-than constraints by associating the constraints with large negative constants
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).