Timeline for Solving a discrete optimization problem
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12, 2017 at 22:09 | comment | added | klaus | But what are these functions like? It might be possible to convert it to linear form. If not, you can follow this path: Linear Programming -- (if not linear) --> Quadratic/Convex Optimization --(if not quadratic/convex) --> Non-linear optimization | |
| Oct 12, 2017 at 22:02 | comment | added | klaus | I appologize. When I read non-decresing I tought immediately in a linear function. | |
| Oct 11, 2017 at 21:41 | comment | added | D.W.♦ | I fail to see why this is a version of ILP, if the functions $f_i,g_j$ aren't linear. | |
| Oct 11, 2017 at 17:05 | review | First posts | |||
| Oct 11, 2017 at 17:18 | |||||
| Oct 11, 2017 at 17:00 | history | answered | klaus | CC BY-SA 3.0 |