Approximating the noninferior set in linear biobjective programs using multiparametric decomposition (Q1823867): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Multiobjective programming and planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all maximal efficient faces for multiple objective linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A revised simplex method for linear multiple objective programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vektormaximumproblem und parametrische optimierung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparametric Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper efficiency and the theory of vector maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Proper Efficiency and the Linear Vector Maximum Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the vector maximization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Objective Linear Programming with Interval Criterion Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Multiparametric Programming by Multicriteria Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multiobjective programming / rank
 
Normal rank

Latest revision as of 10:48, 20 June 2024

scientific article
Language Label Description Also known as
English
Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
scientific article

    Statements

    Approximating the noninferior set in linear biobjective programs using multiparametric decomposition (English)
    0 references
    0 references
    0 references
    1989
    0 references
    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.
    0 references
    0 references
    approximate representation
    0 references
    noninferior set
    0 references
    linear biobjective optimization
    0 references
    multiparametric decomposition
    0 references
    0 references