نتایج جستجو برای: linear multi objective programming
تعداد نتایج: 1666458 فیلتر نتایج به سال:
we present a new model and a new approach for solving fuzzylinear programming (flp) problems with various utilities for the satisfactionof the fuzzy constraints. the model, constructed as a multi-objective linearprogramming problem, provides flexibility for the decision maker (dm), andallows for the assignment of distinct weights to the constraints and the objectivefunction. the desired solutio...
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...
this paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. for solving this multi-objective model, we develop a fuzzy multi-objective linear programming (fmolp) model. in this problem, a proposed fmolp method is applied with respect to the o...
classical deterministic inventory models consider the demand rate to be either constant or time-dependent but independent from the stock status. however, for a certain type of inventory, the demand rate may be in-fluenced by the stock level. also in many real-life problems, some products such as fruits, vegetables, phar-maceuticals and volatile liquids continuously deteriorate to evaporation, o...
in this paper, the researchers present a multi-objective linear fractional inventory model using fuzzy pro-gramming. the proposed method in this paper is applied to a problem with two objective functions. the re-sulted fuzzy model is transformed into an ordinary linear programming. the implementation of the develop-ing model presented in this paper is demonstrated through the use of some numeri...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید