Search Results
| 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" |
| Saves | in:saves |
| 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 tagged with mixed-integer-programming
Search options not deleted
user 4030
For questions about mathematical optimization problems involving both continuous and binary or general integer variables.
4
votes
Accepted
Approximately evenly-spaced subsequence
I have never encountered a problem like this in literature, but here is one possible way of formulating the problem as a MIP. Notation:
$n$: length of the number series
$l$: desired length of the sub …
2
votes
Accepted
How to simplify the following constraints as I'm using MIP optimization solver in python?
Your question isn't entirely clear and isn't really an OR question, but I think what you are trying to do is the following:
for j in n:
for k in r:
o += xsum(w[k] *y[k][jj] for jj in n if …