Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions

DOI10.1007/BF01720769zbMath0598.90084MaRDI QIDQ1080368

Fred Alois Behringer

Publication date: 1986

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

optimality conditionslexmaxmin extension

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (3)

Equitable aggregations and multiple criteria analysis ⋮ On the lexicographic centre of multiple objective optimization ⋮ A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions

Cites Work

• Unnamed Item
• Unnamed Item
• Some characterizations of the optimal solutions of a vector optimization problem
• A simplex based algorithm for the lexicographically extended linear maxmin problem
• Linear lexicographic optimization
• Proper Efficiency in Nonconvex Multicriteria Programming
• Bibliographic zur vektoroptimierung (theorie und anwendungen)
• Ein erweitertes effizienztheorerm
• Bibliographic zur Vektoroptimierung -Theorie und Anwendungen (l. Fortsetzung)
• Linear max-min programming
• Multiple Objective Linear Fractional Programming
• Lexicographic quasiconcave multiobjective programming
• Programming problems with maximin objective function
• Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
• Approximations in $L^p $ and Chebyshev Approximations
• The Nucleolus of a Characteristic Function Game
• Convex Analysis

This page was built for publication: Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions