A simplex based algorithm for the lexicographically extended linear maxmin problem
Author:
- 31 July 1981
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 7 (3) , 274-283
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On optimal decisions under complete ignoranceEuropean Journal of Operational Research, 1977
- Lexicographic quasiconcave multiobjective programmingMathematical Methods of Operations Research, 1977
- Tschebyscheff‐Ausgleich überbestimmter Systeme linearer Gleichungen ‐ Eindeutigkeit ohneHaarsche Bedingung durch lexikographischen AusgleichZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1977
- Multi-criterion problems with uniform equivalent criteriaUSSR Computational Mathematics and Mathematical Physics, 1975
- A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$SIAM Journal on Numerical Analysis, 1973
- KonvexeN-Stufen-Max-Min-OptimierungMathematical Methods of Operations Research, 1970
- The Nucleolus of a Characteristic Function GameSIAM Journal on Applied Mathematics, 1969
- Über die operationelle Eignung von EntscheidungsmodellenStatistische Hefte, 1966
- Approximations in $L^p $ and Chebyshev ApproximationsJournal of the Society for Industrial and Applied Mathematics, 1963
- Tchebycheff approximation in a compact metric spaceBulletin of the American Mathematical Society, 1962