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 nonlinear-optimization
Search options not deleted
user 120143
Nonlinear objectives, nonlinear constraints, non-convex objective, non-convex feasible region.
3
votes
Accepted
Linear optimization with one positive definite quadratic equality condition in P?
The following conditions
$$
\begin{array}{l}
y=\sum x_i^2\\
0\leq x_i\leq 1\\
y=\sum x_i
\end{array}
$$
are equivalent to $x_i\in \{0,1\}$, which means your construction allows you to introduce bina …
- 411
1
vote
Formulating a problem as a mixed-integer conic program
The only option I see is to exploit the fact that $x$ is binary, so in each step of each product you are either multiplying $1$ or $b_i$ on top of what you already had.
If $s,t$ are continuous variabl …
- 411