On a constructive approximation of the efficient outcomes in bicriterion vector optimization
From MaRDI portal
Publication:1330805
DOI10.1007/BF01097002zbMath0826.90098MaRDI QIDQ1330805
Publication date: 11 August 1994
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01097002
Related Items
On the quality of discrete representations in multiple objective programming, Generating equidistant representations in biobjective programming, The Pascoletti-Serafini scalarization scheme and linear vector optimization, On a constructive approximation of the efficient outcomes in bicriterion vector optimization, Utility efficiency and its approximation, The adaptive parameter control method and linear vector optimization, Approximation methods in multiobjective programming, Piecewise quadratic approximation of the non-dominated set for bi-criteria programs
Cites Work
- On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
- Bicriteria linear fractional programming
- On convex vectorial optimization in linear spaces
- Vector maximization with two objective functions
- On a constructive approximation of the efficient outcomes in bicriterion vector optimization
- Interactive bicriterion solution method and its application to critical path method problems
- Connectedness of the efficient point sets in quasiconcave vector maximization
- Scalarizing vector optimization problems
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
