Efficient solutions in generalized linear vector optimization
DOI10.1080/00036811.2018.1441992zbMath1417.49046arXiv1705.06875OpenAlexW2963987620MaRDI QIDQ5379436
Publication date: 12 June 2019
Published in: Applicable Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.06875
convex polyhedronsolution existence theoremlocally convex Hausdorff topological vector spacegeneralized convex polyhedrongeneralized linear vector optimization problem
Multi-objective and goal programming (90C29) Linear programming (90C05) Programming in abstract spaces (90C48) Linear-quadratic optimal control problems (49N10) Convex sets in topological vector spaces (aspects of convex geometry) (52A07)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Pascoletti-Serafini scalarization scheme and linear vector optimization
- Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization
- The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces
- Scalarization of vector optimization problems
- Generalizations of a theorem of Arrow, Barankin, and Blackwell in topological vector spaces
- Scalarization of Henig proper efficient points in a normed space
- Scalarizing vector optimization problems
- Linear fractional vector optimization problems with many components in the solution sets
- Multiobjective Linear Programming
- Scalarization in vector optimization
- Adaptive Scalarization Methods in Multiobjective Optimization
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Convex Analysis
This page was built for publication: Efficient solutions in generalized linear vector optimization