Timeline for An Optimization problem
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 26, 2012 at 21:24 | vote | accept | David Harris | ||
| Mar 25, 2012 at 15:30 | answer | added | fedja | timeline score: 9 | |
| Feb 11, 2012 at 20:58 | history | edited | David Harris | CC BY-SA 3.0 |
added 462 characters in body
|
| Feb 11, 2012 at 15:33 | history | edited | David Harris | CC BY-SA 3.0 |
Added important constraint $p < 1$
|
| Feb 11, 2012 at 12:58 | answer | added | noname | timeline score: 0 | |
| Feb 11, 2012 at 5:18 | comment | added | Gerhard Paseman | If p > 1, no. If p < 1, some of the inequalities reverse. (Recall x_i >= 1.) Gerhard "I Made That Mistake Too" Paseman, 2012.02.10 | |
| Feb 11, 2012 at 3:50 | comment | added | Gerhard Paseman | Assuming p < 1, my feeling is that optimal values occur near x_1=x_2=...=x_T=1, where T is floor(t). You might investigate that region first before relaxing the constraint on x_T. Gerhard "Ask Me About System Design" Paseman, 2012.02.10 | |
| Feb 11, 2012 at 3:46 | comment | added | Gerhard Paseman | I would like reassurance that p < 1 for the domain of interest. Gerhard "Ask Me About System Design" Paseman, 2012.02.10 | |
| Feb 11, 2012 at 2:04 | answer | added | Joseph O'Rourke | timeline score: 2 | |
| Feb 11, 2012 at 0:50 | history | edited | David Harris | CC BY-SA 3.0 |
added 268 characters in body
|
| Feb 11, 2012 at 0:02 | comment | added | Suvrit | I would begin by asking whether you really need to solve this particular formulation! Also, I guess you are choosing $n$ and $p$ so that a feasible solution exists? Because if $p$ is really small, then there might be no solution. | |
| Feb 10, 2012 at 22:28 | comment | added | Gerhard Paseman | Some might begin with the case n=2. Gerhard "I'd Set N To One" Paseman, 2012.02.10 | |
| Feb 10, 2012 at 21:14 | history | asked | David Harris | CC BY-SA 3.0 |