Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
type: Item
instance of: scholarly article
title: Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
zbMATH Open document ID: 0681.90071
DOI: 10.1016/0377-2217(89)90256-7
author: Rajendra S. Solanki
author: Jared L. Cohon
published in: European Journal of Operational Research
publication date: 1989-01-01T00:00:00Z
review text: An algorithm is proposed to generate an approximate representation of the noninferior set in the objective space for linear biobjective optimization problems. This method combines the concepts used in the so- called NISE-method (the noninferior set estimation method proposed by the second author, \textit{R. L. Church} and \textit{D. P. Sheer} [Water Resour. Res. 15, No.5, 1001-1010 (1979)]) and multiparametric decomposition. A sharp measure for the geometrical error is used to obtain a subset of the noninferior vectors distributed over the entire noninferior set. The deviation of the approximate representation from the exact noninferior set can be controlled by specifying the maximum possible deviation.
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4116316
zbMATH Keywords: approximate representation
zbMATH Keywords: noninferior set
zbMATH Keywords: linear biobjective optimization
zbMATH Keywords: multiparametric decomposition
reviewed by: Jürgen Guddat
MaRDI profile type: Publication
full work available at URL: 0377-2217(89)90256-7
OpenAlex ID: W1969144249
cites work: Multiobjective programming and planning
cites work: Generating all maximal efficient faces for multiple objective linear programs
cites work: A revised simplex method for linear multiple objective programs
cites work: Vektormaximumproblem und parametrische optimierung
cites work: Multiparametric Linear Programming
cites work: Proper efficiency and the theory of vector maximization
cites work: Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
cites work: Algorithms for the vector maximization problem
cites work: Multiple Objective Linear Programming with Interval Criterion Weights
cites work: Q3815146
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
cites work: Linear Multiparametric Programming by Multicriteria Simplex Method
cites work: Linear multiobjective programming
description: scientific article; zbMATH DE number 4116316