Application of the ellipsoid method in an interactive procedure for multicriteria linear programming

DOI10.1007/BF01918767zbMath0539.90091OpenAlexW2078617023MaRDI QIDQ3328300

Jaroslaw Warczynski, Slowinski, Roman

Publication date: 1984

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01918767

zbMATH Keywords

ellipsoid algorithmsimplex methodcomputational comparisonsSTEMinteractive proceduremulticriteria linear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items (2)

Unified interactive multiple objective programming ⋮ Interactive multiple objective optimization: Survey. I: Continuous case

Cites Work

• Unnamed Item
• Unnamed Item
• Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
• Complexity of linear programming
• The ellipsoid method and its consequences in combinatorial optimization
• On the interactive solution to a multicriteria scheduling problem
• Feature Article—The Ellipsoid Method: A Survey
• The Average number of pivot steps required by the Simplex-Method is polynomial
• Linear programming with multiple objective functions: Step method (stem)

This page was built for publication: Application of the ellipsoid method in an interactive procedure for multicriteria linear programming