The range of the efficient frontier in multiple objective linear programming

DOI10.1007/BF02612714zbMath0526.90080OpenAlexW2095073305MaRDI QIDQ3040942

Reinhard Weber, Rainer Rhode

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02612714

zbMATH Keywords

efficiencyparametric quadratic programmingmultiple objective linear programmingWolfe's algorithmrange of the efficient frontier

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31)

Related Items

A simplified MOLP algorithm: The MOLP-S procedure, Linear complementarity problems and multiple objective programming, Optimization over the efficient set, Optimization over the efficient set using an active constraint approach, Solving multiple objective linear programs in objective space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• The structure of admissible points with respect to cone dominance
• Generating all maximal efficient faces for multiple objective linear programs
• Proper efficiency and the theory of vector maximization
• The Simplex Method for Quadratic Programming
• Stability in convex quadratic parametric programming
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• On Computing an Initial Efficient Extreme Point
• Solving Bicriterion Mathematical Programs
• The Nucleolus as a Solution of a Minimization Problem