Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
type: Item
instance of: scholarly article
title: Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
zbMATH Open document ID: 1066.90115
published in: Mathematical and Computer Modelling
publication date: 2005-06-23T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 2182176
zbMATH Keywords: MCDM Pareto solutions
zbMATH Keywords: Set contraction
zbMATH Keywords: Cubic algorithm
author: E. A. Galperin
MaRDI profile type: Publication
full work available at URL: j.mcm.2004.10.014
OpenAlex ID: W2131919032
cites work: Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
cites work: Finding all efficient extreme points for multiple objective linear programs
cites work: Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming
cites work: A saddle-point characterization of Pareto optima
cites work: A characterization of weakly efficient points
cites work: Q3134860
cites work: Nonscalarized multiobjective global optimization
cites work: Equivalence of balance points and Pareto solutions in multiple-objective programming
cites work: Pareto analysis vis-à-vis balance space approach in multiobjective global optimization
cites work: Retrieval and use of the balance set in multiobjective global optimization
cites work: Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors.
cites work: Balance space in airport construction: Application to the North Sea island option for Schiphol Airport
cites work: Min-max formulation of the balance number in multiobjective global optimization.
cites work: The balance space approach to multicriteria decision making -- involving the decision maker.
cites work: The balance space approach in optimization with Riesz spaces valued objectives. An application to financial markets.
cites work: Goal-optimal Pareto solution of multiobjective linear programs and its computing with standard single objective LP software
cites work: Norm-based approximation in multicriteria programming.
cites work: Convergence estimates for crude approximations of a Pareto set.
cites work: Q3818927
cites work: Use of \(P_ \tau\)-nets for the approximation of the Edgeworth-Pareto set in multicriteria optimization
cites work: The cubic algorithm
cites work: Discontinuity and measurability of robust functions in the integral global minimization
cites work: Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
cites work: Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
DOI: 10.1016/J.MCM.2004.10.014
description: scientific article; zbMATH DE number 2182176