Finding all maximal efficient faces in multiobjective linear programming
type: Item
instance of: scholarly article
title: Finding all maximal efficient faces in multiobjective linear programming
zbMATH Open document ID: 0795.90054
DOI: 10.1007/BF01582157
author: Paul Armand
published in: Mathematical Programming. Series A. Series B
publication date: 1994-09-14T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 513288
zbMATH Keywords: degeneracy
zbMATH Keywords: simplex algorithm
zbMATH Keywords: efficient set
zbMATH Keywords: multiobjective linear program
zbMATH Keywords: maximal efficient faces
zbMATH Keywords: lexicographic selection rule
zbMATH Keywords: connectedness
MaRDI profile type: Publication
cites work: Q4091421
cites work: Determination of the efficient set in multiobjective linear programming
cites work: On the graph structure of convex polyhedra in \(n\)-space
cites work: Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
cites work: On Computing an Initial Efficient Extreme Point
cites work: Generating all maximal efficient faces for multiple objective linear programs
cites work: Finding all efficient extreme points for multiple objective linear programs
cites work: Selecting Subsets from the Set of Nondominated Vectors in Multiple Objective Linear Programming
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 the structure of the set bases of a degenerate point
cites work: Q3221979
cites work: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
cites work: Degeneracy graphs and the neighbourhood problem
cites work: Faces of a polyhedron
cites work: Algorithms for the vector maximization problem
cites work: Convex Analysis
cites work: Q3815146
cites work: Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
cites work: Linear multiobjective programming
full work available at URL: https://doi.org/10.1007/bf01582157
OpenAlex ID: W1967298113
description: scientific article; zbMATH DE number 513288