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 questions only
not deleted
user 58450
1
vote
2
answers
106
views
How to convert minimize $\| Ax - b \|_\infty$ to an equivalent linear program step by step?
Given this question:
$$\text{minimize } \| Ax - b \|_\infty$$
Then this question is equivalent to
$\text{minimize } \max |Ax - b|$ = $\text{minimize } \max\limits_i |a_i^Tx - b_i|$
Let $t = |a_i …
- 1,630
1
vote
1
answer
5k
views
How to use MATLAB's Linprog to solve LP model of L1 regression
A L1 regression problem is given as:
$\min\limits_{a,b} \sum\limits_{i=1}^n |y_i - ax_i - b|$
It has an equivalent LP model:
$\min \sum\limits_{i = 1}^n z_i$
$|y_i - ax_i - b| \leq z_i$
where $z_ …
- 1,630