نتایج جستجو برای: multi objective programming mop
تعداد نتایج: 1270176 فیلتر نتایج به سال:
Data envelopment analysis (DEA) is a common technique in measuring the relative efficiency of a set of decision making units (DMUs) with multiple inputs and multiple outputs. Standard DEA models are quite limited models, in the sense that they do not consider a DMU at different times. To resolve this problem, DEA models with dynamic structures have been proposed.In a recent pape...
This paper deals with multi- objective nonlinear programming problem having rough intervals in the constraints. The problem is approached by taking maximum value range and minimum value range inequalities as constraints conditions, reduces it into two classical multi-objective nonlinear programming problems, called lower and upper approximation problems. All of the lower and upper approximatio...
A Geometric programming (GP) is a type of mathematical problem characterized by objective and constraint functions that have a special form. Many methods have been developed to solve large scale engineering design GP problems. In this paper GP technique has been used to solve multi-objective GP problem as a vector optimization problem. The duality theory for lexicographic geometric programming ...
Visual analytics is a human-machine collaboration to data modeling where extraction of the most informative features plays an important role. Although feature extraction is a multi-objective task, the traditional algorithms either only consider one objective or aggregate the objectives into one scalar criterion to optimize. In this paper, we propose a Pareto-based multi-objective approach to fe...
Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy them independently, but difficult to satisfy them simultaneously. Therefore, the standard propagation methods fail. In this paper we propose a novel approach inspired in multi-objective optimization. We compute a mul...
Based on Game Theory and Multi-objective optimization problems (MOP), Game Optimization Theory (GOT) is discussed in this paper. Optimization Stability Analysis (OSA), Distance Entropy Multi-Objective Particle Swarm Optimization (DEMPSO) and Fuzzy Multi-weights Decision-making Method (FMW) are proposed as well. Game Optimization Theory, which is a comprehensive system, could not only handle mul...
This paper studies a bandwidth-limited federated learning (FL) system where the access point is central server for aggregation and energy-constrained user equipemnts (UEs) with limited computation capabilities (e.g., Internet of Things devices) perform local training. Limited by bandwidth in wireless edge systems, only part UEs can participate each FL training round. Selecting different could a...
Fairness has been considered as a critical problem in federated learning (FL). In this work, we analyze two direct causes of unfairness FL - an unfair direction and improper step size when updating the model. To solve these issues, introduce effective way to measure fairness model through cosine similarity, then propose multiple gradient descent algorithm with fair guidance (FedMDFG) drive fair...
this paper uses the weighted l$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. when all variables are integer it finds the whole set of efficient solutions. in each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید