Application of the ellipsoid method in an interactive procedure for multicriteria linear programming
From MaRDI portal
Publication:3328300
DOI10.1007/BF01918767zbMath0539.90091MaRDI QIDQ3328300
Slowinski, Roman, Jaroslaw Warczynski
Publication date: 1984
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
ellipsoid algorithm; simplex method; computational comparisons; STEM; interactive procedure; multicriteria linear programming
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
90C31: Sensitivity, stability, parametric optimization
90C05: Linear programming
Related Items
Interactive multiple objective optimization: Survey. I: Continuous case, Unified interactive multiple objective programming
Cites Work
- 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)
- Unnamed Item
- Unnamed Item