Timeline for Parametric constrained optimization
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 7, 2017 at 19:10 | comment | added | Bill Watts | I assumed they were, but it doesn't change the answer. I added your assumptions for b, g, and l and they didn't change anything either. | |
| Dec 7, 2017 at 12:20 | comment | added | Paolo Marzani | b ang g are probabilities, so 0<=b<=1 and same for g. I know also that g>b. l is another parameter...I only know that l>0. The solution has to be x2=x3=0 and x1=(1-b)(1-g)l. The reason is that (copy and paste from the article): "The problem is one of linear programming. Hence, the solution lies on a vertex of the restricted domain of the program. It can be shown that the restrictions pg>=0,pgs>=0 and ps-pg>=b(1-g)pgs+(1-b)(pgs+(1-g)l) must be binding at the optimum." thank you for helping me, best regards PS: why did you put in the constraint that x1,x2,x3<1? | |
| Dec 6, 2017 at 1:47 | history | answered | Bill Watts | CC BY-SA 3.0 |