Retrieval and use of the balance set in multiobjective global optimization
type: Item
instance of: scholarly article
title: Retrieval and use of the balance set in multiobjective global optimization
zbMATH Open document ID: 0931.90045
DOI: 10.1016/S0898-1221(99)00063-2
author: Yanyan Li
publication date: 2000-01-20T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 1391527
zbMATH Keywords: global multiobjective optimization
zbMATH Keywords: interactive method
zbMATH Keywords: feasible region
zbMATH Keywords: vector optimization problems
zbMATH Keywords: balance set
MaRDI profile type: Publication
cites work: Existence of efficient solutions for vector maximization problems
cites work: Use of exact penalty functions to determine efficient decisions
cites work: Q3039055
cites work: Multiobjective programming and planning
cites work: Finding all efficient extreme points for multiple objective linear programs
cites work: Compromise solutions and estimation of the noninferior set
cites work: Strictly Concave Parametric Programming, Part II: Additional Theory and Computational Considerations
cites work: Proper efficiency and the theory of vector maximization
cites work: Q3470264
cites work: Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
cites work: Optimal maintenance headcount allocation: an application of Chebyshev Goal Programming
cites work: Q4315869
cites work: Q4180077
cites work: Multiple-objective programming with polynomial objectives and constraints
cites work: Q4206580
cites work: Scalarizing vector optimization problems
cites work: On the noninferior index approach to large-scale multi-criteria systems
cites work: A characterization of weakly efficient points
cites work: Theory of multiobjective optimization
cites work: Multiple criteria decision analysis in regional planning. Concepts, methods and applications
cites work: An interactive weighted Tchebycheff procedure for multiple objective programming
cites work: Q3815146
cites work: Q4724391
cites work: Vector optimization and generalized Lagrangian duality
cites work: Efficiency in multiple objective optimization problems
cites work: Characterizations of efficient sets by constrained objectives
cites work: Q3743132
cites work: Q4026481
cites work: On the completeness and constructiveness of parametric characterizations to vector optimization problems
cites work: Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
cites work: Linear multiobjective programming
cites work: Q3716769
cites work: Q3134860
cites work: Nonscalarized multiobjective global optimization
full work available at URL: s0898-1221(99)00063-2
OpenAlex ID: W2051291516
published in: Computers & Mathematics with Applications
Recommended article: Min-max formulation of the balance number in multiobjective global optimization.
Recommended article: Global search perspectives for multiobjective optimization
Recommended article: Generalized equivalence set method for solving multiobjective optimization problems
Recommended article: Towards finding global representations of the efficient set in multiple objective mathematical programming
Recommended article: Pareto analysis vis-à-vis balance space approach in multiobjective global optimization
Recommended article: Balancing exploration and exploitation in multiobjective evolutionary optimization
Recommended article: Q4848891
Recommended article: Set Oriented Methods for the Numerical Treatment of Multiobjective Optimization Problems
description: scientific article; zbMATH DE number 1391527