scientific article; zbMATH DE number 3078986
From MaRDI portal
Publication:5817859
Cited in
(83)- Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces
- On the characterization of noninferior solutions of the vector optimization problem
- On differentiability of cost functions
- Weighting factor results in vector optimization
- Lexicographical order and duality in multiobjective programming
- Solution concepts in two-person multicriteria games
- Stability in multicriteria optimization
- Proper efficiency with respect to cones
- Bicriteria linear fractional programming
- Admissible points of a convex polyhedron
- Properly efficient and efficient solutions for vector maximization problems in Euclidean space
- Some minimax theorems in vector-valued functions
- Comparative statics and dynamics of optimal choice models in Hilbert spaces
- On the existence of a technical efficiency criterion
- Maximal vectors and multi-objective optimization
- Efficient random variables
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- Existence of efficient solutions for vector maximization problems
- The structure of admissible points with respect to cone dominance
- Application of functional analysis to models of efficient allocation of economic resources
- Some more density results for proper efficiencies
- Generalization of the Arrow-Barankin-Blackwell theorem in a dual space setting
- The domination property for efficiency in locally convex spaces
- Generalizations of a theorem of Arrow, Barankin, and Blackwell in topological vector spaces
- Maximal points of convex sets in locally convex topological vector spaces: generalization of the Arrow-Barankin-Blackwell theorem
- Congestion in production correspondences
- Piecewise linear vector optimization problems on locally convex Hausdorff topological vector spaces
- 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
- Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs
- Generalized polyhedral convex optimization problems
- Decision making and games with vector outcomes
- New concept of the ABB theorem
- Structure of Pareto solutions of generalized polyhedral-valued vector optimization problems in Banach spaces
- Pareto optima and equilibria when preferences are incompletely known
- On the density of properly maximal claims in financial markets with transaction costs
- The effects of adding objectives to an optimisation problem on the solution set
- Robust multiobjective optimization \& applications in portfolio optimization
- Proper efficiency and the theory of vector maximization
- Efficiency prices for optimal consumption plans
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
- On the efficiency of Leontief's dynamic input-output system
- The nonemptiness of the inner core
- Soluciones no dominadas en problemas multiobjetivo
- Soluciones propias en la teoria de la dominacion
- Existence and characterization of efficient decisions with respect to cones
- Scalarization methods and expected multi-utility representations
- 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
- A note on weak sharp minima in multicriteria linear programming
- H_ constraint Pareto optimal strategy for stochastic LPV systems
- Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces
- A revised simplex method for linear multiple objective programs
- Market representations of n-person games
- On the density of proper efficient points
- A Characterization of Pareto Surfaces
- Efficient solutions in generalized linear vector optimization
- Bayesl�sungen bei mehrstufigen Tests
- Topological Properties of the Efficient Point Set
- Value functions, domination cones and proper efficiency in multicriteria optimization
- Density and connectedness of optimal points with respect to improvement sets
- Optimization over the efficient set
- Density theorems for ideal points in vector optimization
- Existence and density results for proper efficiency in cone compact sets
- On the density of positive proper efficient points in a normed space
- Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization
- Extension of the value function reformulation to multiobjective bilevel optimization
- Weak Henig proper solution sets for set optimization problems
- Stochastic multiobjective optimization: Sample average approximation and applications
- ``Near weighted utilitarian characterizations of Pareto optima
- Uniform weak sharp minima for multiobjective optimization problems
- Existence and density theorems of Henig global proper efficient points
- Efficiency in integral facility design problems
- Maximal points with respect to cone dominance in Banach spaces and their existence
- Set of efficient points in linear multicriteria problems
- A generalization of the Arrow-Barankin-Blackwell theorem in normed spaces
- Computation of efficient compromise arcs in convex quadratic multicriteria optimization
- Multicriteria approach to bilevel optimization
- A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
- Solution concepts in continuous-kernel multicriteria games
- Markov decision processes with multiple costs
- Some geometrical aspects of efficient points in vector optimization
- The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5817859)