Results 101 to 110 of about 153,582,606 (300)
CHOOSING OPTIMAL STRATEGIES OF UNIVERSITY DEVELOPMENT USING THE PARETO SET [PDF]
, 2018 Growth of university in world university rankings can be presented as a multi-objective problem. According to Edgeworth-Pareto principle, the best solution to this problem should be found in Pareto set, which consists of optimal nondominated vectors ...
Rogovich, V. I. +3 more
core
PRINCIPII DE ECHILIBRU PARETO-NASH-STACKELBERG
Studia Universitatis Moldaviae: Stiinte Umanistice, 2010 We consider the problem of determining the set of Pareto-Nash-Stackelberg equilibria in strategic games. The main results are formulated and explained. A procedure for the equilibrium set determining is presented.
USM ADMIN
doaj
MATEC Web of Conferences, 2016 Optimal design problems normally involve high dimensional design spaces and multiple objective functions. Depending on the complexity of the model, the time required to explore the design space could become excessive. This paper describes the calculation
Panesso Miguel A. +5 more
doaj +1 more source
AIChE Journal, EarlyView.ABSTRACT Conceptual process design combines discrete configuration choices with continuous operating decisions, often yielding difficult mixed‐integer nonlinear or simulation‐based optimization problems. This work presents an exploratory computational assessment of Ising‐based solvers, simulated annealing, quantum annealing, and entropy computing, as ...
Yirang Park, David E. Bernal Neira
wiley +1 more source
Characterization of Pareto Dominance [PDF]
The Pareto dominance relation is shown to be the unique nontrivial partial order on the set of finite-dimensional real vectors satisfying a number of intuitive properties.Pareto dominance ...
Voorneveld, Mark
core
Pareto set for the USPS dataset.
The Pareto set is composed of 17 elements selected from 106 candidate solutions.
Hatem A. Khater (18297656) +2 more
core +1 more source
Construction of Generating Feasible Subsets in the Knapsack Problem
Доклады Белорусского государственного университета информатики и радиоэлектроникиA method for constructing a group of generating feasible subsets in the knapsack problem under the condition that the non-dominance depth of a given Pareto layer is greater than zero is developed.
S. V. Chebakov, L. V. Serebryanaya
doaj +1 more source
Machine learning driven many‐objective moving horizon scheduling optimization
AIChE Journal, EarlyView.Abstract Industrial electrification can decarbonize chemical manufacturing, but it exposes operations to volatile electricity prices and carbon intensities. This work develops a machine learning‐enhanced many‐objective moving horizon scheduling framework that predicts objective correlation groupings from 48‐hour price and emission‐intensity profiles ...
Hongxuan Wang, Andrew Allman
wiley +1 more source
Hierarchical stratification of Pareto sets
, 2014 In smooth and convex multiobjective optimization problems the set of Pareto optima is diffeomorphic to an $m-1$ dimensional simplex, where $m$ is the number of objective functions. The vertices of the simplex are the optima of the individual functions and the $(k-1)$-dimensional facets are the Pareto optimal set of $k$ functions subproblems.
Lovison, A, Pecci, F
openaire +3 more sources
AIChE Journal, EarlyView.Abstract Despite the growing use of ML in chemical engineering, the catalytic conversion of sulfur dioxide (SO2) to sulfur trioxide (SO3) remains underexplored from a data‐driven modeling perspective. This study evaluates an integrated workflow for literature‐derived SO2 oxidation data, combining data curation, preprocessing assessment, machine ...
Farough Agin +2 more
wiley +1 more source