On Cone-Efficiency, Cone-Convexity and Cone-Compactness
From MaRDI portal
Publication:4158730
DOI10.1137/0134018zbMath0379.90005OpenAlexW1998665330MaRDI QIDQ4158730
Publication date: 1978
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0134018
Decision theory (91B06) Compactness (54D30) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Mathematical programming (90C99)
Related Items (only showing first 100 items - show all)
Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions ⋮ On the existence of stable states in game problems ⋮ Major-efficient solutions and weakly major-efficient solutions of multiobjective programming ⋮ On existence of cone-maximal points in real topological linear spaces ⋮ On the notion of proper efficiency in vector optimization ⋮ Connectedness of efficient solution sets for set-valued maps in normed spaces ⋮ On the existence of maximal elements for partial preorders ⋮ Global efficiency in multiobjective programming* ⋮ A combined scalarizing method for multiobjective programming problems ⋮ Vector optimization w.r.t. relatively solid convex cones in real linear spaces ⋮ Characterizing the nondominated set by separable functions ⋮ Some minimax problems of vector-valued functions ⋮ Remarks on convex cones ⋮ On the image of a constrained extremum problem and some applications to the existence of a minimum ⋮ A minimax theorem for vector-valued functions ⋮ Some topological properties in optimization theory ⋮ The Arrow-Barankin-Blackwell theorem in a dual space setting ⋮ Generalized Arrow-Barankin-Blackwell theorems in locally convex spaces ⋮ Constraint qualifications in convex vector semi-infinite optimization ⋮ A note on convex cones in topological vector spaces ⋮ Density theorems for generalized Henig proper efficiency ⋮ Existence theorems for cone saddle points of vector-valued functions in infinite-dimensional spaces ⋮ Density of the set of positive proper minimal points in the set of minimal points ⋮ Stability of majorly efficient points and solutions in multiobjective programming ⋮ Proper efficiency in locally convex topological vector spaces ⋮ Generalization of the Arrow-Barankin-Blackwell theorem in a dual space setting ⋮ Nonlinear scalarization in multiobjective optimization with a polyhedral ordering cone ⋮ Directionally differentiable multiobjective optimization involving discrete inclusions ⋮ Super Efficiency in Vector Optimization ⋮ A note on cone-maximal and extreme points in topological vector spaces ⋮ Strict efficiency in vector optimization with nearly convexlike set-valued maps ⋮ On the weak semi-continuity of vector functions and minimum problems ⋮ The domination property for efficiency in locally convex spaces ⋮ Cones admitting strictly positive functionals and scalarization of some vector optimization problems ⋮ On a Continuously Discounted Vector Valued Markov Decision Process ⋮ Generalizations of a theorem of Arrow, Barankin, and Blackwell in topological vector spaces ⋮ On the transformation of lexicographic nonlinear multiobjective programs to single objective programs ⋮ Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps ⋮ Duality for nonlinear multiple-criteria optimization problems ⋮ Proper efficiency with respect to cones ⋮ Connectivity of efficient solution sets in vector optimization of set-valued mappings ⋮ Admissible points of a convex polyhedron ⋮ A minimax theorem for vector-valued functions. II ⋮ A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games ⋮ Duality theory for maximizations with respect to cones ⋮ Properly efficient and efficient solutions for vector maximization problems in Euclidean space ⋮ Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization ⋮ Solution concepts in continuous-kernel multicriteria games ⋮ Superefficiency in vector optimization with nearly subconvexlike set-valued maps ⋮ Some minimax theorems in vector-valued functions ⋮ Duality for set-valued multiobjective optimization problems. I: Mathematical programming ⋮ Hartley proper efficiency in multifunction optimization ⋮ On the density of properly maximal claims in financial markets with transaction costs ⋮ Characterizing efficiency without linear structure: a unified approach ⋮ On the characterization of efficient points by means of monotone functionals ⋮ Characterization of substantially and quasi-substantially efficient solutions in multiobjective optimization problems ⋮ Quasi-proper efficiency: a quantitative enhanced efficiency ⋮ Superefficiency in local convex spaces ⋮ Some geometrical aspects of efficient points in vector optimization ⋮ Stability of efficient sets: continuity of mobile polarities ⋮ Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization ⋮ On the existence of efficient points ⋮ Convexity of the optimal multifunctions and its consequences in vector optimization ⋮ Soluciones no dominadas en problemas multiobjetivo ⋮ Parametrized multicriteria optimization: Continuity and closedness of optimal multifunctions ⋮ Value functions, domination cones and proper efficiency in multicriteria optimization ⋮ Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure ⋮ Soluciones propias en la teoria de la dominacion ⋮ Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints ⋮ A generalization of a theorem of Arrow, Barankin and Blackwell to a nonconvex case ⋮ Existence and Convergence of Optimal Points with Respect to Improvement Sets ⋮ Improved \(\varepsilon\)-constraint method for multiobjective programming ⋮ Parametrized multicriteria optimization; order continuity of the marginal multifunctions ⋮ Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps ⋮ Existence of efficient points in vector optimization and generalized Bishop-Phelps theorem ⋮ Characterizations of the Benson proper efficiency for nonconvex vector optimization ⋮ Approximation of the efficient point set by perturbation of the ordering cone ⋮ An existence result for maximizations with respect to cones ⋮ Super efficient solutions and super infima in vector optimization ⋮ Continuous dependence of solutions on a parameter in a scalarization method ⋮ Some more density results for proper efficiencies ⋮ Between Pareto efficiency and Pareto ε-efficiency ⋮ Existence of Pareto solutions for vector polynomial optimization problems with constraints ⋮ Comparison of existence results for efficient points ⋮ Scalarization of Henig proper efficient points in a normed space ⋮ Unified representation of proper efficiency by means of dilating cones ⋮ Maximal points with respect to cone dominance in Banach spaces and their existence ⋮ Existence and characterization of efficient decisions with respect to cones ⋮ Geometric consideration of duality in vector optimization ⋮ Characterizations of Hartley proper efficiency in nonconvex vector optimization ⋮ Definition and characterization of Geoffrion proper efficiency for real vector optimization with infinitely many criteria ⋮ On efficient sets in vector maximum problems - A brief survey ⋮ Existence and characterization theorems in nonconvex vector optimization ⋮ On the existence of efficient points in locally convex spaces ⋮ A generalization of the Arrow-Barankin-Blackwell theorem in normed spaces ⋮ Bases of convex cones and Borwein's proper efficiency ⋮ Proper solutions of vector optimization problems ⋮ Nonscalarized multiobjective global optimization ⋮ General form of the Arrow-Barabkin-Blackwell theorem in normed spaces and the \(l^ \infty\)-case ⋮ Extension of the Zorn lemma to general nontransitive binary relations
This page was built for publication: On Cone-Efficiency, Cone-Convexity and Cone-Compactness
