Decomposition has proved to be one of the more effective tools for the solution of large-scale problems, especially those arising in stochastic programming. A decomposition method with wide applicability is Benders’ decomposition, and has been applied to both stochastic programming, as well as integer programming problems. However, this method of decomposition relies on convexity of the value f...

objectives: to implement goal-directed subsidies policy in framework of the its law is being seriously followed by state. implementing this policy as it has been defined in the law could be a deep surgery of economy with big negative consequences both in demand and supply sides if its theoretical foundation is wrong. hence, this paper aims to evaluate the theoretical sufficiency of neoclassical...

in this paper, we introduce a satisfaction function (sf) to compare interval values on the basis oftseng and klein’s idea. the sf estimates the degree to which arithmetic comparisons between two intervalvalues are satisfied. then, we define two other functions called lower and upper sf based on the sf. weapply these functions in order to present a new interpretation of inequality constraints wi...