the hub location decision is a long term investment and any changes in it take considerable time and money. in real situations, some parameters are uncertain hence, deterministic models cannot be more efficient. the ability of two-stage stochastic programming is to make a long-term decision by considering effects of it in short term decisions simultaneously. in the two-stage stochastic programm...

this paper uses integrated data envelopment analysis (dea) models to rank all extreme and non-extreme efficient decision making units (dmus) and then applies integrated dea ranking method as a criterion to modify genetic algorithm (ga) for finding pareto optimal solutions of a multi objective programming (mop) problem. the researchers have used ranking method as a shortcut way to modify ga to d...

This paper deals with multi- objective nonlinear programming problem having rough intervals in the constraints. The problem is approached by taking maximum value range and minimum value range inequalities as constraints conditions, reduces it into two classical multi-objective nonlinear programming problems, called lower and upper approximation problems.  All of the lower and upper approximatio...

this study develops a long run optimal pattern for nomadic ranchers of fars province under climate uncertainty by simulating dynamic process of livestock and forage productivity as well as employing dynamic stochastic programming. results indicate that the nomadic representatives do not perform, optimally. despite their attachments to livestock as an asset, and their life dependency on livestoc...

Abstract In this paper we have investigated a fuzzy linear programming problem with fuzzy quantities which are LR triangular fuzzy numbers. The given linear programming problem is rearranged according to the satisfactory level of constraints using breaking point method. By considering the constraints, the arranged problem has been investigated for all optimal solutions connected with satisf...

bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. bilevel programming has been proved to be an np-hard problem. numerous algorithms have been developed for solving bilevel programming problems. these algorithms lack the required efficiency for solving a real problem. ...