Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
type: Item
instance of: scholarly article
title: Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
zbMATH Open document ID: 1262.90159
author: Panos M. Pardalos
author: Ingrida Steponavičė
author: Antanas Žilinskas
published in: Optimization Letters
publication date: 2012-11-30T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6111728
zbMATH Keywords: uniformly distributed Pareto set
zbMATH Keywords: adjustable weights
zbMATH Keywords: lexicographic goal programming
zbMATH Keywords: optimal portfolio selection
describes a project that uses: AbYSS
describes a project that uses: SPEA2
MaRDI profile type: Publication
full work available at URL: s11590-011-0291-5
OpenAlex ID: W2075868161
cites work: A survey of recent developments in multiobjective optimization
cites work: Q5301183
cites work: Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
cites work: Introduction to global optimization.
cites work: The normalized normal constraint method for generating the Pareto frontier
cites work: Nonlinear multiobjective optimization
cites work: MOCell: A cellular genetic algorithm for multiobjective optimization
cites work: Advances in multicriteria analysis
cites work: Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
cites work: Multicriteria optimization in engineering and in the sciences
cites work: Global optimization based on a statistical model and simplicial partitioning.
cites work: Handbook of multicriteria analysis
DOI: 10.1007/S11590-011-0291-5
Recommended article: Approximating the Pareto optimal set using a reduced set of objective functions
Recommended article: Approximation of a set of Pareto-optimal solutions
Recommended article: On the approximation of a pareto set
Recommended article: Q3686450
Recommended article: Approximate Pareto sets of minimal size for multi-objective optimization problems
Recommended article: An algorithm for approximating the Pareto set of the multiobjective set covering problem
Recommended article: Approximating the Pareto set of multiobjective linear programs via robust optimization
Recommended article: Methods of approximating Pareto set faces in a linear multiple-criteria problem
Recommended article: Approximating the Pareto Front of Multi-criteria Optimization Problems
Recommended article: Q3607149
description: scientific article; zbMATH DE number 6111728