Approximating the noninferior set in linear biobjective programs using multiparametric decomposition

DOI10.1016/0377-2217(89)90256-7zbMath0681.90071OpenAlexW1969144249MaRDI QIDQ1823867

Rajendra S. Solanki, Jared L. Cohon

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90256-7

zbMATH Keywords

approximate representationlinear biobjective optimizationmultiparametric decompositionnoninferior set

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31)

Related Items (4)

Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ Approximating the noninferior set in multiobjective linear programming problems ⋮ Approximation methods in multiobjective programming ⋮ An improved multiple criteria visual interactive method with stepwise focused contouring of efficient criterion vectors

Cites Work

• Unnamed Item
• Multiobjective programming and planning
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Linear multiobjective programming
• Generating all maximal efficient faces for multiple objective linear programs
• Proper efficiency and the theory of vector maximization
• Multiple Objective Linear Programming with Interval Criterion Weights
• Linear Multiparametric Programming by Multicriteria Simplex Method
• Vektormaximumproblem und parametrische optimierung
• A revised simplex method for linear multiple objective programs
• Algorithms for the vector maximization problem
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• Multiparametric Linear Programming

This page was built for publication: Approximating the noninferior set in linear biobjective programs using multiparametric decomposition