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 answers only
not deleted
user 261831
Questions on linear programming, the optimization of a linear function subject to linear constraints.
2
votes
Is there a Python library that would solve a quadratic optimization problem?
This problem can be solved using a LP solver because it secretly is a linear program.
For fixed $x$, the minimum $\min_y F(x,y)$ is obtained when the gradient vanishes. Note that the gradient of $F(x, …
- 4,852
3
votes
Point in Polytope?
Assume the vertices that span the convex hull are $v_1,v_2,\dots,v_k\in\mathbb{R}^n$ with coordinates $$
v_i = (v_{i1},v_{i2},\dots,v_{in}).
$$
A point $p\in\mathbb{R}^n$ lies in the convex hull if an …
- 4,852