Approximating the noninferior set in linear biobjective programs using multiparametric decomposition

Approximating the noninferior set in linear biobjective programs using multiparametric decomposition

0.00 Avg rating0 Votes
Article ID: iaor19891112
Country: Netherlands
Volume: 41
Issue: 3
Start Page Number: 355
End Page Number: 366
Publication Date: Aug 1989
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: parametric
Abstract:

An algorithm is developed to generate an approximate representation of the noninferior set in the objective space for linear biobjective programs. A sharp measure of geometrical error based on multiparametric decomposition is used to obtain a subset of the noninferior objective vectors distributed over the entire noninferior set. The deviation of the approximate representation from the exact noninferior set in the objective space can be controlled by specifying the maximum possible deviation. The algorithm attempts to select each additional noninferior objective vector to be included in the approximation to reduce the deviation as quickly as possible.

Reviews

Required fields are marked *. Your email address will not be published.