Timeline for How do you call a linear programming problem when the solution should be "constrained" to a norm?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 11, 2021 at 6:39 | comment | added | Tal Galili | @MarkL.Stone - I think I'll go hide under my blanket now. How embarrassing :D (Thanks <3 ) | |
| Jun 11, 2021 at 0:40 | comment | added | Mark L. Stone | @Tal Galili $Ca \ge d$ can be rewritten as $-Ca \le -d$ | |
| Jun 10, 2021 at 17:10 | comment | added | Tal Galili | I just don't see how the software allows for larger-equal sign. Oh well, I'll see what I can do... | |
| Jun 10, 2021 at 13:23 | comment | added | gerw | $Ca = d$ is equivalent to "$C a \le d$ and $Ca \ge d$". | |
| Jun 10, 2021 at 11:34 | comment | added | Tal Galili | Thanks. Any pointers for how to do this? When I look at wikipedia and software implementations they seem to require " A^T b >= b0". How then do I create a constraint that does "Ca = d"? | |
| Jun 10, 2021 at 11:27 | vote | accept | Tal Galili | ||
| Jun 10, 2021 at 11:25 | comment | added | gerw | Yes, you encode these conditions via a linear system of equations. | |
| Jun 10, 2021 at 9:31 | comment | added | Tal Galili | I'm fine that a could be 0. Thanks for the response. So Ca=d is the equations I wrote above? | |
| Jun 10, 2021 at 7:55 | history | answered | gerw | CC BY-SA 4.0 |