Uniform reciprocal approximation subject to linear constraints
نویسندگان
چکیده
منابع مشابه
OPTIMIZATION OF LINEAR OBJECTIVE FUNCTION SUBJECT TO FUZZY RELATION INEQUALITIES CONSTRAINTS WITH MAX-AVERAGE COMPOSITION
In this paper, the finitely many constraints of a fuzzy relationinequalities problem are studied and the linear objective function on the regiondefined by a fuzzy max-average operator is optimized. A new simplificationtechnique which accelerates the resolution of the problem by removing thecomponents having no effect on the solution process is given together with analgorithm and a numerical exa...
متن کاملOptimization of linear objective function subject to Fuzzy relation inequalities constraints with max-product composition
In this paper, we study the finitely many constraints of the fuzzyrelation inequality problem and optimize the linear objectivefunction on the region defined by the fuzzy max-product operator.Simplification operations have been given to accelerate theresolution of the problem by removing the components having noeffect on the solution process. Also, an algorithm and somenumerical and applied exa...
متن کاملBayesian Inference for Linear Models Subject to Linear Inequality Constraints
The normal linear model, with sign or other linear inequality constraints on its coefficients, arises very commonly in many scientific applications. Given inequality constraints Bayesian inference is much simpler than classical inference, but standard Bayesian computational methods become impractical when the posterior probability of the inequality constraints (under a diffuse prior) is small. ...
متن کاملRelative $\alpha$-Entropy Minimizers Subject to Linear Statistical Constraints
We study minimization of a parametric family of relative entropies, termed relative α-entropies (denoted Iα(P,Q)). These arise as redundancies under mismatched compression when cumulants of compressed lengths are considered instead of expected compressed lengths. These parametric relative entropies are a generalization of the usual relative entropy (KullbackLeibler divergence). Just like relati...
متن کاملMaximizing submodular set functions subject to multiple linear constraints
The concept of submodularity plays a vital role in combinatorial optimization. In particular, many important optimization problems can be cast as submodular maximization problems, including maximum coverage, maximum facility location and max cut in directed/undirected graphs. In this paper we present the first known approximation algorithms for the problem of maximizing a nondecreasing submodul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1984
ISSN: 0021-9045
DOI: 10.1016/0021-9045(84)90097-2