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 11654
For questions about mathematical optimization problems involving both continuous and binary or general integer variables.
0
votes
Free solver for MINP problems
You can check the NEOS Server which provides free solvers for mixed-integer nonlinear programming (MINLP) problems. You can use solvers like Bonmin or Couenne via their web-based platform.
- 106
1
vote
Removing min operator from max objective
A simple intuition would be that the second inequality is stronger ($\geq$) than the first one. Therefore, dropping the minimum would allow more flexibility, but I do not think they are equivalent.
- 106
2
votes
Accepted
Why is the convex hull of a integer linear program a polyhedron with same optimum?
You can apply the convex hull's definition to an optimal solution $ x^* $. It can be written as:
$$ x^* = \sum_{1 \leq k \leq m} \lambda_k x_k $$
such that $ \lambda_k \geq 0 $, $ \sum_{1 \leq k \leq …
- 106