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 linear-programming
Search options not deleted
user 996
Referring to optimization problems that consist only of linear constraints and a linear objective function.
6
votes
Accepted
Linear Programming with constraints of the form $Cx \nless d$ where $C\in R^{m\times n}$
The constraint $Cx \nless d$ is can be expressed as a mixed-integer program under certain conditions.
\begin{eqnarray}
C_i x - M_i y_i &\ge& d_i \hspace{0.3 in} \forall i \in I \\
\sum_{i \in I} y …
- 233
3
votes
Accepted
Is it possible to represent non-linear ranking type constraints as equivalent linear constra...
There are several ways to convert your model to linear constraints. For example
\begin{eqnarray}
z^1_{ij}(a) + z^2_{ij}(a) &=& z_i(a) \ \ \forall i,j,a \\
z^1_{ij}(a) &\le& 1- \sum_{b \ge a} z_j(b) …
- 233