Solving multiple objective linear programs in objective space
type: Item
instance of: scholarly article
title: Solving multiple objective linear programs in objective space
zbMATH Open document ID: 0712.90063
DOI: 10.1016/0377-2217(90)90010-9
author: Yi-Hsin Liu
author: J. P. Dauer
published in: European Journal of Operational Research
publication date: 1990-01-01T00:00:00Z
review text: The authors offer an algorithm for solving a multicriteria linear programming problem. It is based on analysing this problem in the objective space in which a set of all feasible objective values has, as a rule, a simpler structure than the initial polytope in the constraint space. A procedure for determining the nondominated extreme points and edges in the objective space is described. The computational advantages of the suggested algorithm are discussed for the water resource model of \textit{J. P. Dauer} and \textit{R. J. Krueger} [Appl. Math. Modelling 4, 171- 175 (1980; Zbl 0438.90045)].
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 4172754
zbMATH Keywords: nondominated extreme points
MaRDI profile type: Publication
full work available at URL: 0377-2217(90)90010-9
OpenAlex ID: W2082143163
cites work: Q4091703
cites work: Analysis of the objective space in multiple objective linear programming
cites work: A multiobjective optimization model for water resources planning
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: Q4194726
cites work: Redundant objective functions in linear vector maximum problems and their determination
cites work: Q5721624
cites work: Q5806966
cites work: An approach to nonlinear programming
cites work: Algorithms for the vector maximization problem
cites work: Q4105450
cites work: The range of the efficient frontier in multiple objective linear programming
cites work: Q3815146
cites work: Q5603731
cites work: Algorithms for frames and lineality spaces of cones
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
cites work: Linear multiobjective programming
Recommended article: Q4387185
Recommended article: Solving multiple-objective problems in the objective space
Recommended article: Solving the multiobjective possibilistic linear programming problem
Recommended article: Solving the Multiple Objective Integer Linear Programming Problem
Recommended article: Analysis of the objective space in multiple objective linear programming
Recommended article: Multiple Objective Linear Programming (MOLP) Problems with the Same Objective Space
Recommended article: Q3738954
Recommended article: Multiobjective possibilistic linear programming
Recommended article: Multiobjective linear and integer programming
Recommended article: Q3731386
description: scientific article; zbMATH DE number 4172754