Skip to main content
MathOverflow

Return to Answer

added 25 characters in body
Source Link
Robert Israel
Robert Israel
  • 54.2k
  • 1
  • 76
  • 152

Essentially this is an integer linear programming problem (e.g. for finding bounds on a variable, your objective could be to maximize or minimize that variable). Although it'sinteger linear programming is NP-complete, there is well-developed software for this which should be quite fast for a problem the size you mentioned. In SageMath you can use the MILP class.

Essentially this is an integer linear programming problem (e.g. for finding bounds on a variable, your objective could be to maximize or minimize that variable). Although it's NP-complete, there is well-developed software for this which should be quite fast for a problem the size you mentioned. In SageMath you can use the MILP class.

Essentially this is an integer linear programming problem (e.g. for finding bounds on a variable, your objective could be to maximize or minimize that variable). Although integer linear programming is NP-complete, there is well-developed software for this which should be quite fast for a problem the size you mentioned. In SageMath you can use the MILP class.

Source Link
Robert Israel
Robert Israel
  • 54.2k
  • 1
  • 76
  • 152

Essentially this is an integer linear programming problem (e.g. for finding bounds on a variable, your objective could be to maximize or minimize that variable). Although it's NP-complete, there is well-developed software for this which should be quite fast for a problem the size you mentioned. In SageMath you can use the MILP class.