Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  address a class of problems where decisions have to be optimized over a time horizon given that the future is uncertain and that the optimization decisions influence the time of information discovery for a subset of the uncertain parameters. The standard approach to formulate stochastic programs is based on the assumption that the stochastic process is independent of the optimization decisions, which is not true for the class of problems under consideration.  present a hybrid mixed-integer disjunctive programming formulation for the stochastic program corresponding to this class of problems and hence extend the stochastic programming framework. A set of theoretical properties that lead to reduction in the size of the model is identified. A Lagrangean duality based branch and bound algorithm is also presented.
['Vikas Goel', 'Ignacio E. Grossmann']
I am writing a research paper on a idea A Class of stochastic programs with decision dependent uncertainty
[{"from": "human", "value": "I am writing a research paper on a idea A Class of stochastic programs with decision dependent uncertainty"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  address a class of problems where decisions have to be optimized over a time horizon given that the future is uncertain and that the optimization decisions influence the time of information discovery for a subset of the uncertain parameters. The standard approach to formulate stochastic programs is based on the assumption that the stochastic process is independent of the optimization decisions, which is not true for the class of problems under consideration.  present a hybrid mixed-integer disjunctive programming formulation for the stochastic program corresponding to this class of problems and hence extend the stochastic programming framework. A set of theoretical properties that lead to reduction in the size of the model is identified. A Lagrangean duality based branch and bound algorithm is also presented."}]