You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I'm proposing to add integer programming to gonum.
How does Gonum not allow you to achieve your goal?
Integer programming is a specific variant of linear programming in which some or all variables are constrained to be whole integer numbers.
Currently the gonum/optimize/convex/lp package only features a Simplex function, which is only able to optimize for real numbered variables.
It is missing an integer programming optimizer, and these are complex enough to not expect a user of the library to implement for themselves. Thus I'm requesting to add such functionality to the library itself.
Is this feature absent from the current master?
Yes
Are you able to help contribute the feature?
I'd be willing to try & implement some parts of it.
The text was updated successfully, but these errors were encountered:
I've implemented a basic branch & bound algorithm in my own project I'm working on I could add to the library if it's accepted, it might not be the most efficient solution but it's better than nothing.
I'm proposing to add integer programming to gonum.
How does Gonum not allow you to achieve your goal?
Integer programming is a specific variant of linear programming in which some or all variables are constrained to be whole integer numbers.
Currently the
gonum/optimize/convex/lp
package only features aSimplex
function, which is only able to optimize for real numbered variables.It is missing an integer programming optimizer, and these are complex enough to not expect a user of the library to implement for themselves. Thus I'm requesting to add such functionality to the library itself.
Is this feature absent from the current master?
Yes
Are you able to help contribute the feature?
I'd be willing to try & implement some parts of it.
The text was updated successfully, but these errors were encountered: