Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Bookmarks inbookmarks:mine
inbookmarks:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results found
Search options user 71
8
votes
1answer
Value iteration is one of the most commonly used methods to solve Markov decision processes. Its convergence rate obviously depends on the number of states and actions. However, the convergence rate a …
asked May 30 '19 by Michiel uit het Broek
12
votes
1answer
Which sources are out there that provide reliable and fast MDP solvers? I prefer that the library is callable from C++ but other languages are fine too. There is indeed an abundance of repositories …
asked May 31 '19 by Michiel uit het Broek
10
votes
2answers
What are the advantages of using the generic callback compared to the old user/lazy callbacks within a branch-and-cut framework? IBM states on its website that the major benefit of the new generic ca …
asked May 31 '19 by Michiel uit het Broek
4
votes
In my experience it is helpful to add the smallest sub tour constraints directly into the model formulation. You should play a bit with the exact size but I commonly add subtour constraints up to 4 cu …
answered Jun 2 '19 by Michiel uit het Broek
12
votes
2answers
A while ago I used Gurobi and I added user cuts from within a callback. However, I got the feeling that my user cuts were not directly added to the model. Is it right that Gurobi can decide to postpon …
asked May 30 '19 by Michiel uit het Broek
14
votes
5answers
Suppose we have two variables $x, y \in \mathbb R$. How can we linearize the product $xy$? If this cannot be done exactly, is there a way to get an approximate result?
asked Jun 3 '19 by Michiel uit het Broek
9
votes
As far as I know, there is no true way to linearize such constraints, as also stated in the answer given by Michael Trick. Let us therefore consider a piecewise linear approximation of the constraint …
answered Jun 3 '19 by Michiel uit het Broek
14
votes
1answer
Suppose we have three variables, $x, y, z \in \mathbb R$. How can we linearize constraints with the following structure? $$z \geq \min(x, y)$$ $$z \leq \max(x, y)$$
asked Jun 1 '19 by Michiel uit het Broek
32
votes
2answers
Suppose we have two binary variables $x$ and $y$. How can we linearize the product $xy$?
asked May 31 '19 by Michiel uit het Broek
47
votes
This scenario can be linearized by introducing a new binary variable $z$ which represents the value of $x y$. Notice that the product of $x$ and $y$ can only be non-zero if both of them equal one, thu …
answered May 31 '19 by Michiel uit het Broek
31
votes
1answer
Suppose we have a binary variable $x$ and a non-negative continuous variable $y$. How can we linearize the product $x y$?
asked May 31 '19 by Michiel uit het Broek
32
votes
Suppose we can give a finite upper bound for $y$ called $M$. Then this constraint can easily be linearized by using the so-called big $M$ method. We introduce a new variable $z$ that should take the s …
answered May 31 '19 by Michiel uit het Broek