This article examines a new approach which solves Linear Programming (LP) problems with stochastic parameters as a generalized model of the fuzzy mathematical model analyzed by Verdegay. An expectation model is provided for solving the problem. A multi-parametric programming is applied to access to a solution with different desired degrees as well as problem constraints. Additionally, we presen...

In this current study a generalized super-efficiency model is first proposed for ranking extreme efficient decision making units (DMUs) in stochastic data envelopment analysis (DEA) and then, a deterministic (crisp) equivalent form of the stochastic generalized super-efficiency model is presented. It is shown that this deterministic model can be converted to a quadratic programming model. So fa...

the control problem and dynamic programming is a powerful tool in economics and management. we review the dynamic programming problem from its beginning up to its present stages. a problem which was involved in physics and mathematics in i 7” century led to a branch of mathematics called calculus of variation which was used in economic, and management at the end of the first quarter of the 20” ...

Robust supplier selection problem, in a scenario-based approach has been proposed, when the demand and exchange rates are subject to uncertainties. First, a deterministic multi-objective mixed integer linear programming is developed; then, the robust counterpart of the proposed mixed integer linear programming is presented using the recent extension in robust optimization theory. We discuss dec...

in this current study a generalized super-efficiency model is first proposed for ranking extreme efficient decision making units (dmus) in stochastic data envelopment analysis (dea) and then, a deterministic (crisp) equivalent form of the stochastic generalized super-efficiency model is presented. it is shown that this deterministic model can be converted to a quadratic programming model. so fa...

Stochastic integer programming problems combine the difficulty of stochastic programming with integer programming. In this article, we briefly review some of the challenges in solving two-stage stochastic integer programming problems, and discuss the research progress towards these challenges.

To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision variables (which we can set) and stochastic variables (which follow a probability distribution). They combine together the best features of traditional constraint satisfaction, stochastic integer programming, and sto...

Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by  many researchers. Considering the quantity discount in  purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In  this paper, stochastic dyn...