On the efficient point set of tricriteria linear programs

DOI10.1016/0377-2217(94)90340-9zbMath0798.90122OpenAlexW2024891200MaRDI QIDQ1319580

Karsten Mekelburg, Bernd Fruhwirth

Publication date: 12 April 1994

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90340-9

zbMATH Keywords

efficient pointsthree objective functionstricriteria linear programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05)

Related Items (4)

SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ Primal and dual algorithms for optimization over the efficient set ⋮ SVM classification for imbalanced data sets using a multiobjective optimization framework ⋮ Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Approximation of convex curves with application to the bicriterial minimum cost flow problem
• Proper efficiency and the theory of vector maximization
• Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
• Vektormaximumproblem und parametrische optimierung

This page was built for publication: On the efficient point set of tricriteria linear programs