The structure of admissible points with respect to cone dominance

DOI10.1007/BF00934453zbMath0389.52021MaRDI QIDQ1250997

Gabriel R. Bitran, Thomas L. Magnanti

Publication date: 1979

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items

On existence of cone-maximal points in real topological linear spaces, Connectedness of efficient solution sets for set-valued maps in normed spaces, Weighting factor results in vector optimization, The domination property in multicriteria optimization, A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions, The Arrow-Barankin-Blackwell theorem in a dual space setting, Generalized Arrow-Barankin-Blackwell theorems in locally convex 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, Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, Lagrange multipliers and generalized differentiable functions in vector extremum problems, Generalization of the Arrow-Barankin-Blackwell theorem in a dual space setting, On connectedness of efficient solution sets for a star cone-quasiconvex vector optimization problem, On the density of positive proper efficient points in a normed space, On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces, Unnamed Item, Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization, On efficient solutions in vector optimization, Generalizations of a theorem of Arrow, Barankin, and Blackwell in topological vector spaces, Input optimization: III. optimal realizations of multiobjective models, Duality for nonlinear multiple-criteria optimization problems, A cone separation theorem, Proper efficiency with respect to cones, Some results about nondominated solutions, Bicriteria linear fractional programming, Connectivity of efficient solution sets in vector optimization of set-valued mappings, Generating equidistant representations in biobjective programming, Maximal points of convex sets in locally convex topological vector spaces: generalization of the Arrow-Barankin-Blackwell theorem, Admissible points of a convex polyhedron, On a domination property for vector maximization with respect to cones, On the density of proper efficient points, On Pareto optima, the Fermat-Weber problem, and polyhedral gauges, Meilleure approximation en norme vectorielle et théorie de la localisation, Optimality conditions in nonconical multiple objective programming, Some minimax theorems in vector-valued functions, Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives, Piecewise quadratic approximation of the non-dominated set for bi-criteria programs, On the density of properly maximal claims in financial markets with transaction costs, On the characterization of efficient points by means of monotone functionals, Contractibility of efficient point sets in normed spaces, Optimization over the efficient set, Pareto efficiency in locally convex spaces i, Some geometrical aspects of efficient points in vector optimization, The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces, Stationary Points and Necessary Conditions in Vector Extremum Problems, Some Optimality Conditions in Vector Optimization, Connectedness of cone superefficient point sets in locally convex topological vector spaces, On the existence of efficient points, Some results on regularity in vector optimization, The range of the efficient frontier in multiple objective linear programming, Efficient sets of convex compacta are arcwise connected, A New Abb Theorem In Banach Spaces, Value functions, domination cones and proper efficiency in multicriteria optimization, Soluciones propias en la teoria de la dominacion, Nonconvex separation theorems and some applications in vector optimization, On the contractibility and connectedness of an efficient point set., Existence and density results for proper efficiency in cone compact sets, A generalization of a theorem of Arrow, Barankin and Blackwell to a nonconvex case, Connectedness of efficient points in convex and convex transformable vector optimization, Parametrized multicriteria optimization; order continuity of the marginal multifunctions, An interactive algorithm for nonlinear vector optimization, Connectedness of the efficient set of strictly quasiconcave sets, Approximation of the efficient point set by perturbation of the ordering cone, Decision making under uncertainty: A semi-infinite programming approach, Continuous dependence of solutions on a parameter in a scalarization method, Some more density results for proper efficiencies, Contractibility and connectedness of efficient point sets, Approximating families of cones and proper efficiency in vector optimization, On information functions and their polars, Arcwise connectedness of closed efficient point sets, Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces, Outcome space partition of the weight set in multiobjective linear programming, Comparison of existence results for efficient points, Concepts of proper efficiency, Maximal points with respect to cone dominance in Banach spaces and their existence, Existence and characterization of efficient decisions with respect to cones, On the reciprocal vector optimization problems, Images of connected sets by semicontinuous multifunctions, On efficient sets in vector maximum problems - A brief survey, A generalization of the Arrow-Barankin-Blackwell theorem in normed spaces, General form of the Arrow-Barabkin-Blackwell theorem in normed spaces and the \(l^ \infty\)-case

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability in multicriteria optimization
• On local Pareto Optima
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Global analysis and economics. III: Pareto Optima and price equilibria
• Global analysis and economics. VI: Geometric analysis of Pareto optima and price equilibria under classical hypotheses
• Characterization of optima in smooth Pareto economic systems
• Global analysis and economics. V: Pareto theory with constraints
• Thresholds in Pareto sets
• Proper efficiency and the theory of vector maximization
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• First Order Conditions for General Nonlinear Optimization
• Proper Efficient Points for Maximizations with Respect to Cones
• Generation of the Admissible Boundary of a Convex Polytope
• A revised simplex method for linear multiple objective programs
• Algorithms for the vector maximization problem
• Strictly Concave Parametric Programming, Part I: Basic Theory
• Solving Bicriterion Mathematical Programs
• Convex Analysis
• An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
• On the Identifiability Problem for Functions of Finite Markov Chains