New closedness results for efficient sets in multiple objective mathematical programming
type: Item
instance of: scholarly article
title: New closedness results for efficient sets in multiple objective mathematical programming
zbMATH Open document ID: 0973.90070
author: Harold P. Benson
author: Erjiang Sun
published in: Journal of Mathematical Analysis and Applications
publication date: 2001-12-05T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 1354762
zbMATH Keywords: necessary condition and several sufficient conditions for the closedness of the efficient sets
zbMATH Keywords: multiple objective
zbMATH Keywords: mathematical programming
MaRDI profile type: Publication
full work available at URL: jmaa.1999.6541
OpenAlex ID: W2056829124
cites work: Finding all maximal efficient faces in multiobjective linear programming
cites work: Determination of the efficient set in multiobjective linear programming
cites work: Linear programming with multiple objective functions: Step method (stem)
cites work: An all-linear programming relaxation algorithm for optimizing over the efficient set
cites work: Optimization over the efficient set
cites work: Minimization of a quasi-concave function over an efficient set
cites work: Q3039055
cites work: Connectedness in Multiple Linear Fractional Programming
cites work: Multiobjective programming and planning
cites work: Connectedness of the efficient set for three-objective quasiconcave maximization problems
cites work: Optimization over the efficient set using an active constraint approach
cites work: A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
cites work: Generating all maximal efficient faces for multiple objective linear programs
cites work: An Overview of Techniques for Solving Multiobjective Mathematical Programs
cites work: A revised simplex method for linear multiple objective programs
cites work: A general method for determining the set of all efficient solutions to a linear vectormaximum problem
cites work: On efficient sets in vector maximum problems - A brief survey
cites work: Proper efficiency and the theory of vector maximization
cites work: Connectedness of the efficient set in strictly quasiconcave vector maximization
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: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
cites work: Computational experience concerning payoff tables and minimum criterion values over the efficient set
cites work: Strictly quasi-convex (concave) functions and duality in mathematical programming
cites work: Multiple Objective Linear Fractional Programming
cites work: Q5806966
cites work: Subdefinite Matrices and Quadratic Forms
cites work: Nonlinear multiobjective optimization
cites work: Algorithms for the vector maximization problem
cites work: Theory of multiobjective optimization
cites work: Q4742579
cites work: Interactive multiple objective optimization: Survey. I: Continuous case
cites work: A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
cites work: Q3815146
cites work: On the connectedness of the efficient set for strictly quasiconvex vector minimization problems
cites work: Careful usage of pessimistic values is needed in multiple objectives optimization
cites work: Q3217984
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
cites work: On functions whose local minima are global
cites work: Q3716769
DOI: 10.1006/JMAA.1999.6541
description: scientific article; zbMATH DE number 1354762