scientific article; zbMATH DE number 3078986
From MaRDI portal
zbMath0050.14203MaRDI QIDQ5817859
Edward W. Barankin, Kenneth J. Arrow, David Blackwell
Publication date: 1953
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Density and connectedness of optimal points with respect to improvement sets, On differentiability of cost functions, Weighting factor results in vector optimization, A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions, Generalized Arrow-Barankin-Blackwell theorems in locally convex spaces, An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization, Lexicographical order and duality in multiobjective programming, Congestion in production correspondences, [https://portal.mardi4nfdi.de/wiki/Publication:5603680 Bayesl�sungen bei mehrstufigen Tests], Solution concepts in two-person multicriteria games, Multicriteria approach to bilevel optimization, Generalization of the Arrow-Barankin-Blackwell theorem in a dual space setting, H∞ Constraint Pareto Optimal Strategy for Stochastic LPV Systems, On the density of positive proper efficient points in a normed space, The domination property for efficiency in locally convex spaces, Generalizations of a theorem of Arrow, Barankin, and Blackwell in topological vector spaces, Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization, Stability in multicriteria optimization, Scalarization methods and expected multi-utility representations, Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs, Extension of the value function reformulation to multiobjective bilevel optimization, On the efficiency of Leontief's dynamic input-output system, Proper efficiency with respect to cones, Bicriteria linear fractional programming, Weak Henig proper solution sets for set optimization problems, An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem, Connectivity of efficient solution sets in vector optimization of set-valued mappings, Maximal points of convex sets in locally convex topological vector spaces: generalization of the Arrow-Barankin-Blackwell theorem, Admissible points of a convex polyhedron, A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games, A note on weak sharp minima in multicriteria linear programming, Properly efficient and efficient solutions for vector maximization problems in Euclidean space, On the density of proper efficient points, Solution concepts in continuous-kernel multicriteria games, Markov decision processes with multiple costs, Efficient solutions in generalized linear vector optimization, Stochastic multiobjective optimization: Sample average approximation and applications, Pareto optima and equilibria when preferences are incompletely known, Some minimax theorems in vector-valued functions, Comparative statics and dynamics of optimal choice models in Hilbert spaces, Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces, On the density of properly maximal claims in financial markets with transaction costs, The Nonemptiness of the Inner Core, On the existence of a technical efficiency criterion, Some geometrical aspects of efficient points in vector optimization, The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces, The effects of adding objectives to an optimisation problem on the solution set, Piecewise linear vector optimization problems on locally convex Hausdorff topological vector spaces, Optimization over the efficient set, Generalized polyhedral convex optimization problems, Maximal vectors and multi-objective optimization, Soluciones no dominadas en problemas multiobjetivo, Efficient random variables, Topological Properties of the Efficient Point Set, Density theorems for ideal points in vector optimization, New concept of the ABB theorem, Value functions, domination cones and proper efficiency in multicriteria optimization, Soluciones propias en la teoria de la dominacion, Connectedness of the set of nondominated outcomes in multicriteria optimization, Existence and density results for proper efficiency in cone compact sets, Existence of efficient solutions for vector maximization problems, The structure of admissible points with respect to cone dominance, Robust multiobjective optimization \& applications in portfolio optimization, Application of functional analysis to models of efficient allocation of economic resources, Proper efficiency and the theory of vector maximization, Efficiency in integral facility design problems, Efficiency prices for optimal consumption plans, Structure of Pareto solutions of generalized polyhedral-valued vector optimization problems in Banach spaces, Some more density results for proper efficiencies, Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces, A Characterization of Pareto Surfaces, Maximal points with respect to cone dominance in Banach spaces and their existence, On the characterization of noninferior solutions of the vector optimization problem, Existence and characterization of efficient decisions with respect to cones, Decision making and games with vector outcomes, Set of efficient points in linear multicriteria problems, A revised simplex method for linear multiple objective programs, A generalization of the Arrow-Barankin-Blackwell theorem in normed spaces, Computation of efficient compromise arcs in convex quadratic multicriteria optimization, Market representations of $n$-person games
