نتایج جستجو برای: Multi-Objective Programming Problem
تعداد نتایج: 1972522 فیلتر نتایج به سال:
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
multi objective quadratic fractional programming (moqfp) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the object...
In practice, there are many problems which decision parameters are fuzzy numbers, and some kind of this problems are formulated as either possibilitic programming or multi-objective programming methods. In this paper, we consider a multi-objective programming problem with fuzzy data in constraints and introduce a new approach for solving these problems base on a combination of the multi-objecti...
delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. in this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several produ...
data envelopment analysis (dea) is a method to evaluate the relative efficiency of decision making units (dmus). in this method, the issue has always been to determine a set of weights for each dmu which often caused many problems. since the dea models also have the multi-objective linear programming (molp) problems nature, a rational relationship can be established between molp and dea problem...
a modified method to determine a well-dispersed subset of non-dominated vectors of an momilp problem
this paper uses the l1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (wdsnd) vectorsof a multi-objective mixed integer linear programming (momilp) problem.the proposed method generalizes the proposed approach by tohidi and razavyan[tohidi g., s. razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...
a theorem was recently introduced to establish a relationship betweengoal programming and fuzzy programming for vectormaximum problems.in this short note it is shown that the relationship does not exist underall circumstances. the necessary correction is proposed.
In this paper, a Multi-Choice Stochastic Bi-Level Programming Problem (MCSBLPP) is considered where all the parameters of constraints are followed by normal distribution. The cost coefficients of the objective functions are multi-choice types. At first, all the probabilistic constraints are transformed into deterministic constraints using stochastic programming approach. Further, a general tran...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید