A simplex based algorithm for the lexicographically extended linear maxmin problem
type: Item
instance of: scholarly article
title: A simplex based algorithm for the lexicographically extended linear maxmin problem
zbMATH Open document ID: 0455.90053
DOI: 10.1016/0377-2217(81)90349-0
author: Fred Alois Behringer
published in: European Journal of Operational Research
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 3713481
zbMATH Keywords: simplex based algorithm
zbMATH Keywords: lexicographically extended linear maxmin problem
MaRDI profile type: Publication
full work available at URL: 0377-2217(81)90349-0
OpenAlex ID: W2075397729
cites work: KonvexeN-Stufen-Max-Min-Optimierung
cites work: Operations Research und Angewandte Statistik
cites work: On optimal decisions under complete ignorance. A new criterion stronger than both Pareto and Maxmin
cites work: Lexicographic quasiconcave multiobjective programming
cites work: Tschebyscheff-Ausgleich überbestimmter Systeme linearer Gleichungen - Eindeutigkeit ohneHaarsche Bedingung durch lexikographischen Ausgleich
cites work: Preferred Optimal Strategies
cites work: Approximations in $L^p $ and Chebyshev Approximations
cites work: Q3274599
cites work: A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$
cites work: Q4184579
cites work: Q4085163
cites work: Q5592817
cites work: Q5528250
cites work: Multi-criterion problems with uniform equivalent criteria
cites work: Tchebycheff approximation in a compact metric space
cites work: The Nucleolus of a Characteristic Function Game
cites work: Q5635232
description: scientific article; zbMATH DE number 3713481