Outcome space partition of the weight set in multiobjective linear programming
type: Item
instance of: scholarly article
title: Outcome space partition of the weight set in multiobjective linear programming
zbMATH Open document ID: 1028.90051
DOI: 10.1023/A:1004605810296
author: Harold P. Benson
author: Erjiang Sun
published in: Journal of Optimization Theory and Applications
publication date: 2000-09-14T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C08
zbMATH DE Number: 1506895
zbMATH Keywords: multiple-objective linear programming
zbMATH Keywords: vector maximization
zbMATH Keywords: efficient points
zbMATH Keywords: weight set
describes a project that uses: ADBASE
MaRDI profile type: Publication
cites work: Q3815146
cites work: Finding all maximal efficient faces in multiobjective linear programming
cites work: Determination of the efficient set in multiobjective linear programming
cites work: Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
cites work: Multiple Objective Linear Programming with Parametric Criteria Coefficients
cites work: Towards finding global representations of the efficient set in multiple objective mathematical programming
cites work: Q3760254
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 general method for determining the set of all efficient solutions to a linear vectormaximum problem
cites work: Proper efficiency and the theory of vector maximization
cites work: Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
cites work: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
cites work: Algorithms for the vector maximization problem
cites work: Theory of multiobjective optimization
cites work: Linear multiobjective programming
cites work: Identifying Efficient Vectors: Some Theory and Computational Results
cites work: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
cites work: Generating the efficient outcome set in multiple objective linear programs: The bicriteria case
cites work: Further analysis of an outcome set-based algorithm for multiple-objective linear programming
cites work: Hybrid approach for solving multiple-objective linear programs in outcome space
cites work: The structure of admissible points with respect to cone dominance
cites work: Analysis of the objective space in multiple objective linear programming
cites work: On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
cites work: Solving multiple objective linear programs in objective space
cites work: A representation of the set of feasible objectives in multiple objective linear programs
cites work: A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
cites work: On a property of polyhedral sets
cites work: A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
cites work: Convex Analysis
cites work: An algorithm for nonconvex programming problems
cites work: Nonlinear Programming in Banach Space
cites work: Admissible points of a convex polyhedron
full work available at URL: a:1004605810296
OpenAlex ID: W1549610687
description: scientific article; zbMATH DE number 1506895