Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3311422 (Why is no real title available?)
- scientific article; zbMATH DE number 3361657 (Why is no real title available?)
- A simplex based algorithm for the lexicographically extended linear maxmin problem
- Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
- Approximations in $L^p $ and Chebyshev Approximations
- Bibliographic zur Vektoroptimierung -Theorie und Anwendungen (l. Fortsetzung)
- Bibliographic zur vektoroptimierung (theorie und anwendungen)
- Convex Analysis
- Ein erweitertes effizienztheorerm
- Lexicographic quasiconcave multiobjective programming
- Linear lexicographic optimization
- Linear max-min programming
- Multiple Objective Linear Fractional Programming
- Programming problems with maximin objective function
- Proper Efficiency in Nonconvex Multicriteria Programming
- Some characterizations of the optimal solutions of a vector optimization problem
- The Nucleolus of a Characteristic Function Game
Cited in
(4)- On the lexicographic centre of multiple objective optimization
- Pareto-optimal and lexicographic solutions to mixed-integer problems of linear form in continuous variables
- Equitable aggregations and multiple criteria analysis
- A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions
This page was built for publication: Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1080368)
