A simplex based algorithm for the lexicographically extended linear maxmin problem
From MaRDI portal
Cites work
- A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to Ax=b
- Approximations in L^p and Chebyshev Approximations
- scientific article; zbMATH DE number 3156825 (Why is no real title available?)
- scientific article; zbMATH DE number 3504368 (Why is no real title available?)
- scientific article; zbMATH DE number 3621410 (Why is no real title available?)
- scientific article; zbMATH DE number 3240850 (Why is no real title available?)
- scientific article; zbMATH DE number 3312388 (Why is no real title available?)
- scientific article; zbMATH DE number 3361657 (Why is no real title available?)
- KonvexeN-Stufen-Max-Min-Optimierung
- Lexicographic quasiconcave multiobjective programming
- Multi-criterion problems with uniform equivalent criteria
- On optimal decisions under complete ignorance. A new criterion stronger than both Pareto and Maxmin
- Operations Research und Angewandte Statistik
- Preferred Optimal Strategies
- Tchebycheff approximation in a compact metric space
- The Nucleolus of a Characteristic Function Game
- Tschebyscheff-Ausgleich überbestimmter Systeme linearer Gleichungen - Eindeutigkeit ohneHaarsche Bedingung durch lexikographischen Ausgleich
Cited in
(17)- Applications of fuzzy set theory to mathematical programming
- Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions
- An interactive fuzzy programming system
- Interactive multiple objective programming subject to flexible constraints
- Two-phase approach for solving the fuzzy linear programming problems
- Reducing the number of linear programs needed for solving the nucleolus problem of n-person game theory
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems
- Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints
- Finding the nucleolus of the vehicle routing game with time windows
- A lexicographic minimax approach to the vehicle routing problem with route balancing
- An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems
- Fair optimization and networks: a survey
- Beam selection in radiotherapy design
- On the lexicographic centre of multiple objective optimization
- Analytic solution for the nucleolus of a three-player cooperative game
- Leximin optimality and fuzzy set-theoretic operations.
- A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions
This page was built for publication: A simplex based algorithm for the lexicographically extended linear maxmin problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1150307)
