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 constraint
Search options not deleted
user 459
For questions related to constraints, i.e. any restriction or relation a set of decision variables has to satisfy.
0
votes
1
answer
81
views
Maximization problem with preferences on variables
In other words, I would maximize the objective function under a "preference constraint" on variables. Is it possible to express such a constraint as a MIP/MILP? …
- 937
6
votes
Index of element in MILP vector decision variable that equals 1
Assuming your index goes from 0 to $n$ you can do $k = \sum_{i = 0}^{n}i \cdot p_i$ where $k$ is the desired index.
- 937
9
votes
1
answer
252
views
Static stochastic knapsack problem: unbounded version
Or, in terms of a chance constraint program:
$$ Pr\left(\sum_{i \in I} \tilde{w}_{i} \cdot x_i \le C\right) \ge 1-\alpha $$
where $\tilde{w}_{i}$ are random variables. … with a MIP formulation (not necessarily for the chance constraint)? …
- 937