A simplex based algorithm for the lexicographically extended linear maxmin problem

DOI10.1016/0377-2217(81)90349-0zbMath0455.90053OpenAlexW2075397729MaRDI QIDQ1150307

Fred Alois Behringer

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0377-2217(81)90349-0

zbMATH Keywords

lexicographically extended linear maxmin problemsimplex based algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (17)

On the lexicographic centre of multiple objective optimization ⋮ Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions ⋮ Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints ⋮ An interactive fuzzy programming system ⋮ Interactive multiple objective programming subject to flexible constraints ⋮ Two-phase approach for solving the fuzzy linear programming problems ⋮ Finding the nucleolus of the vehicle routing game with time windows ⋮ Beam selection in radiotherapy design ⋮ Leximin optimality and fuzzy set-theoretic operations. ⋮ A lexicographic minimax approach to the vehicle routing problem with route balancing ⋮ Analytic solution for the nucleolus of a three-player cooperative game ⋮ A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions ⋮ An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems ⋮ Reducing the number of linear programs needed for solving the nucleolus problem of \(n\)-person game theory ⋮ Fair optimization and networks: a survey ⋮ Computing improved optimal solutions to max-min flexible constraint satisfaction problems ⋮ Applications of fuzzy set theory to mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On optimal decisions under complete ignorance. A new criterion stronger than both Pareto and Maxmin
• Preferred Optimal Strategies
• Tchebycheff approximation in a compact metric space
• Lexicographic quasiconcave multiobjective programming
• Multi-criterion problems with uniform equivalent criteria
• Tschebyscheff-Ausgleich überbestimmter Systeme linearer Gleichungen - Eindeutigkeit ohneHaarsche Bedingung durch lexikographischen Ausgleich
• Approximations in $L^p $ and Chebyshev Approximations
• The Nucleolus of a Characteristic Function Game
• KonvexeN-Stufen-Max-Min-Optimierung
• A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$
• Operations Research und Angewandte Statistik

This page was built for publication: A simplex based algorithm for the lexicographically extended linear maxmin problem