so i'm looking at linear programming solvers and i'm wondering if out there, there is not a solver per se, but something that will generate static code for a particular problem
Conversation
idea being instead of having the lp library as a dependency, you just "bake" a single instance and ship that instead
Replying to
How would you do that? LPs don’t have closed-form solutions, only algorithms (simplex, interior point). All you can do is cast the problem into the canonical form and call the solver.
1
1
Replying to
currying is like, supplying a parameter to an n-ary function to make it an n-minus-1-ary function
so would it not be possible to supply the objective and constraints to a function that returned a function (or rather code for the function)
3
Replying to
Like parametrize your set of LPs to exploit structure in your problem space or something?
1
Replying to
i'm thinking scenarios where the objectives/constraints are always gonna be the same thing
Replying to
Ah… some potential there for caching a bunch of parametrized solutions into an interpolation. Your currying strategy doesn’t seem likely (it would be a major discovery if LPs could be decomposed that way)
In a way LPs are too simple for much trickery…

