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 2513
For questions about mathematical optimization problems involving both continuous and binary or general integer variables.
3
votes
Is using gradient descent for MIP a good idea?
In general, no, as Gradient Descent (G)D is designed primarily for unconstrained continuous problems. However, you might get somewhere if you formulate your problem such that the constraints and integ …
- 725
8
votes
4
answers
848
views
Modeling the Round (Nearest Integer) function
Modeling various non-differentiable functions is quite common knowledge including $\operatorname{abs}$, $\min$ and $\max$ functions. How would one go about modeling the nearest integer function, say i …
- 725
11
votes
3
answers
870
views
Modeling the Choose function
In statistics, one often encounters the choose function ${x \choose y}$ which encodes the number of ways of choosing $y$ items from a set of $x$ items. How would one go about modeling a choose equalit …
- 725