نتایج جستجو برای: deterministic programming
تعداد نتایج: 370359 فیلتر نتایج به سال:
Geometric programming is efficient tool for solving a variety of nonlinear optimizationproblems. Geometric programming is generalized for solving engineering design. However,Now Geometric programming is powerful tool for optimization problems where decisionvariables have exponential form.The geometric programming method has been applied with known parameters. However,the observed values of the ...
There are varieties of QFD combination forms available that can help management to choose the right model for his/her types of problem. The proposed MOCC-QFD-FMEA model is a right model to include variety of objectives as well as the risk factors into the model of the problem. Due to the fact that the model also takes into consideration the concept of Fuzzy set, it further allows management...
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...
In standard computation, non-determinism is used for specifying programs’ behaviour, without having to specify details of implementation. In quantum computation, non-determinism is either meant to be “classical” probabilism or it is not considered at all, since quantum computation is the physical theory of computation and thus it does not deal with non-implementable features. In this work we wi...
The terminal set M is a closed subset of Rn+1. The admissible control set U is assumed to be the set of piecewise continuous function on [t0, t1]. The performance function J is assumed to be C1. The function V (·, ·) is called the value function and we shall use the convention V (t0, x0) = ∞ if the control problem above admits no feasible solution. We will denote by U(x0, t0), the set of feasib...
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 programming is a valuable optimization tool where used when some or all of the design parameters of an optimization problem are defined by stochastic variables rather than by deterministic quantities. Depending on the nature of equations involved in the problem, a stochastic optimization problem is called a stochastic linear or nonlinear programming problem. In this paper,a stochasti...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید