Skip to main content
Computer Science

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

14
  • $\begingroup$ which linear programming solver can solve this? becouse in *.lp or *.mps-format one side of the constraint has to be an fixed integer and not an variable. $\endgroup$ Commented Mar 25, 2015 at 14:31
  • 4
    $\begingroup$ @boxi, I don't know anything about *.lp or *.mps format, but every integer linear programming solver should be able to solve this. Note that if you have something like $x \le y$, this is equivalent to $y -x \ge 0$, which may be in the format you wanted. $\endgroup$ Commented Mar 25, 2015 at 19:44
  • $\begingroup$ -i checked it again. lp_solve can solve it, but for example qsopt can't. i don't know why. but thanks <3 $\endgroup$ Commented Mar 25, 2015 at 19:46
  • 1
    $\begingroup$ @Pramod, good catch! Thank you for spotting that error. You're absolutely right. I've asked a new question about how to model that case and I'll update this answer when we get an answer to that one. $\endgroup$ Commented Dec 22, 2015 at 4:04
  • 1
    $\begingroup$ @InuyashaYagami, yes, absolutely, that is sufficient for boolean logic, and that would be fine. There might be some advantage to other translations if they introduce fewer temporary variables (for instance, in the case of logical implication), and we still need to know how to express conditional expressions or "cast to boolean", but you have an excellent point. $\endgroup$ Commented Dec 28, 2021 at 19:25