Results 31 to 40 of about 709,020 (315)
Mathematics, 2023 Two methods for multistage adaptive robust binary optimization are investigated in this work. These methods referred to as binary decision rule and finite adaptability inherently share similarities in dividing the uncertainty set into subsets.
Farough Motamed Nasab, Zukui Li
doaj +1 more source
On Meritocracy in Optimal Set Selection
Equity and Access in Algorithms, Mechanisms, and Optimization, 2022 Typically, merit is defined with respect to some intrinsic measure of worth. We instead consider a setting where an individual's worth is \emph{relative}: when a Decision Maker (DM) selects a set of individuals from a population to maximise expected utility, it is natural to consider the \emph{Expected Marginal Contribution} (EMC) of each person to the
Thomas Kleine Buening +4 more
openaire +3 more sources
Higher-order optimality conditions for set-valued optimization [PDF]
, 2008 This paper deals with higher-order optimality conditions of set-valued optimization problems. By virtue of the higher-order derivatives introduced in (Aubin and Frankowska, Set-Valued Analysis, Birkhäuser, Boston, [1990]) higher-order necessary and ...
Li, S. +5 more
core +1 more source
A fully coupled level set-based topology optimization of flexible components in multibody systems
, 2023 A fully coupled level set-based topology optimization of flexible components in multibody systems is considered. Thereby, using the floating frame of reference approach, the flexible components are efficiently modeled and incorporated in multibody ...
Azari Nejat, Ali +2 more
core +1 more source
On Kemeny Optimization Scheme for Fuzzy Set of Relations
Axioms, 2023 The present paper investigated the aggregation of individual preferences into a group fuzzy preference relation for a fuzzy set of decision-makers (DMs). This aggregation is based on the Kemeny optimization scheme.
Serhii O. Mashchenko +2 more
doaj +1 more source
Optimization problems for set functions
International Journal of Mathematics and Mathematical Sciences, 2001 This paper gives the formal definition of a class of optimization problems, that is, problems of finding conditional extrema of given set-measurable functions. It also formulates the generalization of Lyapunov convexity theorem which is used in the proof
Slawomir Dorosiewicz
doaj +1 more source
On the reduced-set pareto-lipschitzian optimization
Computational Science and Techniques, 2013 A well-known example of global optimization that provides solutions within fixed error limits is optimization of functions with a known Lipschitz constant. In many real-life problems this constant is unknown.
Jonas Mockus, Remigijus Paulavičius
doaj +1 more source
A hybrid multiagent approach for global trajectory optimization [PDF]
, 2008 In this paper we consider a global optimization method for space trajectory design problems. The method, which actually aims at finding not only the global minimizer but a whole set of low-lying local minimizers(corresponding to a set of different design
Vasile, M. +4 more
core +1 more source
Necessary and Sufficient Conditions for Set-Valued Maps with Set Optimization
Abstract and Applied Analysis, 2018 Optimality conditions are studied for set-valued maps with set optimization. Necessary conditions are given in terms of S-derivative and contingent derivative.
Abdessamad Oussarhan, Ikram Daidai
doaj +1 more source
Parameterization of multi-decisive hypersoft set under fuzzy environment with application in multi-attribute decision making [PDF]
Yugoslav Journal of Operations ResearchFuzzy parameterized hypersoft expert set (FPHSE-set) is the generalisation of fuzzy parameterized soft expert set (FPSE-set). The FPHSE-set overcomes the shortcomings of FPSE-set for the examination of multi-argument approximate function.
Ihsan Muhammad
doaj +1 more source