The range of the efficient frontier in multiple objective linear programming

DOI10.1007/BF02612714MaRDI QIDQ3040942zbMATH OpenOpenAlexFDO

Authors Rainer Rhode, Reinhard Weber

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)

Cites work

• scientific article; zbMATH DE number 3743036 (Why is no real title available?)
• scientific article; zbMATH DE number 3788378 (Why is no real title available?)
• scientific article; zbMATH DE number 3543799 (Why is no real title available?)
• scientific article; zbMATH DE number 3630504 (Why is no real title available?)
• scientific article; zbMATH DE number 3356433 (Why is no real title available?)
• scientific article; zbMATH DE number 3185418 (Why is no real title available?)
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Generating all maximal efficient faces for multiple objective linear programs
• On Computing an Initial Efficient Extreme Point
• Proper efficiency and the theory of vector maximization
• Solving Bicriterion Mathematical Programs
• Stability in convex quadratic parametric programming
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• The Nucleolus as a Solution of a Minimization Problem
• The Simplex Method for Quadratic Programming
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• The structure of admissible points with respect to cone dominance

Cited in

(5)

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

This page was built for publication: The range of the efficient frontier in multiple objective linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3040942)