The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces
From MaRDI portal
Publication:946377
DOI10.1007/s11425-008-0021-3zbMath1176.90562OpenAlexW1994803283MaRDI QIDQ946377
Publication date: 23 September 2008
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-008-0021-3
Related Items (14)
Perturbation analysis of global error bounds for piecewise linear conic inequalities ⋮ Existence theorems in vector optimization with generalized order ⋮ Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization ⋮ Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs ⋮ Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria ⋮ Efficient solutions in generalized linear vector optimization ⋮ Weak sharp minima for piecewise linear multiobjective optimization in normed spaces ⋮ Piecewise linear vector optimization problems on locally convex Hausdorff topological vector spaces ⋮ Local smooth representation of solution sets in parametric linear fractional programming problems ⋮ Characteristics of semi-convex frontier optimization ⋮ 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 ⋮ Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp minima for multiobjective optimization in Banach spaces
- 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
- Strict minimality conditions in nondifferentiable multiobjective programming
- Contractibility and connectedness of efficient point sets
- Outcome space partition of the weight set in multiobjective linear programming
- 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
- Management of surgical waiting lists through a possibilistic linear multiobjective programming problem
- Optimization and nonsmooth analysis
- An Existence Theorem in Vector Optimization
- Connectedness of the efficient solution set of a convex vector optimization in normed spaces
- Connectivity of efficient solution sets in vector optimization of set-valued mappings
- Multiple objective programming with piecewise linear functions
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- Contractibility of efficient point sets in normed spaces
- Efficient sets of convex compacta are arcwise connected
- Strict efficiency in vector optimization
This page was built for publication: The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces
