Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces

DOI10.1007/s11228-009-0120-5zbMath1177.49033OpenAlexW2080965947MaRDI QIDQ1044248

J. Blot

Publication date: 11 December 2009

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-009-0120-5

zbMATH Keywords

vector optimizationBanach spacePareto solutionweak Pareto solution

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Set-valued and variational analysis (49J53)

Related Items (10)

Perturbation analysis of global error bounds for piecewise linear conic inequalities ⋮ On finite linear systems containing strict inequalities ⋮ Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs ⋮ Relationships between polyhedral convex sets and generalized polyhedral convex sets ⋮ Set approach for set optimization with variable ordering structures. II: Scalarization approaches ⋮ Risk sharing for capital requirements with multidimensional security markets ⋮ Fully piecewise linear vector optimization problems ⋮ A representation of generalized convex polyhedra and applications ⋮ Structure of Pareto solutions of generalized polyhedral-valued vector optimization problems in Banach spaces ⋮ On minimal generators for semi-closed polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• On the density of positive proper efficient points in a normed space
• The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces
• Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
• Linear multiobjective programming
• The structure of admissible points with respect to cone dominance
• Multicriteria planar location problems
• Finding all maximal efficient faces in multiobjective linear programming
• Contractibility and connectedness of efficient point sets
• Outcome space partition of the weight set in multiobjective linear programming
• Connectedness of the efficient point sets in quasiconcave vector maximization
• On sensitivity in linear multiobjective programming
• The compromise hypersphere for multiobjective linear programming
• On the connectedness of the efficient set for strictly quasiconvex vector minimization problems
• Ordered linear spaces
• Management of surgical waiting lists through a possibilistic linear multiobjective programming problem
• On a Theorem of Arrow, Barankin, and Blackwell
• A Generalization of a Theorem of Arrow, Barankin, and Blackwell
• An Existence Theorem in Vector Optimization
• Connectedness of the efficient solution set of a convex vector optimization in normed spaces
• Multiple objective programming with piecewise linear functions
• Two Generalizations of a Theorem of Arrow, Barankin, and Blackwell
• Convex Analysis
• Contractibility of efficient point sets in normed spaces
• Efficient sets of convex compacta are arcwise connected

This page was built for publication: Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces