Timeline for Maximizing linear objective function with absolute values
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 21, 2014 at 6:25 | vote | accept | joro | ||
| Feb 12, 2014 at 12:27 | answer | added | Noah Stein | timeline score: 4 | |
| Feb 12, 2014 at 12:12 | comment | added | martin | What do the constraints look like? If you have a typical polyhedral feasible region, then maximizing the sum of absolute values is in general nonconvex, hence not a linear program (which are convex). | |
| Feb 12, 2014 at 10:13 | history | asked | joro | CC BY-SA 3.0 |