نتایج جستجو برای: multi objective mixed integer linear programming
تعداد نتایج: 1867448 فیلتر نتایج به سال:
design of a logistics network in proper way provides a proper platform for efficient and effective supply chain management. this paper studies a multi-period, multi echelon and multi-product integrated forward-reverse logistics network under uncertainty. first, an efficient complex mixed-integer linear programming (milp) model by considering some real-world assumptions is developed for the inte...
In the present paper a bi-objective integer linear programming problem (BILP) is discussed. The main effort in this work to effectively implement ?-constraint method produce complete set of non dominated points. convergence algorithm has been established theoretically. Further comparative study some existing also made.
Computing the exact ideal and nadir criterion values is a very important subject in multi-objective linear programming (MOLP) problems. In fact, these values define the ideal and nadir points as lower and upper bounds on the nondominated points. Whereas determining the ideal point is an easy work, because it is equivalent to optimize a convex function (linear function) over a con...
In today’s competitive market place, companies seek an efficient structure of supply chain so as to provide customers with highest value and achieve competitive advantage. This requires a broader perspective than just the borders of an individual company during a supply chain. This paper investigates an aggregate production planning problem integrated with distribution issues in a supply chain ...
Health service management plays a crucial role in human life. Blood related operations are considered as one of the important components of the health services. This paper presents a bi-objective mixed integer linear programming model for dynamic location-allocation of blood facilities that integrates strategic and tactical decisions. Due to the epistemic uncertain nature of ...
In this paper, a general process is developed to find all non-dominated solutions of the multi objective combinatorial optimization (MOCO) problem. This process is based on the elastic constraints method and applies the identification of objective's bounds for it. Objectives bounds are determined by solving single objective integer programming problems. First the elastic constraints method is...
Selecting an MCDM method to use in any decision-making problem is always a difficult issue regarding that there no agreement generally on which the most appropriate one. This paper addressed proposal of hybrid approach for this problem. Under assumption superiority among well-established and accepted methods, we defined maximin strategy based fact lowest correlation between MCDMs proposed terms...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید