نتایج جستجو برای: single objective integer linear programming
تعداد نتایج: 2074296 فیلتر نتایج به سال:
In this paper we study the bilevel linear programming problem with multiple objective functions at the upper level, with particular focus on the bi-objective case. We examine some properties of this problem and propose a methodological approach based on the reformulation of the problem as a multiobjective mixed 0-1 linear programming problem. The basic idea consists in applying a reference poin...
in recent years, supplier evaluation and selection, an important element in supply chain management, has been gaining attention in both academic literature and industrial practice. the mixed integer multi-objective non-linear programming model (mimonlp) presented in this paper aimed to evaluate and select the appropriate set of suppliers considering quantitative and qualitative criteria and in ...
We present a genetic algorithm for the design of survivable networks with minimum capital expenditure. The survivability against any single link failure is ensured by path dedicated protection. An integer linear programming model to evaluate the quality of the genetic algorithm solutions is also presented. Using the integer linear programming model and the genetic algorithm near-optimal topolog...
In this paper, we propose a new model for designing integrated forward/reverse logistics based on pricing policy in direct and indirect sales channel. The proposed model includes producers, disposal center, distributers and final customers. We assumed that the location of final customers is fixed. First, a deterministic mixed integer linear programming model is developed for integrated logistic...
This work addresses the topic of constrained dynamic programming for problems involving multi-stage mixed-integer linear formulations with a linear objective function. It is shown that such problems may be decomposed into a series of multi-parametric mixed-integer linear problems, of lower dimensionality, that are sequentially solved to obtain the globally optimal solution of the original probl...
In this paper we develop an algorithm to optimise a nonlinear utility function of multiple objectives over the integer efficient set. Our approach is based on identifying and updating bounds on the individual objectives as well as the optimal utility value. This is done using already known solutions, linear programming relaxations, utility function inversion, and integer programming. We develop...
This paper proposes a compromise model, based on the technique for order preference through similarity ideal solution (TOPSIS) methodology, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. This compromise programming method is ba...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید