Timeline for Finding the maximum of a multivariate polynomial of degree one
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 10, 2014 at 13:37 | vote | accept | CommunityBot | ||
| Feb 9, 2014 at 15:15 | comment | added | user24451 | Also, when the feasibility set is small enough, I do the stiching by minimization. | |
| Feb 9, 2014 at 15:13 | comment | added | user24451 | This is smart, especially the stiching by minimizing the cost. I hesitate on the 'best' implementation of your solution, because, when $n$ grows, the slice $S_1$ grows too: $x_{11}=x_{12}=\ldots=x_{1,20}$. Anyway, your approach shows that I can do a progressive branch-and-bound to solve the problem. First, I prune with all variables independent, then I prune with the smallest slice, then the next smallest slice, and so on. Thank you. | |
| Feb 9, 2014 at 2:17 | history | answered | The Masked Avenger | CC BY-SA 3.0 |